/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/05_tas.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 08:10:21,107 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 08:10:21,110 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 08:10:21,148 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 08:10:21,148 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 08:10:21,152 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 08:10:21,155 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 08:10:21,162 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 08:10:21,164 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 08:10:21,169 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 08:10:21,170 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 08:10:21,170 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 08:10:21,171 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 08:10:21,171 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 08:10:21,172 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 08:10:21,173 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 08:10:21,173 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 08:10:21,174 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 08:10:21,175 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 08:10:21,177 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 08:10:21,178 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 08:10:21,181 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 08:10:21,182 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 08:10:21,184 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 08:10:21,191 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 08:10:21,192 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 08:10:21,192 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 08:10:21,193 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 08:10:21,194 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 08:10:21,194 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 08:10:21,194 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 08:10:21,195 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 08:10:21,197 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 08:10:21,197 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 08:10:21,198 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 08:10:21,198 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 08:10:21,199 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 08:10:21,199 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 08:10:21,199 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 08:10:21,200 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 08:10:21,200 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 08:10:21,201 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf [2021-06-05 08:10:21,233 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 08:10:21,233 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 08:10:21,233 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 08:10:21,233 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 08:10:21,235 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 08:10:21,236 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 08:10:21,236 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 08:10:21,236 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 08:10:21,236 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 08:10:21,236 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 08:10:21,237 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 08:10:21,237 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 08:10:21,237 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 08:10:21,237 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 08:10:21,237 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 08:10:21,238 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 08:10:21,238 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 08:10:21,238 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 08:10:21,238 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 08:10:21,238 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 08:10:21,238 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 08:10:21,238 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 08:10:21,238 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 08:10:21,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 08:10:21,239 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 08:10:21,239 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 08:10:21,239 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 08:10:21,239 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 08:10:21,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 08:10:21,239 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 08:10:21,239 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 08:10:21,240 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 08:10:21,240 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-05 08:10:21,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 08:10:21,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 08:10:21,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 08:10:21,563 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 08:10:21,564 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 08:10:21,565 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/05_tas.i [2021-06-05 08:10:21,622 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfb331ab8/6dd08c66dfb04e5583affa905dea1ad7/FLAG4198f89d9 [2021-06-05 08:10:22,180 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 08:10:22,180 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/05_tas.i [2021-06-05 08:10:22,191 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfb331ab8/6dd08c66dfb04e5583affa905dea1ad7/FLAG4198f89d9 [2021-06-05 08:10:22,477 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfb331ab8/6dd08c66dfb04e5583affa905dea1ad7 [2021-06-05 08:10:22,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 08:10:22,481 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 08:10:22,482 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 08:10:22,482 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 08:10:22,485 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 08:10:22,486 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 08:10:22" (1/1) ... [2021-06-05 08:10:22,487 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17e2ee04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:10:22, skipping insertion in model container [2021-06-05 08:10:22,487 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 08:10:22" (1/1) ... [2021-06-05 08:10:22,492 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 08:10:22,521 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 08:10:22,882 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/05_tas.i[30203,30216] [2021-06-05 08:10:22,887 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/05_tas.i[30300,30313] [2021-06-05 08:10:22,890 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/05_tas.i[30446,30459] [2021-06-05 08:10:22,894 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 08:10:22,901 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 08:10:22,936 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/05_tas.i[30203,30216] [2021-06-05 08:10:22,937 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/05_tas.i[30300,30313] [2021-06-05 08:10:22,938 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/05_tas.i[30446,30459] [2021-06-05 08:10:22,939 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 08:10:23,004 INFO L208 MainTranslator]: Completed translation [2021-06-05 08:10:23,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:10:23 WrapperNode [2021-06-05 08:10:23,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 08:10:23,006 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 08:10:23,006 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 08:10:23,006 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 08:10:23,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:10:23" (1/1) ... [2021-06-05 08:10:23,040 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:10:23" (1/1) ... [2021-06-05 08:10:23,063 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 08:10:23,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 08:10:23,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 08:10:23,065 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 08:10:23,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:10:23" (1/1) ... [2021-06-05 08:10:23,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:10:23" (1/1) ... [2021-06-05 08:10:23,077 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:10:23" (1/1) ... [2021-06-05 08:10:23,078 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:10:23" (1/1) ... [2021-06-05 08:10:23,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:10:23" (1/1) ... [2021-06-05 08:10:23,096 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:10:23" (1/1) ... [2021-06-05 08:10:23,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:10:23" (1/1) ... [2021-06-05 08:10:23,099 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 08:10:23,099 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 08:10:23,099 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 08:10:23,100 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 08:10:23,100 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:10:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 08:10:23,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-05 08:10:23,179 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2021-06-05 08:10:23,179 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2021-06-05 08:10:23,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 08:10:23,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 08:10:23,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 08:10:23,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 08:10:23,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 08:10:23,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 08:10:23,182 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 08:10:23,723 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 08:10:23,723 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2021-06-05 08:10:23,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 08:10:23 BoogieIcfgContainer [2021-06-05 08:10:23,725 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 08:10:23,727 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 08:10:23,727 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 08:10:23,730 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 08:10:23,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 08:10:22" (1/3) ... [2021-06-05 08:10:23,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f9278a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 08:10:23, skipping insertion in model container [2021-06-05 08:10:23,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:10:23" (2/3) ... [2021-06-05 08:10:23,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f9278a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 08:10:23, skipping insertion in model container [2021-06-05 08:10:23,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 08:10:23" (3/3) ... [2021-06-05 08:10:23,733 INFO L111 eAbstractionObserver]: Analyzing ICFG 05_tas.i [2021-06-05 08:10:23,738 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 08:10:23,738 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 08:10:23,738 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-06-05 08:10:23,739 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 08:10:23,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_~o.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_#in~o.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_~o.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_#in~o.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_~o.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_#in~o.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_~o.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_#in~o.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,793 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_~o.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_#in~o.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_~o.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_#in~o.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,800 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_~o.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,800 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_#in~o.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,800 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_~o.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,800 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_#in~o.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,802 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,802 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,802 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,802 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,802 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,802 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,804 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,804 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,804 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,804 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,806 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,806 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,806 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,806 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,806 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,806 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,809 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,809 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_#in~o.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_~o.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,812 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_~o.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_TAS_#in~o.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:23,816 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 08:10:23,835 INFO L255 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-05 08:10:23,860 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 08:10:23,861 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 08:10:23,861 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 08:10:23,861 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 08:10:23,861 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 08:10:23,861 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 08:10:23,861 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 08:10:23,861 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 08:10:23,875 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 82 transitions, 169 flow [2021-06-05 08:10:23,914 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 647 states, 638 states have (on average 2.1363636363636362) internal successors, (1363), 646 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:23,917 INFO L276 IsEmpty]: Start isEmpty. Operand has 647 states, 638 states have (on average 2.1363636363636362) internal successors, (1363), 646 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:23,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 08:10:23,935 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:10:23,936 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:10:23,936 INFO L430 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:10:23,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:10:23,941 INFO L82 PathProgramCache]: Analyzing trace with hash -388425969, now seen corresponding path program 1 times [2021-06-05 08:10:23,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:10:23,949 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980325849] [2021-06-05 08:10:23,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:10:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:10:24,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:10:24,132 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:10:24,132 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980325849] [2021-06-05 08:10:24,133 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980325849] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:10:24,133 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:10:24,133 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 08:10:24,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432480807] [2021-06-05 08:10:24,137 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 08:10:24,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:10:24,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 08:10:24,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 08:10:24,150 INFO L87 Difference]: Start difference. First operand has 647 states, 638 states have (on average 2.1363636363636362) internal successors, (1363), 646 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:24,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:10:24,167 INFO L93 Difference]: Finished difference Result 354 states and 664 transitions. [2021-06-05 08:10:24,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 08:10:24,168 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 08:10:24,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:10:24,178 INFO L225 Difference]: With dead ends: 354 [2021-06-05 08:10:24,178 INFO L226 Difference]: Without dead ends: 354 [2021-06-05 08:10:24,179 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 08:10:24,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-06-05 08:10:24,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2021-06-05 08:10:24,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 351 states have (on average 1.8917378917378918) internal successors, (664), 353 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:24,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 664 transitions. [2021-06-05 08:10:24,227 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 664 transitions. Word has length 32 [2021-06-05 08:10:24,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:10:24,227 INFO L482 AbstractCegarLoop]: Abstraction has 354 states and 664 transitions. [2021-06-05 08:10:24,227 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:24,227 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 664 transitions. [2021-06-05 08:10:24,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-06-05 08:10:24,231 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:10:24,232 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:10:24,233 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 08:10:24,233 INFO L430 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:10:24,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:10:24,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1029183315, now seen corresponding path program 1 times [2021-06-05 08:10:24,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:10:24,235 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372227347] [2021-06-05 08:10:24,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:10:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:10:24,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:10:24,401 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:10:24,401 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372227347] [2021-06-05 08:10:24,401 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372227347] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:10:24,401 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:10:24,401 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 08:10:24,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599624586] [2021-06-05 08:10:24,403 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 08:10:24,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:10:24,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 08:10:24,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 08:10:24,405 INFO L87 Difference]: Start difference. First operand 354 states and 664 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:24,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:10:24,624 INFO L93 Difference]: Finished difference Result 394 states and 716 transitions. [2021-06-05 08:10:24,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 08:10:24,625 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-06-05 08:10:24,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:10:24,630 INFO L225 Difference]: With dead ends: 394 [2021-06-05 08:10:24,630 INFO L226 Difference]: Without dead ends: 394 [2021-06-05 08:10:24,630 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 109.5ms TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-06-05 08:10:24,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-06-05 08:10:24,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 342. [2021-06-05 08:10:24,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 339 states have (on average 1.8761061946902655) internal successors, (636), 341 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:24,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 636 transitions. [2021-06-05 08:10:24,660 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 636 transitions. Word has length 34 [2021-06-05 08:10:24,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:10:24,660 INFO L482 AbstractCegarLoop]: Abstraction has 342 states and 636 transitions. [2021-06-05 08:10:24,664 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:24,664 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 636 transitions. [2021-06-05 08:10:24,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-06-05 08:10:24,667 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:10:24,668 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:10:24,668 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 08:10:24,668 INFO L430 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:10:24,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:10:24,669 INFO L82 PathProgramCache]: Analyzing trace with hash -993607330, now seen corresponding path program 1 times [2021-06-05 08:10:24,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:10:24,669 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862885675] [2021-06-05 08:10:24,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:10:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:10:24,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:10:24,849 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:10:24,850 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862885675] [2021-06-05 08:10:24,850 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862885675] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:10:24,850 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673852812] [2021-06-05 08:10:24,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:10:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:10:24,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 24 conjunts are in the unsatisfiable core [2021-06-05 08:10:24,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:10:25,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:10:25,036 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:10:25,040 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:10:25,042 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:10:25,042 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:10:25,119 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:10:25,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 08:10:25,122 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:10:25,127 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:10:25,128 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:10:25,128 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2021-06-05 08:10:25,288 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:10:25,289 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2021-06-05 08:10:25,294 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:10:25,301 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:10:25,302 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:10:25,303 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:15 [2021-06-05 08:10:25,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:10:25,389 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:10:25,396 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:10:25,408 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:10:25,408 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:11 [2021-06-05 08:10:25,583 INFO L354 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2021-06-05 08:10:25,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 23 [2021-06-05 08:10:25,588 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:10:25,595 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:10:25,599 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:10:25,599 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:30, output treesize:8 [2021-06-05 08:10:25,622 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:10:25,622 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673852812] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:10:25,623 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:10:25,623 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2021-06-05 08:10:25,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663483223] [2021-06-05 08:10:25,623 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 08:10:25,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:10:25,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 08:10:25,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-06-05 08:10:25,624 INFO L87 Difference]: Start difference. First operand 342 states and 636 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:26,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:10:26,041 INFO L93 Difference]: Finished difference Result 560 states and 1042 transitions. [2021-06-05 08:10:26,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 08:10:26,041 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-06-05 08:10:26,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:10:26,043 INFO L225 Difference]: With dead ends: 560 [2021-06-05 08:10:26,043 INFO L226 Difference]: Without dead ends: 560 [2021-06-05 08:10:26,044 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 465.5ms TimeCoverageRelationStatistics Valid=255, Invalid=737, Unknown=0, NotChecked=0, Total=992 [2021-06-05 08:10:26,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2021-06-05 08:10:26,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 340. [2021-06-05 08:10:26,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 337 states have (on average 1.8783382789317506) internal successors, (633), 339 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:26,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 633 transitions. [2021-06-05 08:10:26,058 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 633 transitions. Word has length 40 [2021-06-05 08:10:26,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:10:26,058 INFO L482 AbstractCegarLoop]: Abstraction has 340 states and 633 transitions. [2021-06-05 08:10:26,058 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:26,059 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 633 transitions. [2021-06-05 08:10:26,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-06-05 08:10:26,061 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:10:26,061 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:10:26,272 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-06-05 08:10:26,273 INFO L430 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:10:26,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:10:26,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1523585580, now seen corresponding path program 2 times [2021-06-05 08:10:26,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:10:26,274 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581509141] [2021-06-05 08:10:26,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:10:26,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:10:26,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:10:26,413 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:10:26,413 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581509141] [2021-06-05 08:10:26,413 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581509141] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:10:26,413 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421104023] [2021-06-05 08:10:26,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:10:26,488 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 08:10:26,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:10:26,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 08:10:26,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:10:26,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:10:26,517 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:10:26,520 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:10:26,521 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:10:26,521 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:10:26,572 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:10:26,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:10:26,576 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:10:26,582 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:10:26,583 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:10:26,583 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2021-06-05 08:10:26,659 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:10:26,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 08:10:26,667 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:10:26,673 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:10:26,673 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:10:26,674 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2021-06-05 08:10:26,725 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:10:26,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2021-06-05 08:10:26,728 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:10:26,735 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:10:26,736 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:10:26,737 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:23 [2021-06-05 08:10:26,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-06-05 08:10:26,822 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:10:26,851 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:10:26,854 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:10:26,854 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:22 [2021-06-05 08:10:26,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2021-06-05 08:10:26,996 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:10:27,001 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:10:27,003 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:10:27,003 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:8 [2021-06-05 08:10:27,029 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:10:27,029 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421104023] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:10:27,030 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:10:27,030 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 08:10:27,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091267286] [2021-06-05 08:10:27,030 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 08:10:27,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:10:27,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 08:10:27,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2021-06-05 08:10:27,031 INFO L87 Difference]: Start difference. First operand 340 states and 633 transitions. Second operand has 20 states, 20 states have (on average 3.2) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:27,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:10:27,549 INFO L93 Difference]: Finished difference Result 342 states and 636 transitions. [2021-06-05 08:10:27,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 08:10:27,550 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.2) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-06-05 08:10:27,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:10:27,552 INFO L225 Difference]: With dead ends: 342 [2021-06-05 08:10:27,553 INFO L226 Difference]: Without dead ends: 342 [2021-06-05 08:10:27,553 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 520.4ms TimeCoverageRelationStatistics Valid=201, Invalid=611, Unknown=0, NotChecked=0, Total=812 [2021-06-05 08:10:27,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2021-06-05 08:10:27,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 322. [2021-06-05 08:10:27,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 320 states have (on average 1.8875) internal successors, (604), 321 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:27,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 604 transitions. [2021-06-05 08:10:27,560 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 604 transitions. Word has length 40 [2021-06-05 08:10:27,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:10:27,560 INFO L482 AbstractCegarLoop]: Abstraction has 322 states and 604 transitions. [2021-06-05 08:10:27,561 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 3.2) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:27,561 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 604 transitions. [2021-06-05 08:10:27,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-06-05 08:10:27,561 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:10:27,561 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:10:27,776 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:10:27,777 INFO L430 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:10:27,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:10:27,777 INFO L82 PathProgramCache]: Analyzing trace with hash -23134536, now seen corresponding path program 1 times [2021-06-05 08:10:27,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:10:27,777 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142130379] [2021-06-05 08:10:27,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:10:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:10:27,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:10:27,834 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:10:27,834 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142130379] [2021-06-05 08:10:27,834 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142130379] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:10:27,834 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:10:27,834 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 08:10:27,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529080885] [2021-06-05 08:10:27,835 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 08:10:27,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:10:27,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 08:10:27,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 08:10:27,835 INFO L87 Difference]: Start difference. First operand 322 states and 604 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:27,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:10:27,866 INFO L93 Difference]: Finished difference Result 514 states and 980 transitions. [2021-06-05 08:10:27,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 08:10:27,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-06-05 08:10:27,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:10:27,870 INFO L225 Difference]: With dead ends: 514 [2021-06-05 08:10:27,870 INFO L226 Difference]: Without dead ends: 514 [2021-06-05 08:10:27,870 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 22.6ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 08:10:27,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2021-06-05 08:10:27,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2021-06-05 08:10:27,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 512 states have (on average 1.9140625) internal successors, (980), 513 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:27,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 980 transitions. [2021-06-05 08:10:27,882 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 980 transitions. Word has length 40 [2021-06-05 08:10:27,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:10:27,882 INFO L482 AbstractCegarLoop]: Abstraction has 514 states and 980 transitions. [2021-06-05 08:10:27,882 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:27,882 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 980 transitions. [2021-06-05 08:10:27,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-06-05 08:10:27,883 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:10:27,883 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:10:27,883 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 08:10:27,883 INFO L430 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:10:27,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:10:27,884 INFO L82 PathProgramCache]: Analyzing trace with hash -33487152, now seen corresponding path program 1 times [2021-06-05 08:10:27,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:10:27,884 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625894659] [2021-06-05 08:10:27,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:10:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:10:27,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:10:27,913 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:10:27,913 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625894659] [2021-06-05 08:10:27,913 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625894659] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:10:27,913 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:10:27,913 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 08:10:27,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446393962] [2021-06-05 08:10:27,914 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 08:10:27,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:10:27,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 08:10:27,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 08:10:27,914 INFO L87 Difference]: Start difference. First operand 514 states and 980 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:27,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:10:27,952 INFO L93 Difference]: Finished difference Result 592 states and 1096 transitions. [2021-06-05 08:10:27,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 08:10:27,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-06-05 08:10:27,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:10:27,955 INFO L225 Difference]: With dead ends: 592 [2021-06-05 08:10:27,955 INFO L226 Difference]: Without dead ends: 592 [2021-06-05 08:10:27,956 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 08:10:27,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2021-06-05 08:10:27,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 564. [2021-06-05 08:10:27,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 562 states have (on average 1.8718861209964412) internal successors, (1052), 563 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:27,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 1052 transitions. [2021-06-05 08:10:27,968 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 1052 transitions. Word has length 47 [2021-06-05 08:10:27,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:10:27,969 INFO L482 AbstractCegarLoop]: Abstraction has 564 states and 1052 transitions. [2021-06-05 08:10:27,969 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:27,969 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 1052 transitions. [2021-06-05 08:10:27,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-06-05 08:10:27,970 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:10:27,970 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:10:27,970 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 08:10:27,970 INFO L430 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:10:27,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:10:27,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1975404197, now seen corresponding path program 1 times [2021-06-05 08:10:27,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:10:27,971 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649957747] [2021-06-05 08:10:27,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:10:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:10:28,023 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:10:28,024 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:10:28,024 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649957747] [2021-06-05 08:10:28,024 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649957747] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:10:28,024 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449705734] [2021-06-05 08:10:28,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:10:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:10:28,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 21 conjunts are in the unsatisfiable core [2021-06-05 08:10:28,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:10:28,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:10:28,157 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:10:28,160 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:10:28,177 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:10:28,177 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:10:28,225 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:10:28,226 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 08:10:28,228 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:10:28,232 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:10:28,232 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:10:28,232 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2021-06-05 08:10:28,337 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:10:28,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2021-06-05 08:10:28,339 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:10:28,343 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:10:28,344 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:10:28,344 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:15 [2021-06-05 08:10:28,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:10:28,396 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:10:28,402 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:10:28,403 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:10:28,404 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:11 [2021-06-05 08:10:28,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:10:28,472 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:10:28,473 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:10:28,473 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:10:28,473 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2021-06-05 08:10:28,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:10:28,477 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449705734] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:10:28,477 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:10:28,477 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2021-06-05 08:10:28,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877589545] [2021-06-05 08:10:28,478 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 08:10:28,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:10:28,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 08:10:28,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 08:10:28,479 INFO L87 Difference]: Start difference. First operand 564 states and 1052 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:28,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:10:28,578 INFO L93 Difference]: Finished difference Result 558 states and 1043 transitions. [2021-06-05 08:10:28,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 08:10:28,579 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-06-05 08:10:28,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:10:28,581 INFO L225 Difference]: With dead ends: 558 [2021-06-05 08:10:28,581 INFO L226 Difference]: Without dead ends: 558 [2021-06-05 08:10:28,581 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 84.9ms TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-06-05 08:10:28,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2021-06-05 08:10:28,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 490. [2021-06-05 08:10:28,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 489 states have (on average 1.9120654396728016) internal successors, (935), 489 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:28,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 935 transitions. [2021-06-05 08:10:28,592 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 935 transitions. Word has length 53 [2021-06-05 08:10:28,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:10:28,593 INFO L482 AbstractCegarLoop]: Abstraction has 490 states and 935 transitions. [2021-06-05 08:10:28,593 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:28,593 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 935 transitions. [2021-06-05 08:10:28,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 08:10:28,594 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:10:28,594 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:10:28,808 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:10:28,809 INFO L430 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:10:28,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:10:28,809 INFO L82 PathProgramCache]: Analyzing trace with hash 527269313, now seen corresponding path program 1 times [2021-06-05 08:10:28,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:10:28,810 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357680602] [2021-06-05 08:10:28,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:10:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:10:28,886 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:10:28,887 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:10:28,887 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357680602] [2021-06-05 08:10:28,887 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357680602] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:10:28,887 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:10:28,887 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 08:10:28,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045423551] [2021-06-05 08:10:28,888 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 08:10:28,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:10:28,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 08:10:28,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 08:10:28,888 INFO L87 Difference]: Start difference. First operand 490 states and 935 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:28,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:10:28,936 INFO L93 Difference]: Finished difference Result 474 states and 905 transitions. [2021-06-05 08:10:28,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 08:10:28,937 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-06-05 08:10:28,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:10:28,937 INFO L225 Difference]: With dead ends: 474 [2021-06-05 08:10:28,937 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 08:10:28,937 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 51.5ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 08:10:28,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 08:10:28,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 08:10:28,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:28,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 08:10:28,938 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2021-06-05 08:10:28,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:10:28,938 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 08:10:28,938 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:28,938 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 08:10:28,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 08:10:28,938 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 08:10:28,939 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2021-06-05 08:10:28,941 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 08:10:28,942 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 08:10:28,942 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 08:10:28,942 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 08:10:28,942 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 08:10:28,942 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 08:10:28,942 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 08:10:28,942 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 08:10:28,942 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 08:10:28,944 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 82 transitions, 169 flow [2021-06-05 08:10:28,955 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 647 states, 638 states have (on average 2.1363636363636362) internal successors, (1363), 646 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:28,956 INFO L276 IsEmpty]: Start isEmpty. Operand has 647 states, 638 states have (on average 2.1363636363636362) internal successors, (1363), 646 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:28,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-06-05 08:10:28,957 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:10:28,957 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:10:28,957 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 08:10:28,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:10:28,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1046667009, now seen corresponding path program 1 times [2021-06-05 08:10:28,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:10:28,957 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493603285] [2021-06-05 08:10:28,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:10:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 08:10:28,968 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 08:10:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 08:10:28,979 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 08:10:29,001 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 08:10:29,002 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 08:10:29,002 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 08:10:29,002 INFO L315 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2021-06-05 08:10:29,002 WARN L242 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 08:10:29,002 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2021-06-05 08:10:29,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_~o.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_#in~o.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_~o.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_#in~o.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_~o.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_#in~o.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_~o.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_#in~o.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_~o.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_#in~o.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_~o.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_#in~o.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_~o.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_#in~o.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_~o.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_#in~o.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,032 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,032 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,035 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_~o.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,035 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_#in~o.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,035 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_~o.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,035 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_#in~o.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,035 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,035 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,035 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,035 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_~o.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_#in~o.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_~o.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_#in~o.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,037 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,037 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,037 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,037 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,042 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,042 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,042 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,042 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,042 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,043 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,043 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,043 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,043 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,043 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,043 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,044 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,044 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_~o.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,044 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_#in~o.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,044 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_~o.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,044 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_#in~o.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,044 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,044 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,044 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,044 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,045 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,045 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_~o.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,045 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_#in~o.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,045 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,045 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_~o.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,045 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_#in~o.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,045 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,045 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,045 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,045 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,045 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,045 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,045 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,045 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,045 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,045 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,047 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,047 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,047 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,047 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,047 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,047 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,047 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,047 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,047 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,047 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,047 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,047 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,048 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,048 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,048 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_#in~o.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,048 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_#in~o.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,048 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_~o.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,049 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,049 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,049 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,049 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,049 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,049 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,049 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,049 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_TAS_~o.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,051 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,051 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_~#cond~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,051 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,051 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,051 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,051 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,051 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_#in~o.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,051 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_#in~o.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,051 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,051 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,051 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,051 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,052 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_~o.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,052 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_acquire_lock_~delay~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,052 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_release_lock_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,052 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,052 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_acquire_lock_~#cond~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,052 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,052 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,052 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_~o.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,052 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_TAS_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,052 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:10:29,053 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 08:10:29,053 INFO L255 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2021-06-05 08:10:29,055 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 08:10:29,055 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 08:10:29,055 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 08:10:29,055 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 08:10:29,055 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 08:10:29,055 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 08:10:29,055 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 08:10:29,055 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 08:10:29,060 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 126 places, 138 transitions, 288 flow [2021-06-05 08:10:31,008 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 30551 states, 30514 states have (on average 3.27390705905486) internal successors, (99900), 30550 states have internal predecessors, (99900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:31,090 INFO L276 IsEmpty]: Start isEmpty. Operand has 30551 states, 30514 states have (on average 3.27390705905486) internal successors, (99900), 30550 states have internal predecessors, (99900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:31,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 08:10:31,158 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:10:31,158 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:10:31,158 INFO L430 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:10:31,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:10:31,159 INFO L82 PathProgramCache]: Analyzing trace with hash 2088245030, now seen corresponding path program 1 times [2021-06-05 08:10:31,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:10:31,159 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411196695] [2021-06-05 08:10:31,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:10:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:10:31,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:10:31,181 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:10:31,181 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411196695] [2021-06-05 08:10:31,181 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411196695] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:10:31,182 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:10:31,182 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 08:10:31,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487611357] [2021-06-05 08:10:31,182 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 08:10:31,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:10:31,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 08:10:31,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 08:10:31,237 INFO L87 Difference]: Start difference. First operand has 30551 states, 30514 states have (on average 3.27390705905486) internal successors, (99900), 30550 states have internal predecessors, (99900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:31,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:10:31,469 INFO L93 Difference]: Finished difference Result 14424 states and 42536 transitions. [2021-06-05 08:10:31,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 08:10:31,469 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 08:10:31,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:10:31,576 INFO L225 Difference]: With dead ends: 14424 [2021-06-05 08:10:31,576 INFO L226 Difference]: Without dead ends: 14424 [2021-06-05 08:10:31,576 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 08:10:31,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14424 states. [2021-06-05 08:10:32,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14424 to 14424. [2021-06-05 08:10:32,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14424 states, 14415 states have (on average 2.9508151231356226) internal successors, (42536), 14423 states have internal predecessors, (42536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:32,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14424 states to 14424 states and 42536 transitions. [2021-06-05 08:10:32,104 INFO L78 Accepts]: Start accepts. Automaton has 14424 states and 42536 transitions. Word has length 32 [2021-06-05 08:10:32,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:10:32,104 INFO L482 AbstractCegarLoop]: Abstraction has 14424 states and 42536 transitions. [2021-06-05 08:10:32,104 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:32,104 INFO L276 IsEmpty]: Start isEmpty. Operand 14424 states and 42536 transitions. [2021-06-05 08:10:32,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-06-05 08:10:32,105 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:10:32,105 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:10:32,106 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 08:10:32,106 INFO L430 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:10:32,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:10:32,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1698137546, now seen corresponding path program 1 times [2021-06-05 08:10:32,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:10:32,106 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041252154] [2021-06-05 08:10:32,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:10:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:10:32,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:10:32,171 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:10:32,171 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041252154] [2021-06-05 08:10:32,171 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041252154] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:10:32,171 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:10:32,171 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 08:10:32,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781007426] [2021-06-05 08:10:32,171 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 08:10:32,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:10:32,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 08:10:32,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 08:10:32,172 INFO L87 Difference]: Start difference. First operand 14424 states and 42536 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:32,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:10:32,802 INFO L93 Difference]: Finished difference Result 24694 states and 72102 transitions. [2021-06-05 08:10:32,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 08:10:32,803 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-06-05 08:10:32,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:10:32,891 INFO L225 Difference]: With dead ends: 24694 [2021-06-05 08:10:32,891 INFO L226 Difference]: Without dead ends: 24694 [2021-06-05 08:10:32,892 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 80.1ms TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2021-06-05 08:10:33,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24694 states. [2021-06-05 08:10:33,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24694 to 16212. [2021-06-05 08:10:33,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16212 states, 16203 states have (on average 2.9677837437511574) internal successors, (48087), 16211 states have internal predecessors, (48087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:33,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16212 states to 16212 states and 48087 transitions. [2021-06-05 08:10:33,645 INFO L78 Accepts]: Start accepts. Automaton has 16212 states and 48087 transitions. Word has length 34 [2021-06-05 08:10:33,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:10:33,645 INFO L482 AbstractCegarLoop]: Abstraction has 16212 states and 48087 transitions. [2021-06-05 08:10:33,646 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:33,646 INFO L276 IsEmpty]: Start isEmpty. Operand 16212 states and 48087 transitions. [2021-06-05 08:10:33,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-06-05 08:10:33,649 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:10:33,649 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:10:33,649 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 08:10:33,649 INFO L430 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:10:33,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:10:33,650 INFO L82 PathProgramCache]: Analyzing trace with hash 827666967, now seen corresponding path program 1 times [2021-06-05 08:10:33,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:10:33,650 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753342755] [2021-06-05 08:10:33,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:10:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:10:33,780 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:10:33,781 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:10:33,781 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753342755] [2021-06-05 08:10:33,781 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753342755] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:10:33,781 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183794010] [2021-06-05 08:10:33,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:10:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:10:33,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 37 conjunts are in the unsatisfiable core [2021-06-05 08:10:33,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:10:33,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:10:33,884 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:10:33,887 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:10:33,888 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:10:33,888 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:10:33,946 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:10:33,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:10:33,949 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:10:33,960 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:10:33,961 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:10:33,961 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:25 [2021-06-05 08:10:34,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:10:34,003 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:10:34,012 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:10:34,014 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:10:34,014 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2021-06-05 08:10:34,054 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:10:34,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 08:10:34,057 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:10:34,158 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2021-06-05 08:10:34,158 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:10:34,159 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:10:34,159 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:26 [2021-06-05 08:10:34,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2021-06-05 08:10:34,219 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:10:34,239 INFO L628 ElimStorePlain]: treesize reduction 4, result has 87.9 percent of original size [2021-06-05 08:10:34,240 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:10:34,240 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:29 [2021-06-05 08:10:34,302 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 08:10:34,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2021-06-05 08:10:34,304 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:10:34,316 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:10:34,319 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:10:34,319 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:21 [2021-06-05 08:10:34,394 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:10:34,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2021-06-05 08:10:34,396 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:10:34,401 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:10:34,403 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:10:34,403 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2021-06-05 08:10:34,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:10:34,425 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183794010] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:10:34,425 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:10:34,425 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 08:10:34,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965625827] [2021-06-05 08:10:34,426 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 08:10:34,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:10:34,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 08:10:34,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2021-06-05 08:10:34,426 INFO L87 Difference]: Start difference. First operand 16212 states and 48087 transitions. Second operand has 19 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 19 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:37,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:10:37,308 INFO L93 Difference]: Finished difference Result 54568 states and 162762 transitions. [2021-06-05 08:10:37,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-06-05 08:10:37,309 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 19 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-06-05 08:10:37,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:10:37,524 INFO L225 Difference]: With dead ends: 54568 [2021-06-05 08:10:37,524 INFO L226 Difference]: Without dead ends: 54568 [2021-06-05 08:10:37,525 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1178 ImplicationChecksByTransitivity, 1329.4ms TimeCoverageRelationStatistics Valid=707, Invalid=3199, Unknown=0, NotChecked=0, Total=3906 [2021-06-05 08:10:37,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54568 states. [2021-06-05 08:10:38,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54568 to 29182. [2021-06-05 08:10:38,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29182 states, 29173 states have (on average 3.0538511637473005) internal successors, (89090), 29181 states have internal predecessors, (89090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:38,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29182 states to 29182 states and 89090 transitions. [2021-06-05 08:10:38,734 INFO L78 Accepts]: Start accepts. Automaton has 29182 states and 89090 transitions. Word has length 40 [2021-06-05 08:10:38,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:10:38,734 INFO L482 AbstractCegarLoop]: Abstraction has 29182 states and 89090 transitions. [2021-06-05 08:10:38,734 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 19 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:38,734 INFO L276 IsEmpty]: Start isEmpty. Operand 29182 states and 89090 transitions. [2021-06-05 08:10:38,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-06-05 08:10:38,762 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:10:38,762 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:10:38,981 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:10:38,981 INFO L430 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:10:38,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:10:38,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1544235087, now seen corresponding path program 1 times [2021-06-05 08:10:38,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:10:38,982 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447283713] [2021-06-05 08:10:38,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:10:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:10:39,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:10:39,019 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:10:39,019 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447283713] [2021-06-05 08:10:39,019 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447283713] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:10:39,019 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:10:39,019 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 08:10:39,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738698540] [2021-06-05 08:10:39,019 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 08:10:39,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:10:39,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 08:10:39,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 08:10:39,020 INFO L87 Difference]: Start difference. First operand 29182 states and 89090 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:39,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:10:39,227 INFO L93 Difference]: Finished difference Result 39052 states and 118568 transitions. [2021-06-05 08:10:39,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 08:10:39,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-06-05 08:10:39,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:10:39,313 INFO L225 Difference]: With dead ends: 39052 [2021-06-05 08:10:39,313 INFO L226 Difference]: Without dead ends: 39052 [2021-06-05 08:10:39,313 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 21.0ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 08:10:39,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39052 states. [2021-06-05 08:10:40,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39052 to 36866. [2021-06-05 08:10:40,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36866 states, 36857 states have (on average 3.0482947608324062) internal successors, (112351), 36865 states have internal predecessors, (112351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:40,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36866 states to 36866 states and 112351 transitions. [2021-06-05 08:10:40,322 INFO L78 Accepts]: Start accepts. Automaton has 36866 states and 112351 transitions. Word has length 40 [2021-06-05 08:10:40,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:10:40,322 INFO L482 AbstractCegarLoop]: Abstraction has 36866 states and 112351 transitions. [2021-06-05 08:10:40,322 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:40,322 INFO L276 IsEmpty]: Start isEmpty. Operand 36866 states and 112351 transitions. [2021-06-05 08:10:40,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-06-05 08:10:40,324 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:10:40,324 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:10:40,325 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 08:10:40,325 INFO L430 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:10:40,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:10:40,325 INFO L82 PathProgramCache]: Analyzing trace with hash 51349121, now seen corresponding path program 1 times [2021-06-05 08:10:40,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:10:40,325 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119940172] [2021-06-05 08:10:40,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:10:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:10:40,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:10:40,363 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:10:40,363 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119940172] [2021-06-05 08:10:40,363 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119940172] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:10:40,363 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:10:40,363 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 08:10:40,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070274505] [2021-06-05 08:10:40,363 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 08:10:40,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:10:40,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 08:10:40,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 08:10:40,364 INFO L87 Difference]: Start difference. First operand 36866 states and 112351 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:41,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:10:41,019 INFO L93 Difference]: Finished difference Result 57459 states and 172855 transitions. [2021-06-05 08:10:41,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 08:10:41,020 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-06-05 08:10:41,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:10:41,128 INFO L225 Difference]: With dead ends: 57459 [2021-06-05 08:10:41,128 INFO L226 Difference]: Without dead ends: 57459 [2021-06-05 08:10:41,128 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 73.4ms TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2021-06-05 08:10:41,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57459 states. [2021-06-05 08:10:42,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57459 to 40864. [2021-06-05 08:10:42,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40864 states, 40855 states have (on average 3.058475094847632) internal successors, (124954), 40863 states have internal predecessors, (124954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:42,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40864 states to 40864 states and 124954 transitions. [2021-06-05 08:10:42,273 INFO L78 Accepts]: Start accepts. Automaton has 40864 states and 124954 transitions. Word has length 41 [2021-06-05 08:10:42,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:10:42,274 INFO L482 AbstractCegarLoop]: Abstraction has 40864 states and 124954 transitions. [2021-06-05 08:10:42,274 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:42,274 INFO L276 IsEmpty]: Start isEmpty. Operand 40864 states and 124954 transitions. [2021-06-05 08:10:42,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-06-05 08:10:42,279 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:10:42,279 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:10:42,279 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 08:10:42,279 INFO L430 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:10:42,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:10:42,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1220555560, now seen corresponding path program 2 times [2021-06-05 08:10:42,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:10:42,280 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339562612] [2021-06-05 08:10:42,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:10:42,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:10:42,350 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:10:42,350 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:10:42,350 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339562612] [2021-06-05 08:10:42,350 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339562612] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:10:42,350 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943327615] [2021-06-05 08:10:42,350 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:10:42,430 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 08:10:42,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:10:42,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 24 conjunts are in the unsatisfiable core [2021-06-05 08:10:42,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:10:42,459 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:10:42,460 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:10:42,463 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:10:42,464 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:10:42,464 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:10:42,493 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:10:42,493 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 08:10:42,495 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:10:42,498 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:10:42,501 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:10:42,501 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2021-06-05 08:10:42,581 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:10:42,581 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2021-06-05 08:10:42,582 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:10:42,586 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:10:42,587 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:10:42,587 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:15 [2021-06-05 08:10:42,727 INFO L354 Elim1Store]: treesize reduction 29, result has 34.1 percent of original size [2021-06-05 08:10:42,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 40 [2021-06-05 08:10:42,729 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:10:42,742 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:10:42,747 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:10:42,748 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:15 [2021-06-05 08:10:42,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:10:42,775 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:10:42,778 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:10:42,778 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:10:42,778 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:8 [2021-06-05 08:10:42,796 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:10:42,797 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943327615] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:10:42,797 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:10:42,797 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2021-06-05 08:10:42,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404126768] [2021-06-05 08:10:42,797 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 08:10:42,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:10:42,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 08:10:42,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2021-06-05 08:10:42,798 INFO L87 Difference]: Start difference. First operand 40864 states and 124954 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:43,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:10:43,824 INFO L93 Difference]: Finished difference Result 53524 states and 161936 transitions. [2021-06-05 08:10:43,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 08:10:43,825 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-06-05 08:10:43,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:10:43,942 INFO L225 Difference]: With dead ends: 53524 [2021-06-05 08:10:43,942 INFO L226 Difference]: Without dead ends: 53524 [2021-06-05 08:10:43,943 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 376.0ms TimeCoverageRelationStatistics Valid=264, Invalid=792, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 08:10:44,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53524 states. [2021-06-05 08:10:45,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53524 to 40676. [2021-06-05 08:10:45,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40676 states, 40667 states have (on average 3.060663437184941) internal successors, (124468), 40675 states have internal predecessors, (124468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:45,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40676 states to 40676 states and 124468 transitions. [2021-06-05 08:10:45,192 INFO L78 Accepts]: Start accepts. Automaton has 40676 states and 124468 transitions. Word has length 47 [2021-06-05 08:10:45,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:10:45,192 INFO L482 AbstractCegarLoop]: Abstraction has 40676 states and 124468 transitions. [2021-06-05 08:10:45,192 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:45,192 INFO L276 IsEmpty]: Start isEmpty. Operand 40676 states and 124468 transitions. [2021-06-05 08:10:45,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-06-05 08:10:45,198 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:10:45,198 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:10:45,412 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-06-05 08:10:45,413 INFO L430 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:10:45,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:10:45,413 INFO L82 PathProgramCache]: Analyzing trace with hash -494814916, now seen corresponding path program 3 times [2021-06-05 08:10:45,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:10:45,413 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831252843] [2021-06-05 08:10:45,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:10:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:10:45,531 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:10:45,531 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:10:45,531 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831252843] [2021-06-05 08:10:45,531 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831252843] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:10:45,531 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094483371] [2021-06-05 08:10:45,531 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:10:45,589 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 08:10:45,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:10:45,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 08:10:45,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:10:45,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:10:45,613 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:10:45,616 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:10:45,616 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:10:45,617 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:10:45,653 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:10:45,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:10:45,655 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:10:45,660 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:10:45,661 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:10:45,661 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2021-06-05 08:10:45,742 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:10:45,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 08:10:45,746 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:10:45,751 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:10:45,752 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:10:45,752 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2021-06-05 08:10:45,793 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:10:45,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2021-06-05 08:10:45,796 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:10:45,802 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:10:45,803 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:10:45,803 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:23 [2021-06-05 08:10:45,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2021-06-05 08:10:45,880 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:10:45,889 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:10:45,890 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:10:45,891 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:23 [2021-06-05 08:10:45,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2021-06-05 08:10:45,960 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:10:45,964 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:10:45,966 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:10:45,966 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:8 [2021-06-05 08:10:45,986 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:10:45,987 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094483371] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:10:45,987 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:10:45,987 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 08:10:45,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515183716] [2021-06-05 08:10:45,987 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 08:10:45,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:10:45,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 08:10:45,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2021-06-05 08:10:45,988 INFO L87 Difference]: Start difference. First operand 40676 states and 124468 transitions. Second operand has 20 states, 20 states have (on average 3.3) internal successors, (66), 20 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:47,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:10:47,564 INFO L93 Difference]: Finished difference Result 85014 states and 260023 transitions. [2021-06-05 08:10:47,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-06-05 08:10:47,565 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.3) internal successors, (66), 20 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-06-05 08:10:47,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:10:47,710 INFO L225 Difference]: With dead ends: 85014 [2021-06-05 08:10:47,710 INFO L226 Difference]: Without dead ends: 85014 [2021-06-05 08:10:47,711 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 651.4ms TimeCoverageRelationStatistics Valid=413, Invalid=1309, Unknown=0, NotChecked=0, Total=1722 [2021-06-05 08:10:48,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85014 states. [2021-06-05 08:10:48,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85014 to 55808. [2021-06-05 08:10:49,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55808 states, 55799 states have (on average 3.1358447284001505) internal successors, (174977), 55807 states have internal predecessors, (174977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:49,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55808 states to 55808 states and 174977 transitions. [2021-06-05 08:10:49,180 INFO L78 Accepts]: Start accepts. Automaton has 55808 states and 174977 transitions. Word has length 47 [2021-06-05 08:10:49,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:10:49,180 INFO L482 AbstractCegarLoop]: Abstraction has 55808 states and 174977 transitions. [2021-06-05 08:10:49,180 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 3.3) internal successors, (66), 20 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:49,180 INFO L276 IsEmpty]: Start isEmpty. Operand 55808 states and 174977 transitions. [2021-06-05 08:10:49,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-06-05 08:10:49,185 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:10:49,185 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:10:49,390 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:10:49,391 INFO L430 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:10:49,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:10:49,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1485039834, now seen corresponding path program 1 times [2021-06-05 08:10:49,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:10:49,391 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9854069] [2021-06-05 08:10:49,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:10:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:10:49,428 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:10:49,429 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:10:49,429 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9854069] [2021-06-05 08:10:49,429 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9854069] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:10:49,429 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:10:49,429 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 08:10:49,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291093246] [2021-06-05 08:10:49,429 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 08:10:49,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:10:49,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 08:10:49,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 08:10:49,430 INFO L87 Difference]: Start difference. First operand 55808 states and 174977 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:50,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:10:50,090 INFO L93 Difference]: Finished difference Result 59348 states and 185236 transitions. [2021-06-05 08:10:50,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 08:10:50,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-06-05 08:10:50,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:10:50,208 INFO L225 Difference]: With dead ends: 59348 [2021-06-05 08:10:50,208 INFO L226 Difference]: Without dead ends: 59348 [2021-06-05 08:10:50,208 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 20.2ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 08:10:50,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59348 states. [2021-06-05 08:10:51,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59348 to 57772. [2021-06-05 08:10:51,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57772 states, 57763 states have (on average 3.128178938074546) internal successors, (180693), 57771 states have internal predecessors, (180693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:51,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57772 states to 57772 states and 180693 transitions. [2021-06-05 08:10:51,399 INFO L78 Accepts]: Start accepts. Automaton has 57772 states and 180693 transitions. Word has length 47 [2021-06-05 08:10:51,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:10:51,399 INFO L482 AbstractCegarLoop]: Abstraction has 57772 states and 180693 transitions. [2021-06-05 08:10:51,399 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:51,399 INFO L276 IsEmpty]: Start isEmpty. Operand 57772 states and 180693 transitions. [2021-06-05 08:10:51,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-06-05 08:10:51,407 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:10:51,408 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:10:51,408 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-05 08:10:51,408 INFO L430 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:10:51,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:10:51,409 INFO L82 PathProgramCache]: Analyzing trace with hash 2063241658, now seen corresponding path program 1 times [2021-06-05 08:10:51,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:10:51,409 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402022083] [2021-06-05 08:10:51,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:10:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:10:51,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:10:51,444 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:10:51,444 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402022083] [2021-06-05 08:10:51,445 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402022083] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:10:51,445 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:10:51,445 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 08:10:51,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908118692] [2021-06-05 08:10:51,445 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 08:10:51,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:10:51,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 08:10:51,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 08:10:51,446 INFO L87 Difference]: Start difference. First operand 57772 states and 180693 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:52,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:10:52,080 INFO L93 Difference]: Finished difference Result 71128 states and 218105 transitions. [2021-06-05 08:10:52,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 08:10:52,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-06-05 08:10:52,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:10:52,226 INFO L225 Difference]: With dead ends: 71128 [2021-06-05 08:10:52,226 INFO L226 Difference]: Without dead ends: 71128 [2021-06-05 08:10:52,226 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 08:10:52,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71128 states. [2021-06-05 08:10:53,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71128 to 65134. [2021-06-05 08:10:53,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65134 states, 65125 states have (on average 3.0875393474088293) internal successors, (201076), 65133 states have internal predecessors, (201076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:53,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65134 states to 65134 states and 201076 transitions. [2021-06-05 08:10:53,673 INFO L78 Accepts]: Start accepts. Automaton has 65134 states and 201076 transitions. Word has length 47 [2021-06-05 08:10:53,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:10:53,673 INFO L482 AbstractCegarLoop]: Abstraction has 65134 states and 201076 transitions. [2021-06-05 08:10:53,673 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:53,673 INFO L276 IsEmpty]: Start isEmpty. Operand 65134 states and 201076 transitions. [2021-06-05 08:10:53,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-05 08:10:53,680 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:10:53,680 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:10:53,680 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-05 08:10:53,680 INFO L430 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:10:53,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:10:53,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1657325607, now seen corresponding path program 1 times [2021-06-05 08:10:53,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:10:53,681 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784555777] [2021-06-05 08:10:53,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:10:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:10:53,802 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:10:53,802 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:10:53,802 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784555777] [2021-06-05 08:10:53,802 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784555777] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:10:53,803 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:10:53,803 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 08:10:53,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423479509] [2021-06-05 08:10:53,803 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 08:10:53,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:10:53,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 08:10:53,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-06-05 08:10:53,804 INFO L87 Difference]: Start difference. First operand 65134 states and 201076 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:54,507 WARN L205 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2021-06-05 08:10:55,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:10:55,465 INFO L93 Difference]: Finished difference Result 126798 states and 391649 transitions. [2021-06-05 08:10:55,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 08:10:55,466 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-06-05 08:10:55,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:10:55,729 INFO L225 Difference]: With dead ends: 126798 [2021-06-05 08:10:55,729 INFO L226 Difference]: Without dead ends: 126798 [2021-06-05 08:10:55,729 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 863.0ms TimeCoverageRelationStatistics Valid=433, Invalid=1373, Unknown=0, NotChecked=0, Total=1806 [2021-06-05 08:10:56,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126798 states. [2021-06-05 08:10:57,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126798 to 81648. [2021-06-05 08:10:57,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81648 states, 81639 states have (on average 3.140582319724641) internal successors, (256394), 81647 states have internal predecessors, (256394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:58,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81648 states to 81648 states and 256394 transitions. [2021-06-05 08:10:58,272 INFO L78 Accepts]: Start accepts. Automaton has 81648 states and 256394 transitions. Word has length 48 [2021-06-05 08:10:58,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:10:58,272 INFO L482 AbstractCegarLoop]: Abstraction has 81648 states and 256394 transitions. [2021-06-05 08:10:58,272 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:58,272 INFO L276 IsEmpty]: Start isEmpty. Operand 81648 states and 256394 transitions. [2021-06-05 08:10:58,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-05 08:10:58,281 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:10:58,281 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:10:58,281 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-05 08:10:58,281 INFO L430 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:10:58,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:10:58,282 INFO L82 PathProgramCache]: Analyzing trace with hash -819853811, now seen corresponding path program 2 times [2021-06-05 08:10:58,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:10:58,297 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190163740] [2021-06-05 08:10:58,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:10:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:10:58,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:10:58,452 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:10:58,452 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190163740] [2021-06-05 08:10:58,452 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190163740] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:10:58,453 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:10:58,453 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 08:10:58,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409673281] [2021-06-05 08:10:58,453 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 08:10:58,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:10:58,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 08:10:58,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-06-05 08:10:58,455 INFO L87 Difference]: Start difference. First operand 81648 states and 256394 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:10:59,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:10:59,893 INFO L93 Difference]: Finished difference Result 120406 states and 373064 transitions. [2021-06-05 08:10:59,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 08:10:59,894 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-06-05 08:10:59,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:11:00,528 INFO L225 Difference]: With dead ends: 120406 [2021-06-05 08:11:00,528 INFO L226 Difference]: Without dead ends: 120406 [2021-06-05 08:11:00,528 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 591.7ms TimeCoverageRelationStatistics Valid=376, Invalid=1430, Unknown=0, NotChecked=0, Total=1806 [2021-06-05 08:11:00,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120406 states. [2021-06-05 08:11:02,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120406 to 81450. [2021-06-05 08:11:02,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81450 states, 81441 states have (on average 3.142790486364362) internal successors, (255952), 81449 states have internal predecessors, (255952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:11:02,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81450 states to 81450 states and 255952 transitions. [2021-06-05 08:11:02,679 INFO L78 Accepts]: Start accepts. Automaton has 81450 states and 255952 transitions. Word has length 48 [2021-06-05 08:11:02,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:11:02,679 INFO L482 AbstractCegarLoop]: Abstraction has 81450 states and 255952 transitions. [2021-06-05 08:11:02,679 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:11:02,680 INFO L276 IsEmpty]: Start isEmpty. Operand 81450 states and 255952 transitions. [2021-06-05 08:11:02,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-05 08:11:02,687 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:11:02,687 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:11:02,687 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-05 08:11:02,688 INFO L430 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:11:02,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:11:02,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1230189022, now seen corresponding path program 1 times [2021-06-05 08:11:02,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:11:02,705 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761910483] [2021-06-05 08:11:02,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:11:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:11:02,837 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:11:02,837 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:11:02,837 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761910483] [2021-06-05 08:11:02,837 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761910483] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:11:02,837 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:11:02,837 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 08:11:02,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746776564] [2021-06-05 08:11:02,838 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 08:11:02,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:11:02,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 08:11:02,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-06-05 08:11:02,838 INFO L87 Difference]: Start difference. First operand 81450 states and 255952 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:11:04,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:11:04,055 INFO L93 Difference]: Finished difference Result 130328 states and 403081 transitions. [2021-06-05 08:11:04,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 08:11:04,056 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-06-05 08:11:04,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:11:04,739 INFO L225 Difference]: With dead ends: 130328 [2021-06-05 08:11:04,739 INFO L226 Difference]: Without dead ends: 130328 [2021-06-05 08:11:04,740 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 407.6ms TimeCoverageRelationStatistics Valid=331, Invalid=929, Unknown=0, NotChecked=0, Total=1260 [2021-06-05 08:11:05,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130328 states. [2021-06-05 08:11:06,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130328 to 84468. [2021-06-05 08:11:06,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84468 states, 84459 states have (on average 3.1466628778460555) internal successors, (265764), 84467 states have internal predecessors, (265764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:11:06,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84468 states to 84468 states and 265764 transitions. [2021-06-05 08:11:06,925 INFO L78 Accepts]: Start accepts. Automaton has 84468 states and 265764 transitions. Word has length 48 [2021-06-05 08:11:06,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:11:06,925 INFO L482 AbstractCegarLoop]: Abstraction has 84468 states and 265764 transitions. [2021-06-05 08:11:06,925 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:11:06,925 INFO L276 IsEmpty]: Start isEmpty. Operand 84468 states and 265764 transitions. [2021-06-05 08:11:06,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-05 08:11:06,933 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:11:06,933 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:11:06,933 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-05 08:11:06,933 INFO L430 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:11:06,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:11:06,933 INFO L82 PathProgramCache]: Analyzing trace with hash 555310756, now seen corresponding path program 2 times [2021-06-05 08:11:06,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:11:06,934 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39432369] [2021-06-05 08:11:06,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:11:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:11:07,035 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:11:07,036 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:11:07,036 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39432369] [2021-06-05 08:11:07,036 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39432369] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:11:07,036 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:11:07,036 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 08:11:07,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018391122] [2021-06-05 08:11:07,037 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 08:11:07,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:11:07,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 08:11:07,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-06-05 08:11:07,037 INFO L87 Difference]: Start difference. First operand 84468 states and 265764 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:11:08,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:11:08,764 INFO L93 Difference]: Finished difference Result 123476 states and 382724 transitions. [2021-06-05 08:11:08,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 08:11:08,765 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-06-05 08:11:08,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:11:09,027 INFO L225 Difference]: With dead ends: 123476 [2021-06-05 08:11:09,027 INFO L226 Difference]: Without dead ends: 123476 [2021-06-05 08:11:09,027 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 452.9ms TimeCoverageRelationStatistics Valid=291, Invalid=969, Unknown=0, NotChecked=0, Total=1260 [2021-06-05 08:11:09,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123476 states. [2021-06-05 08:11:11,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123476 to 84750. [2021-06-05 08:11:11,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84750 states, 84741 states have (on average 3.1525707744775255) internal successors, (267152), 84749 states have internal predecessors, (267152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:11:11,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84750 states to 84750 states and 267152 transitions. [2021-06-05 08:11:11,559 INFO L78 Accepts]: Start accepts. Automaton has 84750 states and 267152 transitions. Word has length 48 [2021-06-05 08:11:11,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:11:11,559 INFO L482 AbstractCegarLoop]: Abstraction has 84750 states and 267152 transitions. [2021-06-05 08:11:11,559 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:11:11,559 INFO L276 IsEmpty]: Start isEmpty. Operand 84750 states and 267152 transitions. [2021-06-05 08:11:11,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-05 08:11:11,568 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:11:11,568 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:11:11,568 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-05 08:11:11,568 INFO L430 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:11:11,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:11:11,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1269777472, now seen corresponding path program 3 times [2021-06-05 08:11:11,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:11:11,569 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920683522] [2021-06-05 08:11:11,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:11:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:11:11,684 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:11:11,684 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:11:11,685 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920683522] [2021-06-05 08:11:11,685 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920683522] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:11:11,685 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:11:11,685 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 08:11:11,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569396835] [2021-06-05 08:11:11,686 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 08:11:11,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:11:11,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 08:11:11,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-06-05 08:11:11,687 INFO L87 Difference]: Start difference. First operand 84750 states and 267152 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:11:12,883 WARN L205 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2021-06-05 08:11:13,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:11:13,561 INFO L93 Difference]: Finished difference Result 130598 states and 405054 transitions. [2021-06-05 08:11:13,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 08:11:13,562 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-06-05 08:11:13,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:11:13,849 INFO L225 Difference]: With dead ends: 130598 [2021-06-05 08:11:13,849 INFO L226 Difference]: Without dead ends: 130598 [2021-06-05 08:11:13,850 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 956.0ms TimeCoverageRelationStatistics Valid=336, Invalid=924, Unknown=0, NotChecked=0, Total=1260 [2021-06-05 08:11:14,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130598 states. [2021-06-05 08:11:16,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130598 to 90358. [2021-06-05 08:11:16,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90358 states, 90349 states have (on average 3.148258420126399) internal successors, (284442), 90357 states have internal predecessors, (284442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:11:16,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90358 states to 90358 states and 284442 transitions. [2021-06-05 08:11:16,424 INFO L78 Accepts]: Start accepts. Automaton has 90358 states and 284442 transitions. Word has length 48 [2021-06-05 08:11:16,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:11:16,424 INFO L482 AbstractCegarLoop]: Abstraction has 90358 states and 284442 transitions. [2021-06-05 08:11:16,425 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:11:16,425 INFO L276 IsEmpty]: Start isEmpty. Operand 90358 states and 284442 transitions. [2021-06-05 08:11:16,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-05 08:11:16,432 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:11:16,433 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:11:16,433 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-05 08:11:16,433 INFO L430 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:11:16,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:11:16,433 INFO L82 PathProgramCache]: Analyzing trace with hash 157733954, now seen corresponding path program 4 times [2021-06-05 08:11:16,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:11:16,433 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071843581] [2021-06-05 08:11:16,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:11:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:11:16,530 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:11:16,530 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:11:16,530 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071843581] [2021-06-05 08:11:16,530 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071843581] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:11:16,531 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:11:16,531 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 08:11:16,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296691615] [2021-06-05 08:11:16,531 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 08:11:16,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:11:16,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 08:11:16,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-06-05 08:11:16,532 INFO L87 Difference]: Start difference. First operand 90358 states and 284442 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:11:18,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:11:18,435 INFO L93 Difference]: Finished difference Result 143776 states and 449452 transitions. [2021-06-05 08:11:18,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-05 08:11:18,436 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-06-05 08:11:18,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:11:18,790 INFO L225 Difference]: With dead ends: 143776 [2021-06-05 08:11:18,791 INFO L226 Difference]: Without dead ends: 143776 [2021-06-05 08:11:18,791 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 494.8ms TimeCoverageRelationStatistics Valid=283, Invalid=839, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 08:11:19,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143776 states. [2021-06-05 08:11:21,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143776 to 95760. [2021-06-05 08:11:21,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95760 states, 95751 states have (on average 3.163455211956011) internal successors, (302904), 95759 states have internal predecessors, (302904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:11:21,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95760 states to 95760 states and 302904 transitions. [2021-06-05 08:11:21,592 INFO L78 Accepts]: Start accepts. Automaton has 95760 states and 302904 transitions. Word has length 48 [2021-06-05 08:11:21,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:11:21,592 INFO L482 AbstractCegarLoop]: Abstraction has 95760 states and 302904 transitions. [2021-06-05 08:11:21,593 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:11:21,593 INFO L276 IsEmpty]: Start isEmpty. Operand 95760 states and 302904 transitions. [2021-06-05 08:11:21,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-05 08:11:21,600 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:11:21,601 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:11:21,601 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-05 08:11:21,601 INFO L430 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:11:21,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:11:21,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1574475036, now seen corresponding path program 5 times [2021-06-05 08:11:21,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:11:21,601 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503596121] [2021-06-05 08:11:21,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:11:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:11:21,703 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:11:21,704 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:11:21,704 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503596121] [2021-06-05 08:11:21,704 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503596121] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:11:21,704 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:11:21,704 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 08:11:21,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750143917] [2021-06-05 08:11:21,704 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 08:11:21,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:11:21,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 08:11:21,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-06-05 08:11:21,705 INFO L87 Difference]: Start difference. First operand 95760 states and 302904 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:11:23,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:11:23,506 INFO L93 Difference]: Finished difference Result 139200 states and 435128 transitions. [2021-06-05 08:11:23,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-05 08:11:23,506 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-06-05 08:11:23,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:11:23,830 INFO L225 Difference]: With dead ends: 139200 [2021-06-05 08:11:23,830 INFO L226 Difference]: Without dead ends: 139200 [2021-06-05 08:11:23,831 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 401.8ms TimeCoverageRelationStatistics Valid=215, Invalid=715, Unknown=0, NotChecked=0, Total=930 [2021-06-05 08:11:24,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139200 states. [2021-06-05 08:11:26,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139200 to 95394. [2021-06-05 08:11:26,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95394 states, 95385 states have (on average 3.1629816008806415) internal successors, (301701), 95393 states have internal predecessors, (301701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:11:26,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95394 states to 95394 states and 301701 transitions. [2021-06-05 08:11:26,651 INFO L78 Accepts]: Start accepts. Automaton has 95394 states and 301701 transitions. Word has length 48 [2021-06-05 08:11:26,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:11:26,651 INFO L482 AbstractCegarLoop]: Abstraction has 95394 states and 301701 transitions. [2021-06-05 08:11:26,651 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:11:26,652 INFO L276 IsEmpty]: Start isEmpty. Operand 95394 states and 301701 transitions. [2021-06-05 08:11:26,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-05 08:11:26,661 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:11:26,661 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:11:26,661 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-05 08:11:26,661 INFO L430 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:11:26,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:11:26,662 INFO L82 PathProgramCache]: Analyzing trace with hash -398775876, now seen corresponding path program 6 times [2021-06-05 08:11:26,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:11:26,662 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234603194] [2021-06-05 08:11:26,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:11:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:11:26,759 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:11:26,759 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:11:26,760 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234603194] [2021-06-05 08:11:26,760 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234603194] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:11:26,760 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:11:26,760 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 08:11:26,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224215175] [2021-06-05 08:11:26,760 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 08:11:26,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:11:26,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 08:11:26,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-06-05 08:11:26,761 INFO L87 Difference]: Start difference. First operand 95394 states and 301701 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:11:28,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:11:28,726 INFO L93 Difference]: Finished difference Result 171148 states and 537825 transitions. [2021-06-05 08:11:28,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 08:11:28,726 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-06-05 08:11:28,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:11:29,139 INFO L225 Difference]: With dead ends: 171148 [2021-06-05 08:11:29,139 INFO L226 Difference]: Without dead ends: 171148 [2021-06-05 08:11:29,139 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 492.0ms TimeCoverageRelationStatistics Valid=318, Invalid=872, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 08:11:29,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171148 states. [2021-06-05 08:11:31,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171148 to 106836. [2021-06-05 08:11:32,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106836 states, 106827 states have (on average 3.1992754640680725) internal successors, (341769), 106835 states have internal predecessors, (341769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:11:32,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106836 states to 106836 states and 341769 transitions. [2021-06-05 08:11:32,340 INFO L78 Accepts]: Start accepts. Automaton has 106836 states and 341769 transitions. Word has length 48 [2021-06-05 08:11:32,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:11:32,340 INFO L482 AbstractCegarLoop]: Abstraction has 106836 states and 341769 transitions. [2021-06-05 08:11:32,340 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:11:32,340 INFO L276 IsEmpty]: Start isEmpty. Operand 106836 states and 341769 transitions. [2021-06-05 08:11:32,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-05 08:11:32,349 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:11:32,349 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:11:32,349 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-05 08:11:32,350 INFO L430 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:11:32,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:11:32,350 INFO L82 PathProgramCache]: Analyzing trace with hash -2130984866, now seen corresponding path program 7 times [2021-06-05 08:11:32,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:11:32,350 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052727219] [2021-06-05 08:11:32,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:11:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:11:32,444 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:11:32,444 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:11:32,444 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052727219] [2021-06-05 08:11:32,444 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052727219] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:11:32,444 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:11:32,444 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 08:11:32,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266457384] [2021-06-05 08:11:32,445 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 08:11:32,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:11:32,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 08:11:32,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-06-05 08:11:32,445 INFO L87 Difference]: Start difference. First operand 106836 states and 341769 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:11:34,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:11:34,441 INFO L93 Difference]: Finished difference Result 163028 states and 513235 transitions. [2021-06-05 08:11:34,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 08:11:34,441 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-06-05 08:11:34,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:11:34,781 INFO L225 Difference]: With dead ends: 163028 [2021-06-05 08:11:34,782 INFO L226 Difference]: Without dead ends: 163028 [2021-06-05 08:11:34,782 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 480.8ms TimeCoverageRelationStatistics Valid=281, Invalid=909, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 08:11:35,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163028 states. [2021-06-05 08:11:37,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163028 to 105962. [2021-06-05 08:11:37,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105962 states, 105953 states have (on average 3.1953130161486696) internal successors, (338553), 105961 states have internal predecessors, (338553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:11:37,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105962 states to 105962 states and 338553 transitions. [2021-06-05 08:11:37,881 INFO L78 Accepts]: Start accepts. Automaton has 105962 states and 338553 transitions. Word has length 48 [2021-06-05 08:11:37,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:11:37,882 INFO L482 AbstractCegarLoop]: Abstraction has 105962 states and 338553 transitions. [2021-06-05 08:11:37,882 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:11:37,882 INFO L276 IsEmpty]: Start isEmpty. Operand 105962 states and 338553 transitions. [2021-06-05 08:11:37,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-05 08:11:37,891 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:11:37,891 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:11:37,891 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-05 08:11:37,891 INFO L430 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:11:37,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:11:37,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1494742405, now seen corresponding path program 3 times [2021-06-05 08:11:37,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:11:37,892 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740859263] [2021-06-05 08:11:37,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:11:37,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:11:38,463 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:11:38,464 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:11:38,464 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740859263] [2021-06-05 08:11:38,464 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740859263] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:11:38,465 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:11:38,465 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 08:11:38,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301010146] [2021-06-05 08:11:38,465 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 08:11:38,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:11:38,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 08:11:38,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-06-05 08:11:38,466 INFO L87 Difference]: Start difference. First operand 105962 states and 338553 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:11:40,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:11:40,053 INFO L93 Difference]: Finished difference Result 144958 states and 457232 transitions. [2021-06-05 08:11:40,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 08:11:40,054 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-06-05 08:11:40,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:11:40,341 INFO L225 Difference]: With dead ends: 144958 [2021-06-05 08:11:40,342 INFO L226 Difference]: Without dead ends: 144958 [2021-06-05 08:11:40,342 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 1011.7ms TimeCoverageRelationStatistics Valid=336, Invalid=924, Unknown=0, NotChecked=0, Total=1260 [2021-06-05 08:11:41,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144958 states. [2021-06-05 08:11:42,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144958 to 109860. [2021-06-05 08:11:42,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109860 states, 109851 states have (on average 3.1947274034828994) internal successors, (350944), 109859 states have internal predecessors, (350944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:11:43,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109860 states to 109860 states and 350944 transitions. [2021-06-05 08:11:43,109 INFO L78 Accepts]: Start accepts. Automaton has 109860 states and 350944 transitions. Word has length 48 [2021-06-05 08:11:43,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:11:43,109 INFO L482 AbstractCegarLoop]: Abstraction has 109860 states and 350944 transitions. [2021-06-05 08:11:43,109 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:11:43,109 INFO L276 IsEmpty]: Start isEmpty. Operand 109860 states and 350944 transitions. [2021-06-05 08:11:43,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-05 08:11:43,118 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:11:43,118 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:11:43,118 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-05 08:11:43,118 INFO L430 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:11:43,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:11:43,119 INFO L82 PathProgramCache]: Analyzing trace with hash 316197483, now seen corresponding path program 4 times [2021-06-05 08:11:43,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:11:43,119 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837733736] [2021-06-05 08:11:43,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:11:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:11:43,731 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:11:43,731 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:11:43,731 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837733736] [2021-06-05 08:11:43,731 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837733736] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:11:43,731 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:11:43,731 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 08:11:43,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855703377] [2021-06-05 08:11:43,732 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 08:11:43,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:11:43,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 08:11:43,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-06-05 08:11:43,732 INFO L87 Difference]: Start difference. First operand 109860 states and 350944 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:11:45,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:11:45,192 INFO L93 Difference]: Finished difference Result 157988 states and 499978 transitions. [2021-06-05 08:11:45,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-05 08:11:45,192 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-06-05 08:11:45,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:11:45,515 INFO L225 Difference]: With dead ends: 157988 [2021-06-05 08:11:45,515 INFO L226 Difference]: Without dead ends: 157988 [2021-06-05 08:11:45,516 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 546.3ms TimeCoverageRelationStatistics Valid=283, Invalid=839, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 08:11:46,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157988 states. [2021-06-05 08:11:48,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157988 to 115664. [2021-06-05 08:11:48,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115664 states, 115655 states have (on average 3.2065799144005878) internal successors, (370857), 115663 states have internal predecessors, (370857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:11:49,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115664 states to 115664 states and 370857 transitions. [2021-06-05 08:11:49,347 INFO L78 Accepts]: Start accepts. Automaton has 115664 states and 370857 transitions. Word has length 48 [2021-06-05 08:11:49,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:11:49,347 INFO L482 AbstractCegarLoop]: Abstraction has 115664 states and 370857 transitions. [2021-06-05 08:11:49,347 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:11:49,347 INFO L276 IsEmpty]: Start isEmpty. Operand 115664 states and 370857 transitions. [2021-06-05 08:11:49,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-05 08:11:49,356 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:11:49,356 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:11:49,356 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-05 08:11:49,357 INFO L430 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:11:49,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:11:49,357 INFO L82 PathProgramCache]: Analyzing trace with hash 295191275, now seen corresponding path program 5 times [2021-06-05 08:11:49,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:11:49,357 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407040967] [2021-06-05 08:11:49,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:11:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:11:49,451 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:11:49,451 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:11:49,451 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407040967] [2021-06-05 08:11:49,451 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407040967] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:11:49,451 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:11:49,451 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 08:11:49,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196908069] [2021-06-05 08:11:49,452 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 08:11:49,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:11:49,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 08:11:49,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-06-05 08:11:49,452 INFO L87 Difference]: Start difference. First operand 115664 states and 370857 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:11:50,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:11:50,759 INFO L93 Difference]: Finished difference Result 150956 states and 478588 transitions. [2021-06-05 08:11:50,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-05 08:11:50,759 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-06-05 08:11:50,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:11:52,117 INFO L225 Difference]: With dead ends: 150956 [2021-06-05 08:11:52,118 INFO L226 Difference]: Without dead ends: 150956 [2021-06-05 08:11:52,119 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 369.5ms TimeCoverageRelationStatistics Valid=215, Invalid=715, Unknown=0, NotChecked=0, Total=930 [2021-06-05 08:11:52,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150956 states. [2021-06-05 08:11:54,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150956 to 115136. [2021-06-05 08:11:54,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115136 states, 115127 states have (on average 3.2050083820476516) internal successors, (368983), 115135 states have internal predecessors, (368983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:11:55,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115136 states to 115136 states and 368983 transitions. [2021-06-05 08:11:55,595 INFO L78 Accepts]: Start accepts. Automaton has 115136 states and 368983 transitions. Word has length 48 [2021-06-05 08:11:55,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:11:55,595 INFO L482 AbstractCegarLoop]: Abstraction has 115136 states and 368983 transitions. [2021-06-05 08:11:55,595 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:11:55,595 INFO L276 IsEmpty]: Start isEmpty. Operand 115136 states and 368983 transitions. [2021-06-05 08:11:55,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-05 08:11:55,604 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:11:55,604 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:11:55,604 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-06-05 08:11:55,604 INFO L430 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:11:55,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:11:55,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1650663423, now seen corresponding path program 6 times [2021-06-05 08:11:55,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:11:55,605 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7867658] [2021-06-05 08:11:55,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:11:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:11:55,699 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:11:55,700 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:11:55,700 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7867658] [2021-06-05 08:11:55,700 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7867658] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:11:55,700 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:11:55,700 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 08:11:55,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971769351] [2021-06-05 08:11:55,700 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 08:11:55,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:11:55,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 08:11:55,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-06-05 08:11:55,701 INFO L87 Difference]: Start difference. First operand 115136 states and 368983 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:11:57,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:11:57,725 INFO L93 Difference]: Finished difference Result 179018 states and 568260 transitions. [2021-06-05 08:11:57,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 08:11:57,726 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-06-05 08:11:57,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:11:58,144 INFO L225 Difference]: With dead ends: 179018 [2021-06-05 08:11:58,144 INFO L226 Difference]: Without dead ends: 179018 [2021-06-05 08:11:58,144 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 474.1ms TimeCoverageRelationStatistics Valid=318, Invalid=872, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 08:11:58,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179018 states. [2021-06-05 08:12:00,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179018 to 125980. [2021-06-05 08:12:00,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125980 states, 125971 states have (on average 3.2293623135483562) internal successors, (406806), 125979 states have internal predecessors, (406806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:12:01,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125980 states to 125980 states and 406806 transitions. [2021-06-05 08:12:01,278 INFO L78 Accepts]: Start accepts. Automaton has 125980 states and 406806 transitions. Word has length 48 [2021-06-05 08:12:01,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:12:01,278 INFO L482 AbstractCegarLoop]: Abstraction has 125980 states and 406806 transitions. [2021-06-05 08:12:01,278 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:12:01,278 INFO L276 IsEmpty]: Start isEmpty. Operand 125980 states and 406806 transitions. [2021-06-05 08:12:01,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-05 08:12:01,287 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:12:01,287 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:12:01,287 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-05 08:12:01,287 INFO L430 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:12:01,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:12:01,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1671669631, now seen corresponding path program 7 times [2021-06-05 08:12:01,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:12:01,288 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356909095] [2021-06-05 08:12:01,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:12:01,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:12:01,381 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:12:01,382 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:12:01,382 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356909095] [2021-06-05 08:12:01,382 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356909095] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:12:01,382 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:12:01,382 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 08:12:01,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866082846] [2021-06-05 08:12:01,382 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 08:12:01,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:12:01,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 08:12:01,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-06-05 08:12:01,383 INFO L87 Difference]: Start difference. First operand 125980 states and 406806 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:12:03,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:12:03,377 INFO L93 Difference]: Finished difference Result 169168 states and 538886 transitions. [2021-06-05 08:12:03,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 08:12:03,378 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-06-05 08:12:03,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:12:03,751 INFO L225 Difference]: With dead ends: 169168 [2021-06-05 08:12:03,752 INFO L226 Difference]: Without dead ends: 169168 [2021-06-05 08:12:03,752 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 469.9ms TimeCoverageRelationStatistics Valid=281, Invalid=909, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 08:12:04,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169168 states. [2021-06-05 08:12:06,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169168 to 125860. [2021-06-05 08:12:06,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125860 states, 125851 states have (on average 3.2308841407696405) internal successors, (406610), 125859 states have internal predecessors, (406610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:12:07,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125860 states to 125860 states and 406610 transitions. [2021-06-05 08:12:07,687 INFO L78 Accepts]: Start accepts. Automaton has 125860 states and 406610 transitions. Word has length 48 [2021-06-05 08:12:07,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:12:07,687 INFO L482 AbstractCegarLoop]: Abstraction has 125860 states and 406610 transitions. [2021-06-05 08:12:07,688 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:12:07,688 INFO L276 IsEmpty]: Start isEmpty. Operand 125860 states and 406610 transitions. [2021-06-05 08:12:07,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-05 08:12:07,709 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:12:07,709 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:12:07,709 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-06-05 08:12:07,710 INFO L430 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:12:07,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:12:07,711 INFO L82 PathProgramCache]: Analyzing trace with hash 956186479, now seen corresponding path program 8 times [2021-06-05 08:12:07,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:12:07,711 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679849517] [2021-06-05 08:12:07,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:12:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:12:07,822 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:12:07,823 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:12:07,823 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679849517] [2021-06-05 08:12:07,823 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679849517] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:12:07,823 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:12:07,823 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 08:12:07,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924418601] [2021-06-05 08:12:07,823 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 08:12:07,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:12:07,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 08:12:07,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-06-05 08:12:07,824 INFO L87 Difference]: Start difference. First operand 125860 states and 406610 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:12:09,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:12:09,855 INFO L93 Difference]: Finished difference Result 187598 states and 597914 transitions. [2021-06-05 08:12:09,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 08:12:09,855 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-06-05 08:12:09,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:12:10,305 INFO L225 Difference]: With dead ends: 187598 [2021-06-05 08:12:10,305 INFO L226 Difference]: Without dead ends: 187598 [2021-06-05 08:12:10,305 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 392.2ms TimeCoverageRelationStatistics Valid=331, Invalid=929, Unknown=0, NotChecked=0, Total=1260 [2021-06-05 08:12:10,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187598 states. [2021-06-05 08:12:13,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187598 to 136958. [2021-06-05 08:12:13,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136958 states, 136949 states have (on average 3.2469605473570455) internal successors, (444668), 136957 states have internal predecessors, (444668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:12:13,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136958 states to 136958 states and 444668 transitions. [2021-06-05 08:12:13,760 INFO L78 Accepts]: Start accepts. Automaton has 136958 states and 444668 transitions. Word has length 48 [2021-06-05 08:12:13,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:12:13,760 INFO L482 AbstractCegarLoop]: Abstraction has 136958 states and 444668 transitions. [2021-06-05 08:12:13,760 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:12:13,760 INFO L276 IsEmpty]: Start isEmpty. Operand 136958 states and 444668 transitions. [2021-06-05 08:12:13,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-05 08:12:13,770 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:12:13,770 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:12:13,770 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-06-05 08:12:13,771 INFO L430 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:12:13,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:12:13,771 INFO L82 PathProgramCache]: Analyzing trace with hash 935180271, now seen corresponding path program 9 times [2021-06-05 08:12:13,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:12:13,771 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767013544] [2021-06-05 08:12:13,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:12:13,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:12:13,862 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:12:13,863 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:12:13,863 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767013544] [2021-06-05 08:12:13,863 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767013544] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:12:13,863 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:12:13,863 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 08:12:13,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224168755] [2021-06-05 08:12:13,863 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 08:12:13,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:12:13,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 08:12:13,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-06-05 08:12:13,864 INFO L87 Difference]: Start difference. First operand 136958 states and 444668 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:12:16,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:12:16,032 INFO L93 Difference]: Finished difference Result 177772 states and 568716 transitions. [2021-06-05 08:12:16,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 08:12:16,032 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-06-05 08:12:16,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:12:16,441 INFO L225 Difference]: With dead ends: 177772 [2021-06-05 08:12:16,441 INFO L226 Difference]: Without dead ends: 177772 [2021-06-05 08:12:16,441 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 507.1ms TimeCoverageRelationStatistics Valid=291, Invalid=969, Unknown=0, NotChecked=0, Total=1260 [2021-06-05 08:12:17,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177772 states. [2021-06-05 08:12:20,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177772 to 136976. [2021-06-05 08:12:20,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136976 states, 136967 states have (on average 3.249045390495521) internal successors, (445012), 136975 states have internal predecessors, (445012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:12:20,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136976 states to 136976 states and 445012 transitions. [2021-06-05 08:12:20,820 INFO L78 Accepts]: Start accepts. Automaton has 136976 states and 445012 transitions. Word has length 48 [2021-06-05 08:12:20,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:12:20,820 INFO L482 AbstractCegarLoop]: Abstraction has 136976 states and 445012 transitions. [2021-06-05 08:12:20,820 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:12:20,820 INFO L276 IsEmpty]: Start isEmpty. Operand 136976 states and 445012 transitions. [2021-06-05 08:12:20,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-05 08:12:20,829 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:12:20,829 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:12:20,829 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-06-05 08:12:20,830 INFO L430 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:12:20,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:12:20,830 INFO L82 PathProgramCache]: Analyzing trace with hash 837612156, now seen corresponding path program 8 times [2021-06-05 08:12:20,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:12:20,830 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999816856] [2021-06-05 08:12:20,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:12:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:12:20,912 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:12:20,912 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:12:20,912 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999816856] [2021-06-05 08:12:20,912 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999816856] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:12:20,912 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:12:20,912 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 08:12:20,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458941072] [2021-06-05 08:12:20,913 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 08:12:20,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:12:20,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 08:12:20,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-06-05 08:12:20,913 INFO L87 Difference]: Start difference. First operand 136976 states and 445012 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:12:22,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:12:22,972 INFO L93 Difference]: Finished difference Result 180548 states and 576652 transitions. [2021-06-05 08:12:22,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 08:12:22,972 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-06-05 08:12:22,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:12:23,390 INFO L225 Difference]: With dead ends: 180548 [2021-06-05 08:12:23,390 INFO L226 Difference]: Without dead ends: 180548 [2021-06-05 08:12:23,391 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 548.3ms TimeCoverageRelationStatistics Valid=433, Invalid=1373, Unknown=0, NotChecked=0, Total=1806 [2021-06-05 08:12:23,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180548 states. [2021-06-05 08:12:26,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180548 to 138692. [2021-06-05 08:12:26,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138692 states, 138683 states have (on average 3.2489346206816987) internal successors, (450572), 138691 states have internal predecessors, (450572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:12:27,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138692 states to 138692 states and 450572 transitions. [2021-06-05 08:12:27,510 INFO L78 Accepts]: Start accepts. Automaton has 138692 states and 450572 transitions. Word has length 48 [2021-06-05 08:12:27,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:12:27,510 INFO L482 AbstractCegarLoop]: Abstraction has 138692 states and 450572 transitions. [2021-06-05 08:12:27,510 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:12:27,510 INFO L276 IsEmpty]: Start isEmpty. Operand 138692 states and 450572 transitions. [2021-06-05 08:12:27,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-05 08:12:27,540 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:12:27,540 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:12:27,540 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-06-05 08:12:27,540 INFO L430 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:12:27,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:12:27,540 INFO L82 PathProgramCache]: Analyzing trace with hash 162733890, now seen corresponding path program 9 times [2021-06-05 08:12:27,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:12:27,541 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953755683] [2021-06-05 08:12:27,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:12:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:12:27,632 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:12:27,633 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:12:27,633 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953755683] [2021-06-05 08:12:27,633 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953755683] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:12:27,633 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:12:27,633 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 08:12:27,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537434127] [2021-06-05 08:12:27,633 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 08:12:27,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:12:27,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 08:12:27,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-06-05 08:12:27,634 INFO L87 Difference]: Start difference. First operand 138692 states and 450572 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:12:29,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:12:29,861 INFO L93 Difference]: Finished difference Result 177804 states and 568200 transitions. [2021-06-05 08:12:29,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 08:12:29,861 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-06-05 08:12:29,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:12:30,279 INFO L225 Difference]: With dead ends: 177804 [2021-06-05 08:12:30,280 INFO L226 Difference]: Without dead ends: 177804 [2021-06-05 08:12:30,280 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 556.0ms TimeCoverageRelationStatistics Valid=376, Invalid=1430, Unknown=0, NotChecked=0, Total=1806 [2021-06-05 08:12:30,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177804 states. [2021-06-05 08:12:33,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177804 to 137972. [2021-06-05 08:12:33,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137972 states, 137963 states have (on average 3.2511760399527407) internal successors, (448542), 137971 states have internal predecessors, (448542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:12:33,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137972 states to 137972 states and 448542 transitions. [2021-06-05 08:12:33,658 INFO L78 Accepts]: Start accepts. Automaton has 137972 states and 448542 transitions. Word has length 48 [2021-06-05 08:12:33,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:12:33,658 INFO L482 AbstractCegarLoop]: Abstraction has 137972 states and 448542 transitions. [2021-06-05 08:12:33,658 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:12:33,658 INFO L276 IsEmpty]: Start isEmpty. Operand 137972 states and 448542 transitions. [2021-06-05 08:12:33,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-05 08:12:33,667 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:12:33,667 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:12:33,668 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-06-05 08:12:33,668 INFO L430 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:12:33,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:12:33,668 INFO L82 PathProgramCache]: Analyzing trace with hash -107102459, now seen corresponding path program 10 times [2021-06-05 08:12:33,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:12:33,668 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835481886] [2021-06-05 08:12:33,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:12:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:12:33,842 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:12:33,842 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:12:33,842 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835481886] [2021-06-05 08:12:33,842 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835481886] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:12:33,843 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973019411] [2021-06-05 08:12:33,843 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:12:33,905 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 08:12:33,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:12:33,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 32 conjunts are in the unsatisfiable core [2021-06-05 08:12:33,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:12:33,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:12:33,924 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:12:33,927 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:12:33,927 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:12:33,927 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:12:33,951 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-06-05 08:12:33,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-06-05 08:12:33,957 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:12:33,962 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:12:33,963 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:12:33,963 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2021-06-05 08:12:34,026 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 08:12:34,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 08:12:34,028 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:12:34,035 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:12:34,036 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:12:34,036 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:27 [2021-06-05 08:12:34,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2021-06-05 08:12:34,140 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:12:34,151 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:12:34,152 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:12:34,152 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:35 [2021-06-05 08:12:34,743 WARN L205 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 8 [2021-06-05 08:12:34,744 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:12:34,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 08:12:34,747 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:12:34,755 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:12:34,756 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:12:34,756 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:24 [2021-06-05 08:12:34,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2021-06-05 08:12:34,855 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:12:34,865 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:12:34,866 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:12:34,867 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:59, output treesize:23 [2021-06-05 08:12:34,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2021-06-05 08:12:34,977 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:12:34,981 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:12:34,983 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:12:34,983 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:8 [2021-06-05 08:12:35,003 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:12:35,003 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973019411] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:12:35,003 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:12:35,003 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2021-06-05 08:12:35,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330856661] [2021-06-05 08:12:35,004 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 08:12:35,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:12:35,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 08:12:35,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2021-06-05 08:12:35,005 INFO L87 Difference]: Start difference. First operand 137972 states and 448542 transitions. Second operand has 23 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:12:37,963 WARN L205 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2021-06-05 08:12:40,771 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2021-06-05 08:12:41,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:12:41,908 INFO L93 Difference]: Finished difference Result 233048 states and 729833 transitions. [2021-06-05 08:12:41,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2021-06-05 08:12:41,908 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-06-05 08:12:41,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:12:42,431 INFO L225 Difference]: With dead ends: 233048 [2021-06-05 08:12:42,431 INFO L226 Difference]: Without dead ends: 233048 [2021-06-05 08:12:42,434 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6555 ImplicationChecksByTransitivity, 4527.6ms TimeCoverageRelationStatistics Valid=2405, Invalid=14625, Unknown=0, NotChecked=0, Total=17030 [2021-06-05 08:12:43,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233048 states. [2021-06-05 08:12:46,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233048 to 145872. [2021-06-05 08:12:46,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145872 states, 145863 states have (on average 3.2181087733009743) internal successors, (469403), 145871 states have internal predecessors, (469403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:12:46,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145872 states to 145872 states and 469403 transitions. [2021-06-05 08:12:46,635 INFO L78 Accepts]: Start accepts. Automaton has 145872 states and 469403 transitions. Word has length 48 [2021-06-05 08:12:46,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:12:46,635 INFO L482 AbstractCegarLoop]: Abstraction has 145872 states and 469403 transitions. [2021-06-05 08:12:46,635 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:12:46,635 INFO L276 IsEmpty]: Start isEmpty. Operand 145872 states and 469403 transitions. [2021-06-05 08:12:46,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-06-05 08:12:46,651 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:12:46,652 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:12:46,852 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-06-05 08:12:46,854 INFO L430 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:12:46,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:12:46,855 INFO L82 PathProgramCache]: Analyzing trace with hash 2001966810, now seen corresponding path program 1 times [2021-06-05 08:12:46,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:12:46,855 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044498191] [2021-06-05 08:12:46,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:12:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:12:46,991 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:12:46,991 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:12:46,991 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044498191] [2021-06-05 08:12:46,991 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044498191] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:12:46,991 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:12:46,991 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 08:12:46,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215902795] [2021-06-05 08:12:46,992 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 08:12:46,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:12:46,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 08:12:46,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-06-05 08:12:46,992 INFO L87 Difference]: Start difference. First operand 145872 states and 469403 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:12:49,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:12:49,633 INFO L93 Difference]: Finished difference Result 194254 states and 611422 transitions. [2021-06-05 08:12:49,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-06-05 08:12:49,634 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-06-05 08:12:49,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:12:50,746 INFO L225 Difference]: With dead ends: 194254 [2021-06-05 08:12:50,747 INFO L226 Difference]: Without dead ends: 194254 [2021-06-05 08:12:50,747 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 1415.4ms TimeCoverageRelationStatistics Valid=721, Invalid=2819, Unknown=0, NotChecked=0, Total=3540 [2021-06-05 08:12:51,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194254 states. [2021-06-05 08:12:53,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194254 to 160382. [2021-06-05 08:12:53,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160382 states, 160373 states have (on average 3.1899509269016604) internal successors, (511582), 160381 states have internal predecessors, (511582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:12:55,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160382 states to 160382 states and 511582 transitions. [2021-06-05 08:12:55,116 INFO L78 Accepts]: Start accepts. Automaton has 160382 states and 511582 transitions. Word has length 53 [2021-06-05 08:12:55,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:12:55,116 INFO L482 AbstractCegarLoop]: Abstraction has 160382 states and 511582 transitions. [2021-06-05 08:12:55,116 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:12:55,116 INFO L276 IsEmpty]: Start isEmpty. Operand 160382 states and 511582 transitions. [2021-06-05 08:12:55,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-06-05 08:12:55,138 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:12:55,138 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:12:55,138 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-06-05 08:12:55,138 INFO L430 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:12:55,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:12:55,139 INFO L82 PathProgramCache]: Analyzing trace with hash -305816792, now seen corresponding path program 1 times [2021-06-05 08:12:55,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:12:55,139 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381135596] [2021-06-05 08:12:55,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:12:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:12:55,346 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:12:55,346 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:12:55,347 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381135596] [2021-06-05 08:12:55,347 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381135596] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:12:55,347 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:12:55,347 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 08:12:55,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750952595] [2021-06-05 08:12:55,347 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 08:12:55,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:12:55,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 08:12:55,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-06-05 08:12:55,348 INFO L87 Difference]: Start difference. First operand 160382 states and 511582 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:12:57,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:12:57,737 INFO L93 Difference]: Finished difference Result 202162 states and 633888 transitions. [2021-06-05 08:12:57,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-06-05 08:12:57,737 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-06-05 08:12:57,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:12:58,212 INFO L225 Difference]: With dead ends: 202162 [2021-06-05 08:12:58,213 INFO L226 Difference]: Without dead ends: 202162 [2021-06-05 08:12:58,213 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 558.5ms TimeCoverageRelationStatistics Valid=563, Invalid=1789, Unknown=0, NotChecked=0, Total=2352 [2021-06-05 08:12:58,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202162 states. [2021-06-05 08:13:01,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202162 to 165812. [2021-06-05 08:13:02,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165812 states, 165803 states have (on average 3.1869507789364486) internal successors, (528406), 165811 states have internal predecessors, (528406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:13:03,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165812 states to 165812 states and 528406 transitions. [2021-06-05 08:13:03,412 INFO L78 Accepts]: Start accepts. Automaton has 165812 states and 528406 transitions. Word has length 53 [2021-06-05 08:13:03,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:13:03,412 INFO L482 AbstractCegarLoop]: Abstraction has 165812 states and 528406 transitions. [2021-06-05 08:13:03,412 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:13:03,412 INFO L276 IsEmpty]: Start isEmpty. Operand 165812 states and 528406 transitions. [2021-06-05 08:13:03,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-06-05 08:13:03,435 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:13:03,436 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:13:03,436 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-06-05 08:13:03,436 INFO L430 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:13:03,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:13:03,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1667216902, now seen corresponding path program 2 times [2021-06-05 08:13:03,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:13:03,437 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106279262] [2021-06-05 08:13:03,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:13:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:13:03,654 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:13:03,654 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:13:03,654 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106279262] [2021-06-05 08:13:03,655 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106279262] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:13:03,655 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:13:03,655 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 08:13:03,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564689490] [2021-06-05 08:13:03,655 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 08:13:03,655 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:13:03,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 08:13:03,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-06-05 08:13:03,656 INFO L87 Difference]: Start difference. First operand 165812 states and 528406 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:13:06,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:13:06,701 INFO L93 Difference]: Finished difference Result 251980 states and 784965 transitions. [2021-06-05 08:13:06,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-06-05 08:13:06,701 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-06-05 08:13:06,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:13:07,367 INFO L225 Difference]: With dead ends: 251980 [2021-06-05 08:13:07,367 INFO L226 Difference]: Without dead ends: 251980 [2021-06-05 08:13:07,367 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 686.3ms TimeCoverageRelationStatistics Valid=460, Invalid=1432, Unknown=0, NotChecked=0, Total=1892 [2021-06-05 08:13:07,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251980 states. [2021-06-05 08:13:11,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251980 to 170564. [2021-06-05 08:13:11,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170564 states, 170555 states have (on average 3.184544575063762) internal successors, (543140), 170563 states have internal predecessors, (543140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:13:12,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170564 states to 170564 states and 543140 transitions. [2021-06-05 08:13:12,328 INFO L78 Accepts]: Start accepts. Automaton has 170564 states and 543140 transitions. Word has length 53 [2021-06-05 08:13:12,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:13:12,328 INFO L482 AbstractCegarLoop]: Abstraction has 170564 states and 543140 transitions. [2021-06-05 08:13:12,328 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:13:12,328 INFO L276 IsEmpty]: Start isEmpty. Operand 170564 states and 543140 transitions. [2021-06-05 08:13:12,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-06-05 08:13:12,347 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:13:12,347 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:13:12,347 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-06-05 08:13:12,347 INFO L430 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:13:12,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:13:12,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1565251396, now seen corresponding path program 3 times [2021-06-05 08:13:12,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:13:12,348 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147915032] [2021-06-05 08:13:12,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:13:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:13:12,453 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:13:12,453 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:13:12,453 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147915032] [2021-06-05 08:13:12,453 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147915032] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:13:12,453 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:13:12,453 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 08:13:12,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60047667] [2021-06-05 08:13:12,454 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 08:13:12,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:13:12,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 08:13:12,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-06-05 08:13:12,454 INFO L87 Difference]: Start difference. First operand 170564 states and 543140 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:13:13,454 WARN L205 SmtUtils]: Spent 899.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2021-06-05 08:13:16,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:13:16,468 INFO L93 Difference]: Finished difference Result 265984 states and 829032 transitions. [2021-06-05 08:13:16,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 08:13:16,468 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-06-05 08:13:16,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:13:17,238 INFO L225 Difference]: With dead ends: 265984 [2021-06-05 08:13:17,239 INFO L226 Difference]: Without dead ends: 265984 [2021-06-05 08:13:17,239 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 1629.9ms TimeCoverageRelationStatistics Valid=458, Invalid=1522, Unknown=0, NotChecked=0, Total=1980 [2021-06-05 08:13:17,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265984 states. [2021-06-05 08:13:21,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265984 to 174586. [2021-06-05 08:13:21,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174586 states, 174577 states have (on average 3.1802757522468594) internal successors, (555203), 174585 states have internal predecessors, (555203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:13:22,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174586 states to 174586 states and 555203 transitions. [2021-06-05 08:13:22,987 INFO L78 Accepts]: Start accepts. Automaton has 174586 states and 555203 transitions. Word has length 53 [2021-06-05 08:13:22,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:13:22,987 INFO L482 AbstractCegarLoop]: Abstraction has 174586 states and 555203 transitions. [2021-06-05 08:13:22,987 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:13:22,987 INFO L276 IsEmpty]: Start isEmpty. Operand 174586 states and 555203 transitions. [2021-06-05 08:13:23,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-06-05 08:13:23,044 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:13:23,045 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:13:23,045 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-06-05 08:13:23,045 INFO L430 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:13:23,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:13:23,045 INFO L82 PathProgramCache]: Analyzing trace with hash 2132008458, now seen corresponding path program 4 times [2021-06-05 08:13:23,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:13:23,045 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071174696] [2021-06-05 08:13:23,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:13:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:13:23,231 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:13:23,231 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:13:23,231 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071174696] [2021-06-05 08:13:23,231 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071174696] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:13:23,231 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:13:23,231 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 08:13:23,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061570295] [2021-06-05 08:13:23,232 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 08:13:23,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:13:23,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 08:13:23,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-06-05 08:13:23,232 INFO L87 Difference]: Start difference. First operand 174586 states and 555203 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:13:26,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:13:26,026 INFO L93 Difference]: Finished difference Result 243936 states and 759743 transitions. [2021-06-05 08:13:26,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-06-05 08:13:26,027 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-06-05 08:13:26,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:13:26,631 INFO L225 Difference]: With dead ends: 243936 [2021-06-05 08:13:26,632 INFO L226 Difference]: Without dead ends: 243936 [2021-06-05 08:13:26,632 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 700.0ms TimeCoverageRelationStatistics Valid=550, Invalid=1706, Unknown=0, NotChecked=0, Total=2256 [2021-06-05 08:13:27,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243936 states. [2021-06-05 08:13:30,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243936 to 172994. [2021-06-05 08:13:30,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172994 states, 172985 states have (on average 3.1769517588230194) internal successors, (549565), 172993 states have internal predecessors, (549565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:13:31,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172994 states to 172994 states and 549565 transitions. [2021-06-05 08:13:31,492 INFO L78 Accepts]: Start accepts. Automaton has 172994 states and 549565 transitions. Word has length 53 [2021-06-05 08:13:31,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:13:31,493 INFO L482 AbstractCegarLoop]: Abstraction has 172994 states and 549565 transitions. [2021-06-05 08:13:31,493 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:13:31,493 INFO L276 IsEmpty]: Start isEmpty. Operand 172994 states and 549565 transitions. [2021-06-05 08:13:31,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-06-05 08:13:31,517 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:13:31,517 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:13:31,517 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-06-05 08:13:31,517 INFO L430 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:13:31,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:13:31,517 INFO L82 PathProgramCache]: Analyzing trace with hash -976393070, now seen corresponding path program 2 times [2021-06-05 08:13:31,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:13:31,518 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784789318] [2021-06-05 08:13:31,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:13:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:13:32,338 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:13:32,338 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:13:32,338 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784789318] [2021-06-05 08:13:32,338 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784789318] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:13:32,338 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:13:32,339 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 08:13:32,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234882574] [2021-06-05 08:13:32,339 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 08:13:32,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:13:32,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 08:13:32,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-06-05 08:13:32,340 INFO L87 Difference]: Start difference. First operand 172994 states and 549565 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:13:34,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:13:34,974 INFO L93 Difference]: Finished difference Result 216370 states and 677825 transitions. [2021-06-05 08:13:34,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-06-05 08:13:34,975 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-06-05 08:13:34,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:13:35,533 INFO L225 Difference]: With dead ends: 216370 [2021-06-05 08:13:35,533 INFO L226 Difference]: Without dead ends: 216370 [2021-06-05 08:13:35,533 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 610.5ms TimeCoverageRelationStatistics Valid=563, Invalid=1789, Unknown=0, NotChecked=0, Total=2352 [2021-06-05 08:13:36,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216370 states. [2021-06-05 08:13:39,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216370 to 176520. [2021-06-05 08:13:39,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176520 states, 176511 states have (on average 3.1752072108820415) internal successors, (560459), 176519 states have internal predecessors, (560459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:13:40,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176520 states to 176520 states and 560459 transitions. [2021-06-05 08:13:40,242 INFO L78 Accepts]: Start accepts. Automaton has 176520 states and 560459 transitions. Word has length 53 [2021-06-05 08:13:40,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:13:40,242 INFO L482 AbstractCegarLoop]: Abstraction has 176520 states and 560459 transitions. [2021-06-05 08:13:40,242 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:13:40,242 INFO L276 IsEmpty]: Start isEmpty. Operand 176520 states and 560459 transitions. [2021-06-05 08:13:40,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-06-05 08:13:40,260 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:13:40,260 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:13:40,260 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-06-05 08:13:40,260 INFO L430 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:13:40,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:13:40,260 INFO L82 PathProgramCache]: Analyzing trace with hash 752979274, now seen corresponding path program 5 times [2021-06-05 08:13:40,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:13:40,260 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421747377] [2021-06-05 08:13:40,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:13:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:13:40,358 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:13:40,359 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:13:40,359 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421747377] [2021-06-05 08:13:40,359 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421747377] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:13:40,359 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:13:40,359 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 08:13:40,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522148680] [2021-06-05 08:13:40,359 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 08:13:40,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:13:40,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 08:13:40,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-06-05 08:13:40,360 INFO L87 Difference]: Start difference. First operand 176520 states and 560459 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:13:43,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:13:43,002 INFO L93 Difference]: Finished difference Result 219386 states and 684692 transitions. [2021-06-05 08:13:43,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-06-05 08:13:43,002 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-06-05 08:13:43,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:13:43,575 INFO L225 Difference]: With dead ends: 219386 [2021-06-05 08:13:43,576 INFO L226 Difference]: Without dead ends: 219386 [2021-06-05 08:13:43,576 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1152 ImplicationChecksByTransitivity, 705.3ms TimeCoverageRelationStatistics Valid=721, Invalid=2819, Unknown=0, NotChecked=0, Total=3540 [2021-06-05 08:13:44,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219386 states. [2021-06-05 08:13:47,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219386 to 185684. [2021-06-05 08:13:47,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185684 states, 185675 states have (on average 3.1644755621381444) internal successors, (587564), 185683 states have internal predecessors, (587564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:13:49,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185684 states to 185684 states and 587564 transitions. [2021-06-05 08:13:49,156 INFO L78 Accepts]: Start accepts. Automaton has 185684 states and 587564 transitions. Word has length 53 [2021-06-05 08:13:49,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:13:49,156 INFO L482 AbstractCegarLoop]: Abstraction has 185684 states and 587564 transitions. [2021-06-05 08:13:49,156 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:13:49,156 INFO L276 IsEmpty]: Start isEmpty. Operand 185684 states and 587564 transitions. [2021-06-05 08:13:49,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-06-05 08:13:49,179 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:13:49,180 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:13:49,180 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-06-05 08:13:49,180 INFO L430 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:13:49,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:13:49,180 INFO L82 PathProgramCache]: Analyzing trace with hash -114685299, now seen corresponding path program 1 times [2021-06-05 08:13:49,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:13:49,180 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979434124] [2021-06-05 08:13:49,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:13:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:13:49,218 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:13:49,219 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:13:49,219 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979434124] [2021-06-05 08:13:49,219 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979434124] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:13:49,219 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29737468] [2021-06-05 08:13:49,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:13:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:13:49,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 40 conjunts are in the unsatisfiable core [2021-06-05 08:13:49,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:13:49,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:13:49,322 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:13:49,329 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:13:49,330 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:13:49,330 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:13:49,375 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:13:49,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:13:49,377 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:13:49,384 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:13:49,384 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:13:49,385 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:25 [2021-06-05 08:13:49,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:13:49,416 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:13:49,424 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:13:49,426 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:13:49,426 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2021-06-05 08:13:49,464 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:13:49,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 08:13:49,467 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:13:49,475 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:13:49,476 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:13:49,476 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:26 [2021-06-05 08:13:49,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2021-06-05 08:13:49,507 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:13:49,524 INFO L628 ElimStorePlain]: treesize reduction 4, result has 87.9 percent of original size [2021-06-05 08:13:49,524 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:13:49,525 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:29 [2021-06-05 08:13:49,565 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 08:13:49,565 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2021-06-05 08:13:49,567 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:13:49,577 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:13:49,579 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:13:49,579 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:21 [2021-06-05 08:13:49,750 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:13:49,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2021-06-05 08:13:49,752 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:13:49,755 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:13:49,756 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:13:49,756 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:3 [2021-06-05 08:13:49,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:13:49,760 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29737468] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:13:49,760 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:13:49,760 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12] total 16 [2021-06-05 08:13:49,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687277642] [2021-06-05 08:13:49,760 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 08:13:49,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:13:49,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 08:13:49,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2021-06-05 08:13:49,761 INFO L87 Difference]: Start difference. First operand 185684 states and 587564 transitions. Second operand has 16 states, 16 states have (on average 5.625) internal successors, (90), 16 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:13:51,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:13:51,887 INFO L93 Difference]: Finished difference Result 224458 states and 705391 transitions. [2021-06-05 08:13:51,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 08:13:51,888 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.625) internal successors, (90), 16 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-06-05 08:13:51,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:13:52,440 INFO L225 Difference]: With dead ends: 224458 [2021-06-05 08:13:52,440 INFO L226 Difference]: Without dead ends: 224458 [2021-06-05 08:13:52,441 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 343.1ms TimeCoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756 [2021-06-05 08:13:52,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224458 states. [2021-06-05 08:13:56,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224458 to 173199. [2021-06-05 08:13:56,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173199 states, 173190 states have (on average 3.1884173451123043) internal successors, (552202), 173198 states have internal predecessors, (552202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:13:57,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173199 states to 173199 states and 552202 transitions. [2021-06-05 08:13:57,308 INFO L78 Accepts]: Start accepts. Automaton has 173199 states and 552202 transitions. Word has length 53 [2021-06-05 08:13:57,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:13:57,309 INFO L482 AbstractCegarLoop]: Abstraction has 173199 states and 552202 transitions. [2021-06-05 08:13:57,309 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 5.625) internal successors, (90), 16 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:13:57,309 INFO L276 IsEmpty]: Start isEmpty. Operand 173199 states and 552202 transitions. [2021-06-05 08:13:57,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 08:13:57,327 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:13:57,327 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:13:57,549 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2021-06-05 08:13:57,549 INFO L430 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:13:57,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:13:57,550 INFO L82 PathProgramCache]: Analyzing trace with hash -2070137920, now seen corresponding path program 11 times [2021-06-05 08:13:57,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:13:57,550 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775284382] [2021-06-05 08:13:57,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:13:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:13:57,819 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:13:57,819 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:13:57,819 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775284382] [2021-06-05 08:13:57,819 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775284382] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:13:57,819 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866882622] [2021-06-05 08:13:57,819 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:13:57,902 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 08:13:57,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:13:57,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 08:13:57,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:13:57,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:13:57,919 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:13:57,922 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:13:57,922 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:13:57,922 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:13:57,940 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-06-05 08:13:57,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-06-05 08:13:57,942 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:13:57,946 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:13:57,947 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:13:57,947 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2021-06-05 08:13:58,019 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-06-05 08:13:58,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 22 [2021-06-05 08:13:58,020 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:13:58,026 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:13:58,027 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:13:58,027 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2021-06-05 08:13:58,076 INFO L354 Elim1Store]: treesize reduction 36, result has 26.5 percent of original size [2021-06-05 08:13:58,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 21 treesize of output 25 [2021-06-05 08:13:58,079 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:13:58,084 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:13:58,085 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:13:58,085 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:16 [2021-06-05 08:13:58,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2021-06-05 08:13:58,187 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:13:58,196 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:13:58,197 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:13:58,198 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:20 [2021-06-05 08:13:58,249 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:13:58,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 34 [2021-06-05 08:13:58,251 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:13:58,258 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:13:58,260 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:13:58,260 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:23 [2021-06-05 08:13:58,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2021-06-05 08:13:58,338 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:13:58,342 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:13:58,349 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:13:58,349 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:8 [2021-06-05 08:13:58,371 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:13:58,372 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866882622] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:13:58,372 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:13:58,372 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2021-06-05 08:13:58,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237855504] [2021-06-05 08:13:58,372 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 08:13:58,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:13:58,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 08:13:58,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2021-06-05 08:13:58,373 INFO L87 Difference]: Start difference. First operand 173199 states and 552202 transitions. Second operand has 23 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:14:03,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:14:03,667 INFO L93 Difference]: Finished difference Result 216789 states and 679994 transitions. [2021-06-05 08:14:03,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2021-06-05 08:14:03,668 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-06-05 08:14:03,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:14:04,214 INFO L225 Difference]: With dead ends: 216789 [2021-06-05 08:14:04,215 INFO L226 Difference]: Without dead ends: 216789 [2021-06-05 08:14:04,215 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3537 ImplicationChecksByTransitivity, 2631.1ms TimeCoverageRelationStatistics Valid=1393, Invalid=8507, Unknown=0, NotChecked=0, Total=9900 [2021-06-05 08:14:05,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216789 states. [2021-06-05 08:14:08,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216789 to 182937. [2021-06-05 08:14:08,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182937 states, 182928 states have (on average 3.178026327298172) internal successors, (581350), 182936 states have internal predecessors, (581350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:14:10,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182937 states to 182937 states and 581350 transitions. [2021-06-05 08:14:10,379 INFO L78 Accepts]: Start accepts. Automaton has 182937 states and 581350 transitions. Word has length 54 [2021-06-05 08:14:10,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:14:10,380 INFO L482 AbstractCegarLoop]: Abstraction has 182937 states and 581350 transitions. [2021-06-05 08:14:10,380 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:14:10,380 INFO L276 IsEmpty]: Start isEmpty. Operand 182937 states and 581350 transitions. [2021-06-05 08:14:10,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 08:14:10,403 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:14:10,403 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:14:10,617 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:14:10,618 INFO L430 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:14:10,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:14:10,619 INFO L82 PathProgramCache]: Analyzing trace with hash 119279889, now seen corresponding path program 10 times [2021-06-05 08:14:10,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:14:10,619 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059436029] [2021-06-05 08:14:10,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:14:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:14:10,814 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:14:10,815 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:14:10,815 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059436029] [2021-06-05 08:14:10,815 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059436029] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:14:10,815 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67276243] [2021-06-05 08:14:10,815 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:14:10,899 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 08:14:10,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:14:10,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 54 conjunts are in the unsatisfiable core [2021-06-05 08:14:10,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:14:10,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:14:10,916 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:10,918 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:14:10,919 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:14:10,919 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:14:10,935 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:14:10,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 08:14:10,936 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:10,940 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:14:10,940 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:14:10,940 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2021-06-05 08:14:10,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:14:10,956 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:10,962 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:14:10,964 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:14:10,964 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:15 [2021-06-05 08:14:10,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:14:10,984 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:10,990 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:14:10,991 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:14:10,991 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:15 [2021-06-05 08:14:11,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:14:11,014 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:11,021 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:14:11,022 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:14:11,022 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2021-06-05 08:14:11,060 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:14:11,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 08:14:11,062 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:11,069 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:14:11,070 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:14:11,070 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 [2021-06-05 08:14:11,110 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:14:11,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 22 [2021-06-05 08:14:11,112 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:11,122 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:14:11,124 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:14:11,124 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:33 [2021-06-05 08:14:11,254 INFO L354 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2021-06-05 08:14:11,255 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 28 [2021-06-05 08:14:11,256 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:11,270 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:14:11,275 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:14:11,275 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:36 [2021-06-05 08:14:11,380 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-06-05 08:14:11,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2021-06-05 08:14:11,382 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:11,394 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:14:11,404 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:14:11,404 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:40, output treesize:14 [2021-06-05 08:14:11,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:14:11,431 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:11,433 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:14:11,434 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:14:11,434 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2021-06-05 08:14:11,456 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:14:11,456 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67276243] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:14:11,456 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:14:11,456 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2021-06-05 08:14:11,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849024942] [2021-06-05 08:14:11,456 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 08:14:11,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:14:11,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 08:14:11,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2021-06-05 08:14:11,457 INFO L87 Difference]: Start difference. First operand 182937 states and 581350 transitions. Second operand has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:14:13,163 WARN L205 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 28 [2021-06-05 08:14:16,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:14:16,434 INFO L93 Difference]: Finished difference Result 282189 states and 881585 transitions. [2021-06-05 08:14:16,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-06-05 08:14:16,435 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-06-05 08:14:16,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:14:17,141 INFO L225 Difference]: With dead ends: 282189 [2021-06-05 08:14:17,141 INFO L226 Difference]: Without dead ends: 282189 [2021-06-05 08:14:17,142 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2420 ImplicationChecksByTransitivity, 2395.1ms TimeCoverageRelationStatistics Valid=940, Invalid=6200, Unknown=0, NotChecked=0, Total=7140 [2021-06-05 08:14:18,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282189 states. [2021-06-05 08:14:22,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282189 to 196181. [2021-06-05 08:14:22,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196181 states, 196172 states have (on average 3.1768397120893908) internal successors, (623207), 196180 states have internal predecessors, (623207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:14:22,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196181 states to 196181 states and 623207 transitions. [2021-06-05 08:14:22,941 INFO L78 Accepts]: Start accepts. Automaton has 196181 states and 623207 transitions. Word has length 54 [2021-06-05 08:14:22,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:14:22,941 INFO L482 AbstractCegarLoop]: Abstraction has 196181 states and 623207 transitions. [2021-06-05 08:14:22,941 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:14:22,941 INFO L276 IsEmpty]: Start isEmpty. Operand 196181 states and 623207 transitions. [2021-06-05 08:14:22,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 08:14:22,960 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:14:22,960 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:14:23,160 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:14:23,161 INFO L430 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:14:23,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:14:23,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1596090587, now seen corresponding path program 11 times [2021-06-05 08:14:23,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:14:23,161 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038241457] [2021-06-05 08:14:23,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:14:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:14:23,412 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:14:23,412 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:14:23,412 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038241457] [2021-06-05 08:14:23,413 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038241457] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:14:23,413 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259965035] [2021-06-05 08:14:23,413 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:14:23,502 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 08:14:23,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:14:23,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 54 conjunts are in the unsatisfiable core [2021-06-05 08:14:23,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:14:23,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:14:23,519 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:23,521 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:14:23,522 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:14:23,522 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:14:23,547 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:14:23,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:14:23,549 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:23,555 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:14:23,556 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:14:23,556 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:25 [2021-06-05 08:14:23,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:14:23,592 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:23,600 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:14:23,601 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:14:23,601 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2021-06-05 08:14:23,625 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:14:23,626 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:23,634 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:14:23,635 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:14:23,636 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2021-06-05 08:14:23,682 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:14:23,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 08:14:23,685 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:23,698 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:14:23,699 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:14:23,699 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:41 [2021-06-05 08:14:23,758 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-05 08:14:23,758 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2021-06-05 08:14:23,761 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:23,773 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:14:23,774 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:14:23,774 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:38 [2021-06-05 08:14:23,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2021-06-05 08:14:23,810 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:23,831 INFO L628 ElimStorePlain]: treesize reduction 4, result has 91.1 percent of original size [2021-06-05 08:14:23,832 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:14:23,832 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:73, output treesize:41 [2021-06-05 08:14:24,529 INFO L244 Elim1Store]: Index analysis took 653 ms [2021-06-05 08:14:24,545 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-06-05 08:14:24,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 28 [2021-06-05 08:14:24,547 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:24,562 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:14:24,565 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:14:24,565 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:48 [2021-06-05 08:14:24,668 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 08:14:24,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 38 [2021-06-05 08:14:24,669 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:24,686 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:14:24,689 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:14:24,689 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:36 [2021-06-05 08:14:24,829 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:14:24,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 20 [2021-06-05 08:14:24,831 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:24,838 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:14:24,839 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:14:24,839 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:7 [2021-06-05 08:14:24,861 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:14:24,861 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259965035] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:14:24,861 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:14:24,861 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 22 [2021-06-05 08:14:24,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789894892] [2021-06-05 08:14:24,862 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-05 08:14:24,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:14:24,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-05 08:14:24,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2021-06-05 08:14:24,862 INFO L87 Difference]: Start difference. First operand 196181 states and 623207 transitions. Second operand has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:14:27,611 WARN L205 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 34 [2021-06-05 08:14:29,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:14:29,835 INFO L93 Difference]: Finished difference Result 271607 states and 852670 transitions. [2021-06-05 08:14:29,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2021-06-05 08:14:29,836 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-06-05 08:14:29,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:14:30,516 INFO L225 Difference]: With dead ends: 271607 [2021-06-05 08:14:30,517 INFO L226 Difference]: Without dead ends: 271607 [2021-06-05 08:14:30,517 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2480 ImplicationChecksByTransitivity, 2581.7ms TimeCoverageRelationStatistics Valid=1071, Invalid=6239, Unknown=0, NotChecked=0, Total=7310 [2021-06-05 08:14:31,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271607 states. [2021-06-05 08:14:34,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271607 to 194587. [2021-06-05 08:14:34,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194587 states, 194578 states have (on average 3.1743670918603337) internal successors, (617662), 194586 states have internal predecessors, (617662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:14:35,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194587 states to 194587 states and 617662 transitions. [2021-06-05 08:14:35,434 INFO L78 Accepts]: Start accepts. Automaton has 194587 states and 617662 transitions. Word has length 54 [2021-06-05 08:14:35,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:14:35,434 INFO L482 AbstractCegarLoop]: Abstraction has 194587 states and 617662 transitions. [2021-06-05 08:14:35,434 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:14:35,434 INFO L276 IsEmpty]: Start isEmpty. Operand 194587 states and 617662 transitions. [2021-06-05 08:14:35,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 08:14:35,453 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:14:35,453 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:14:35,653 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2021-06-05 08:14:35,653 INFO L430 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:14:35,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:14:35,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1346521839, now seen corresponding path program 12 times [2021-06-05 08:14:35,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:14:35,654 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814160803] [2021-06-05 08:14:35,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:14:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:14:36,431 WARN L205 SmtUtils]: Spent 721.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2021-06-05 08:14:36,641 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:14:36,641 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:14:36,641 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814160803] [2021-06-05 08:14:36,642 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814160803] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:14:36,642 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103060375] [2021-06-05 08:14:36,642 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:14:36,817 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-06-05 08:14:36,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:14:36,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 42 conjunts are in the unsatisfiable core [2021-06-05 08:14:36,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:14:36,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:14:36,834 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:36,837 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:14:36,838 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:14:36,838 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:14:36,853 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:14:36,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 08:14:36,855 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:36,858 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:14:36,859 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:14:36,859 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2021-06-05 08:14:36,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:14:36,913 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:36,918 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:14:36,919 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:14:36,919 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2021-06-05 08:14:36,965 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:14:36,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2021-06-05 08:14:36,967 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:36,974 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:14:36,975 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:14:36,975 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:23 [2021-06-05 08:14:37,065 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:14:37,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 08:14:37,067 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:37,075 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:14:37,076 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:14:37,076 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2021-06-05 08:14:37,140 INFO L354 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2021-06-05 08:14:37,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 29 [2021-06-05 08:14:37,142 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:37,152 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:14:37,155 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:14:37,155 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:37 [2021-06-05 08:14:37,265 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-06-05 08:14:37,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 40 [2021-06-05 08:14:37,267 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:37,280 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:14:37,284 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:14:37,284 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:15 [2021-06-05 08:14:37,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:14:37,312 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:37,315 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:14:37,315 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:14:37,315 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:8 [2021-06-05 08:14:37,338 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:14:37,338 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103060375] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:14:37,338 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:14:37,338 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 24 [2021-06-05 08:14:37,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476630775] [2021-06-05 08:14:37,338 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 08:14:37,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:14:37,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 08:14:37,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2021-06-05 08:14:37,339 INFO L87 Difference]: Start difference. First operand 194587 states and 617662 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:14:40,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:14:40,297 INFO L93 Difference]: Finished difference Result 304029 states and 946975 transitions. [2021-06-05 08:14:40,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-06-05 08:14:40,297 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-06-05 08:14:40,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:14:41,057 INFO L225 Difference]: With dead ends: 304029 [2021-06-05 08:14:41,057 INFO L226 Difference]: Without dead ends: 304029 [2021-06-05 08:14:41,058 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 1946.0ms TimeCoverageRelationStatistics Valid=728, Invalid=2932, Unknown=0, NotChecked=0, Total=3660 [2021-06-05 08:14:42,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304029 states. [2021-06-05 08:14:46,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304029 to 195227. [2021-06-05 08:14:46,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195227 states, 195218 states have (on average 3.173785204233216) internal successors, (619580), 195226 states have internal predecessors, (619580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:14:47,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195227 states to 195227 states and 619580 transitions. [2021-06-05 08:14:47,251 INFO L78 Accepts]: Start accepts. Automaton has 195227 states and 619580 transitions. Word has length 54 [2021-06-05 08:14:47,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:14:47,251 INFO L482 AbstractCegarLoop]: Abstraction has 195227 states and 619580 transitions. [2021-06-05 08:14:47,251 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:14:47,251 INFO L276 IsEmpty]: Start isEmpty. Operand 195227 states and 619580 transitions. [2021-06-05 08:14:47,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 08:14:47,270 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:14:47,271 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:14:47,480 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2021-06-05 08:14:47,480 INFO L430 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:14:47,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:14:47,481 INFO L82 PathProgramCache]: Analyzing trace with hash -368848637, now seen corresponding path program 13 times [2021-06-05 08:14:47,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:14:47,481 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523782261] [2021-06-05 08:14:47,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:14:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:14:47,664 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:14:47,664 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:14:47,664 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523782261] [2021-06-05 08:14:47,664 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523782261] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:14:47,665 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094821236] [2021-06-05 08:14:47,665 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:14:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:14:47,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 54 conjunts are in the unsatisfiable core [2021-06-05 08:14:47,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:14:47,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:14:47,747 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:47,749 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:14:47,750 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:14:47,750 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:14:47,782 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:14:47,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:14:47,784 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:47,790 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:14:47,790 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:14:47,790 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:25 [2021-06-05 08:14:47,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:14:47,837 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:47,844 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:14:47,845 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:14:47,845 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2021-06-05 08:14:47,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:14:47,871 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:47,879 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:14:47,880 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:14:47,880 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2021-06-05 08:14:47,918 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:14:47,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 08:14:47,922 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:47,938 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:14:47,939 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:14:47,939 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:41 [2021-06-05 08:14:48,674 WARN L205 SmtUtils]: Spent 714.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2021-06-05 08:14:48,733 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2021-06-05 08:14:48,734 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:48,781 INFO L628 ElimStorePlain]: treesize reduction 4, result has 91.7 percent of original size [2021-06-05 08:14:48,784 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:14:48,784 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:76, output treesize:44 [2021-06-05 08:14:48,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 08:14:48,881 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-05 08:14:48,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2021-06-05 08:14:48,884 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:48,896 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:14:48,904 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:14:48,905 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:41 [2021-06-05 08:14:48,959 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-06-05 08:14:48,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 28 [2021-06-05 08:14:48,960 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:48,978 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:14:48,981 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:14:48,981 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:48 [2021-06-05 08:14:49,051 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 08:14:49,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 38 [2021-06-05 08:14:49,052 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:49,069 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:14:49,072 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:14:49,072 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:36 [2021-06-05 08:14:49,172 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:14:49,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 20 [2021-06-05 08:14:49,174 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:14:49,181 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:14:49,182 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:14:49,182 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:7 [2021-06-05 08:14:49,207 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:14:49,207 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094821236] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:14:49,207 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:14:49,207 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 22 [2021-06-05 08:14:49,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66227445] [2021-06-05 08:14:49,208 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-05 08:14:49,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:14:49,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-05 08:14:49,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2021-06-05 08:14:49,209 INFO L87 Difference]: Start difference. First operand 195227 states and 619580 transitions. Second operand has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:15:02,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:15:02,245 INFO L93 Difference]: Finished difference Result 292859 states and 912321 transitions. [2021-06-05 08:15:02,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2021-06-05 08:15:02,246 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-06-05 08:15:02,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:15:03,012 INFO L225 Difference]: With dead ends: 292859 [2021-06-05 08:15:03,012 INFO L226 Difference]: Without dead ends: 292859 [2021-06-05 08:15:03,016 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2621 ImplicationChecksByTransitivity, 3417.4ms TimeCoverageRelationStatistics Valid=1228, Invalid=6254, Unknown=0, NotChecked=0, Total=7482 [2021-06-05 08:15:03,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292859 states. [2021-06-05 08:15:08,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292859 to 199009. [2021-06-05 08:15:08,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199009 states, 199000 states have (on average 3.1536633165829144) internal successors, (627579), 199008 states have internal predecessors, (627579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:15:09,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199009 states to 199009 states and 627579 transitions. [2021-06-05 08:15:09,157 INFO L78 Accepts]: Start accepts. Automaton has 199009 states and 627579 transitions. Word has length 54 [2021-06-05 08:15:09,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:15:09,157 INFO L482 AbstractCegarLoop]: Abstraction has 199009 states and 627579 transitions. [2021-06-05 08:15:09,157 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:15:09,157 INFO L276 IsEmpty]: Start isEmpty. Operand 199009 states and 627579 transitions. [2021-06-05 08:15:09,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 08:15:09,172 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:15:09,172 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:15:09,373 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2021-06-05 08:15:09,373 INFO L430 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:15:09,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:15:09,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1844103080, now seen corresponding path program 12 times [2021-06-05 08:15:09,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:15:09,374 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956367567] [2021-06-05 08:15:09,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:15:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:15:09,569 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:15:09,569 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:15:09,569 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956367567] [2021-06-05 08:15:09,569 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956367567] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:15:09,569 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350814953] [2021-06-05 08:15:09,569 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:15:09,653 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-06-05 08:15:09,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:15:09,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 42 conjunts are in the unsatisfiable core [2021-06-05 08:15:09,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:15:09,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:15:09,669 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:15:09,672 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:15:09,673 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:15:09,673 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:15:09,687 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:15:09,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 08:15:09,690 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:15:09,694 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:15:09,694 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:15:09,694 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2021-06-05 08:15:09,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:15:09,752 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:15:09,758 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:15:09,759 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:15:09,759 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2021-06-05 08:15:09,798 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:15:09,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2021-06-05 08:15:09,800 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:15:09,806 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:15:09,807 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:15:09,807 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:23 [2021-06-05 08:15:09,887 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:15:09,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 08:15:09,888 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:15:09,895 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:15:09,896 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:15:09,896 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2021-06-05 08:15:09,962 INFO L354 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2021-06-05 08:15:09,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 29 [2021-06-05 08:15:09,963 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:15:09,972 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:15:09,974 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:15:09,974 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:37 [2021-06-05 08:15:10,077 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-06-05 08:15:10,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 40 [2021-06-05 08:15:10,079 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:15:10,092 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:15:10,095 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:15:10,095 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:15 [2021-06-05 08:15:10,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:15:10,157 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:15:10,165 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:15:10,166 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:15:10,166 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:8 [2021-06-05 08:15:10,188 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:15:10,188 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350814953] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:15:10,188 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:15:10,188 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 24 [2021-06-05 08:15:10,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560711332] [2021-06-05 08:15:10,189 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 08:15:10,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:15:10,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 08:15:10,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2021-06-05 08:15:10,190 INFO L87 Difference]: Start difference. First operand 199009 states and 627579 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:15:13,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:15:13,904 INFO L93 Difference]: Finished difference Result 335751 states and 1045232 transitions. [2021-06-05 08:15:13,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-06-05 08:15:13,904 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-06-05 08:15:13,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:15:14,879 INFO L225 Difference]: With dead ends: 335751 [2021-06-05 08:15:14,880 INFO L226 Difference]: Without dead ends: 335751 [2021-06-05 08:15:14,880 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 1121.6ms TimeCoverageRelationStatistics Valid=728, Invalid=2932, Unknown=0, NotChecked=0, Total=3660 [2021-06-05 08:15:15,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335751 states. [2021-06-05 08:15:20,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335751 to 208889. [2021-06-05 08:15:20,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208889 states, 208880 states have (on average 3.163806970509383) internal successors, (660856), 208888 states have internal predecessors, (660856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:15:21,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208889 states to 208889 states and 660856 transitions. [2021-06-05 08:15:21,671 INFO L78 Accepts]: Start accepts. Automaton has 208889 states and 660856 transitions. Word has length 54 [2021-06-05 08:15:21,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:15:21,671 INFO L482 AbstractCegarLoop]: Abstraction has 208889 states and 660856 transitions. [2021-06-05 08:15:21,671 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:15:21,671 INFO L276 IsEmpty]: Start isEmpty. Operand 208889 states and 660856 transitions. [2021-06-05 08:15:21,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 08:15:21,691 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:15:21,691 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:15:21,897 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:15:21,898 INFO L430 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:15:21,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:15:21,898 INFO L82 PathProgramCache]: Analyzing trace with hash 742034846, now seen corresponding path program 13 times [2021-06-05 08:15:21,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:15:21,898 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502040250] [2021-06-05 08:15:21,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:15:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:15:22,085 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:15:22,085 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:15:22,086 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502040250] [2021-06-05 08:15:22,086 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502040250] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:15:22,086 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656974979] [2021-06-05 08:15:22,086 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:15:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:15:22,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 54 conjunts are in the unsatisfiable core [2021-06-05 08:15:22,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:15:22,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:15:22,194 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:15:22,197 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:15:22,198 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:15:22,198 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:15:22,222 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:15:22,222 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:15:22,223 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:15:22,230 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:15:22,231 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:15:22,231 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:25 [2021-06-05 08:15:22,268 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:15:22,269 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:15:22,278 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:15:22,279 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:15:22,280 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2021-06-05 08:15:22,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:15:22,302 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:15:22,310 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:15:22,312 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:15:22,312 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2021-06-05 08:15:22,364 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:15:22,364 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 08:15:22,366 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:15:22,379 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:15:22,380 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:15:22,380 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:41 [2021-06-05 08:15:22,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2021-06-05 08:15:22,422 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:15:22,449 INFO L628 ElimStorePlain]: treesize reduction 4, result has 91.7 percent of original size [2021-06-05 08:15:22,450 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:15:22,450 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:76, output treesize:44 [2021-06-05 08:15:22,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 08:15:22,508 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-05 08:15:22,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2021-06-05 08:15:22,511 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:15:22,524 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:15:22,525 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:15:22,525 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:41 [2021-06-05 08:15:22,579 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-06-05 08:15:22,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 28 [2021-06-05 08:15:22,580 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:15:22,595 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:15:22,598 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:15:22,598 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:48 [2021-06-05 08:15:22,658 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 08:15:22,658 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 38 [2021-06-05 08:15:22,659 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:15:22,676 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:15:22,679 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:15:22,679 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:36 [2021-06-05 08:15:22,786 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:15:22,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 20 [2021-06-05 08:15:22,789 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:15:22,796 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:15:22,797 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:15:22,797 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:7 [2021-06-05 08:15:22,820 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:15:22,820 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656974979] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:15:22,820 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:15:22,821 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 22 [2021-06-05 08:15:22,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680922473] [2021-06-05 08:15:22,821 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-05 08:15:22,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:15:22,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-05 08:15:22,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2021-06-05 08:15:22,822 INFO L87 Difference]: Start difference. First operand 208889 states and 660856 transitions. Second operand has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:15:36,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:15:36,514 INFO L93 Difference]: Finished difference Result 327289 states and 1020287 transitions. [2021-06-05 08:15:36,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2021-06-05 08:15:36,514 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-06-05 08:15:36,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:15:37,361 INFO L225 Difference]: With dead ends: 327289 [2021-06-05 08:15:37,361 INFO L226 Difference]: Without dead ends: 327289 [2021-06-05 08:15:37,362 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2610 ImplicationChecksByTransitivity, 2774.1ms TimeCoverageRelationStatistics Valid=1228, Invalid=6254, Unknown=0, NotChecked=0, Total=7482 [2021-06-05 08:15:38,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327289 states. [2021-06-05 08:15:44,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327289 to 217530. [2021-06-05 08:15:44,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217530 states, 217521 states have (on average 3.1573687138253317) internal successors, (686794), 217529 states have internal predecessors, (686794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:15:44,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217530 states to 217530 states and 686794 transitions. [2021-06-05 08:15:44,951 INFO L78 Accepts]: Start accepts. Automaton has 217530 states and 686794 transitions. Word has length 54 [2021-06-05 08:15:44,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:15:44,951 INFO L482 AbstractCegarLoop]: Abstraction has 217530 states and 686794 transitions. [2021-06-05 08:15:44,952 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:15:44,952 INFO L276 IsEmpty]: Start isEmpty. Operand 217530 states and 686794 transitions. [2021-06-05 08:15:44,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 08:15:44,968 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:15:44,968 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:15:45,168 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:15:45,169 INFO L430 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:15:45,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:15:45,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1228712, now seen corresponding path program 14 times [2021-06-05 08:15:45,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:15:45,170 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553246739] [2021-06-05 08:15:45,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:15:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:15:46,013 WARN L205 SmtUtils]: Spent 726.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2021-06-05 08:15:46,090 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:15:46,091 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:15:46,091 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553246739] [2021-06-05 08:15:46,091 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553246739] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:15:46,091 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283030575] [2021-06-05 08:15:46,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:15:46,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 08:15:46,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:15:46,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 32 conjunts are in the unsatisfiable core [2021-06-05 08:15:46,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:15:46,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:15:46,331 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:15:46,334 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:15:46,349 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:15:46,349 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:15:46,368 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-06-05 08:15:46,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-06-05 08:15:46,369 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:15:46,373 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:15:46,374 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:15:46,374 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2021-06-05 08:15:46,464 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 08:15:46,464 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 08:15:46,466 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:15:46,474 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:15:46,475 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:15:46,475 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:27 [2021-06-05 08:15:46,521 INFO L354 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2021-06-05 08:15:46,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 25 [2021-06-05 08:15:46,524 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:15:46,532 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:15:46,533 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:15:46,533 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:24 [2021-06-05 08:15:46,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2021-06-05 08:15:46,630 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:15:46,641 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:15:46,643 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:15:46,643 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:24 [2021-06-05 08:15:46,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2021-06-05 08:15:46,686 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:15:46,695 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:15:46,696 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:15:46,696 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:59, output treesize:23 [2021-06-05 08:15:46,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2021-06-05 08:15:46,769 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:15:46,773 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:15:46,774 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:15:46,774 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:8 [2021-06-05 08:15:46,796 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:15:46,797 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283030575] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:15:46,797 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:15:46,797 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2021-06-05 08:15:46,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264192963] [2021-06-05 08:15:46,797 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 08:15:46,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:15:46,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 08:15:46,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2021-06-05 08:15:46,798 INFO L87 Difference]: Start difference. First operand 217530 states and 686794 transitions. Second operand has 23 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:15:52,139 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-06-05 08:15:57,066 WARN L205 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2021-06-05 08:15:58,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:15:58,143 INFO L93 Difference]: Finished difference Result 490565 states and 1531574 transitions. [2021-06-05 08:15:58,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2021-06-05 08:15:58,144 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-06-05 08:15:58,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:15:59,712 INFO L225 Difference]: With dead ends: 490565 [2021-06-05 08:15:59,713 INFO L226 Difference]: Without dead ends: 490565 [2021-06-05 08:15:59,715 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17289 ImplicationChecksByTransitivity, 7595.0ms TimeCoverageRelationStatistics Valid=4371, Invalid=36635, Unknown=0, NotChecked=0, Total=41006 [2021-06-05 08:16:01,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490565 states. [2021-06-05 08:16:09,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490565 to 292874. [2021-06-05 08:16:09,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292874 states, 292865 states have (on average 3.187130589179315) internal successors, (933399), 292873 states have internal predecessors, (933399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:16:10,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292874 states to 292874 states and 933399 transitions. [2021-06-05 08:16:10,697 INFO L78 Accepts]: Start accepts. Automaton has 292874 states and 933399 transitions. Word has length 54 [2021-06-05 08:16:10,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:16:10,698 INFO L482 AbstractCegarLoop]: Abstraction has 292874 states and 933399 transitions. [2021-06-05 08:16:10,698 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:16:10,698 INFO L276 IsEmpty]: Start isEmpty. Operand 292874 states and 933399 transitions. [2021-06-05 08:16:10,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 08:16:10,715 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:16:10,715 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:16:10,915 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:16:10,916 INFO L430 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:16:10,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:16:10,916 INFO L82 PathProgramCache]: Analyzing trace with hash 834298931, now seen corresponding path program 14 times [2021-06-05 08:16:10,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:16:10,917 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891764932] [2021-06-05 08:16:10,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:16:10,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:16:11,107 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:16:11,107 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:16:11,107 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891764932] [2021-06-05 08:16:11,107 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891764932] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:16:11,107 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886816989] [2021-06-05 08:16:11,107 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:16:11,188 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 08:16:11,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:16:11,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 42 conjunts are in the unsatisfiable core [2021-06-05 08:16:11,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:16:11,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:16:11,204 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:16:11,208 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:16:11,208 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:16:11,208 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:16:12,173 WARN L205 SmtUtils]: Spent 961.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2021-06-05 08:16:12,186 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:16:12,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 08:16:12,188 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:16:12,191 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:16:12,192 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:16:12,192 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2021-06-05 08:16:12,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:16:12,286 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:16:12,291 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:16:12,305 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:16:12,305 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2021-06-05 08:16:12,349 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:16:12,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 08:16:12,351 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:16:12,357 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:16:12,358 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:16:12,358 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2021-06-05 08:16:12,409 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:16:12,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2021-06-05 08:16:12,411 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:16:12,418 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:16:12,419 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:16:12,419 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:22 [2021-06-05 08:16:12,515 INFO L354 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2021-06-05 08:16:12,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 29 [2021-06-05 08:16:12,517 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:16:12,528 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:16:12,531 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:16:12,531 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:37 [2021-06-05 08:16:12,638 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-06-05 08:16:12,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 40 [2021-06-05 08:16:12,640 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:16:12,653 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:16:12,657 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:16:12,657 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:15 [2021-06-05 08:16:12,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:16:12,683 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:16:12,686 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:16:12,686 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:16:12,686 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:8 [2021-06-05 08:16:12,707 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:16:12,708 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886816989] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:16:12,708 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:16:12,708 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 24 [2021-06-05 08:16:12,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573659210] [2021-06-05 08:16:12,708 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 08:16:12,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:16:12,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 08:16:12,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2021-06-05 08:16:12,709 INFO L87 Difference]: Start difference. First operand 292874 states and 933399 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:16:15,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:16:15,694 INFO L93 Difference]: Finished difference Result 328826 states and 1035298 transitions. [2021-06-05 08:16:15,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-06-05 08:16:15,695 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-06-05 08:16:15,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:16:16,590 INFO L225 Difference]: With dead ends: 328826 [2021-06-05 08:16:16,590 INFO L226 Difference]: Without dead ends: 328826 [2021-06-05 08:16:16,591 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1141 ImplicationChecksByTransitivity, 1081.1ms TimeCoverageRelationStatistics Valid=867, Invalid=3293, Unknown=0, NotChecked=0, Total=4160 [2021-06-05 08:16:17,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328826 states. [2021-06-05 08:16:23,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328826 to 289040. [2021-06-05 08:16:23,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289040 states, 289031 states have (on average 3.184765647975477) internal successors, (920496), 289039 states have internal predecessors, (920496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:16:25,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289040 states to 289040 states and 920496 transitions. [2021-06-05 08:16:25,755 INFO L78 Accepts]: Start accepts. Automaton has 289040 states and 920496 transitions. Word has length 54 [2021-06-05 08:16:25,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:16:25,756 INFO L482 AbstractCegarLoop]: Abstraction has 289040 states and 920496 transitions. [2021-06-05 08:16:25,756 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:16:25,756 INFO L276 IsEmpty]: Start isEmpty. Operand 289040 states and 920496 transitions. [2021-06-05 08:16:25,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 08:16:25,774 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:16:25,774 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:16:25,974 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2021-06-05 08:16:25,975 INFO L430 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:16:25,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:16:25,975 INFO L82 PathProgramCache]: Analyzing trace with hash -881071545, now seen corresponding path program 15 times [2021-06-05 08:16:25,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:16:25,975 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102804823] [2021-06-05 08:16:25,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:16:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:16:26,195 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:16:26,195 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:16:26,195 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102804823] [2021-06-05 08:16:26,195 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102804823] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:16:26,195 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785103015] [2021-06-05 08:16:26,196 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:16:26,279 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 08:16:26,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:16:26,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 38 conjunts are in the unsatisfiable core [2021-06-05 08:16:26,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:16:26,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:16:26,296 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:16:26,299 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:16:26,300 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:16:26,300 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:16:26,335 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:16:26,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:16:26,343 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:16:26,348 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:16:26,350 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:16:26,350 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2021-06-05 08:16:26,432 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:16:26,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 08:16:26,434 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:16:26,442 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:16:26,443 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:16:26,443 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:31 [2021-06-05 08:16:26,480 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-05 08:16:26,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2021-06-05 08:16:26,483 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:16:26,491 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:16:26,491 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:16:26,492 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:28 [2021-06-05 08:16:26,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2021-06-05 08:16:26,579 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:16:26,590 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:16:26,591 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:16:26,591 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:71, output treesize:31 [2021-06-05 08:16:26,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2021-06-05 08:16:26,626 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:16:26,638 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:16:26,639 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:16:26,639 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:23 [2021-06-05 08:16:26,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2021-06-05 08:16:26,705 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:16:26,708 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:16:26,709 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:16:26,709 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:8 [2021-06-05 08:16:26,727 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:16:26,728 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785103015] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:16:26,728 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:16:26,728 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2021-06-05 08:16:26,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384845633] [2021-06-05 08:16:26,728 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-05 08:16:26,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:16:26,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-05 08:16:26,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2021-06-05 08:16:26,729 INFO L87 Difference]: Start difference. First operand 289040 states and 920496 transitions. Second operand has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:16:31,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:16:31,187 INFO L93 Difference]: Finished difference Result 365342 states and 1154919 transitions. [2021-06-05 08:16:31,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-06-05 08:16:31,187 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-06-05 08:16:31,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:16:32,130 INFO L225 Difference]: With dead ends: 365342 [2021-06-05 08:16:32,130 INFO L226 Difference]: Without dead ends: 365342 [2021-06-05 08:16:32,131 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 910 ImplicationChecksByTransitivity, 1868.6ms TimeCoverageRelationStatistics Valid=779, Invalid=2761, Unknown=0, NotChecked=0, Total=3540 [2021-06-05 08:16:33,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365342 states. [2021-06-05 08:16:39,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365342 to 308046. [2021-06-05 08:16:40,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308046 states, 308037 states have (on average 3.191045231579323) internal successors, (982960), 308045 states have internal predecessors, (982960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:16:41,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308046 states to 308046 states and 982960 transitions. [2021-06-05 08:16:41,440 INFO L78 Accepts]: Start accepts. Automaton has 308046 states and 982960 transitions. Word has length 54 [2021-06-05 08:16:41,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:16:41,441 INFO L482 AbstractCegarLoop]: Abstraction has 308046 states and 982960 transitions. [2021-06-05 08:16:41,441 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:16:41,441 INFO L276 IsEmpty]: Start isEmpty. Operand 308046 states and 982960 transitions. [2021-06-05 08:16:41,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 08:16:41,458 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:16:41,458 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:16:41,659 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2021-06-05 08:16:41,659 INFO L430 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:16:41,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:16:41,659 INFO L82 PathProgramCache]: Analyzing trace with hash -327461311, now seen corresponding path program 16 times [2021-06-05 08:16:41,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:16:41,660 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756377296] [2021-06-05 08:16:41,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:16:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:16:41,843 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:16:41,843 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:16:41,844 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756377296] [2021-06-05 08:16:41,844 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756377296] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:16:41,844 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750838242] [2021-06-05 08:16:41,844 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:16:41,917 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 08:16:41,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:16:41,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 52 conjunts are in the unsatisfiable core [2021-06-05 08:16:41,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:16:41,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:16:41,941 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:16:41,944 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:16:41,944 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:16:41,944 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:16:41,979 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:16:41,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:16:41,981 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:16:41,987 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:16:41,987 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:16:41,987 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:25 [2021-06-05 08:16:42,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:16:42,018 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:16:42,028 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:16:42,030 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:16:42,030 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2021-06-05 08:16:42,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:16:42,051 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:16:42,060 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:16:42,061 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:16:42,061 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2021-06-05 08:16:42,098 INFO L354 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2021-06-05 08:16:42,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2021-06-05 08:16:42,103 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:16:42,111 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:16:42,111 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:16:42,111 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:30 [2021-06-05 08:16:42,158 INFO L354 Elim1Store]: treesize reduction 28, result has 31.7 percent of original size [2021-06-05 08:16:42,158 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 25 [2021-06-05 08:16:42,161 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:16:42,172 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:16:42,173 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:16:42,173 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:30 [2021-06-05 08:16:42,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2021-06-05 08:16:42,214 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:16:42,232 INFO L628 ElimStorePlain]: treesize reduction 4, result has 89.2 percent of original size [2021-06-05 08:16:42,233 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:16:42,233 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:65, output treesize:33 [2021-06-05 08:16:42,286 INFO L354 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2021-06-05 08:16:42,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 28 [2021-06-05 08:16:42,288 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:16:42,302 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:16:42,305 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:16:42,305 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:40 [2021-06-05 08:16:42,369 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 08:16:42,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2021-06-05 08:16:42,371 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:16:42,382 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:16:42,383 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:16:42,384 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:21 [2021-06-05 08:16:43,207 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:16:43,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2021-06-05 08:16:43,225 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:16:43,233 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:16:43,234 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:16:43,235 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2021-06-05 08:16:43,254 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:16:43,254 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750838242] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:16:43,254 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:16:43,254 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2021-06-05 08:16:43,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550158384] [2021-06-05 08:16:43,254 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-05 08:16:43,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:16:43,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-05 08:16:43,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2021-06-05 08:16:43,255 INFO L87 Difference]: Start difference. First operand 308046 states and 982960 transitions. Second operand has 22 states, 22 states have (on average 3.590909090909091) internal successors, (79), 22 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:16:48,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:16:48,201 INFO L93 Difference]: Finished difference Result 354137 states and 1119716 transitions. [2021-06-05 08:16:48,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2021-06-05 08:16:48,202 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.590909090909091) internal successors, (79), 22 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-06-05 08:16:48,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:16:49,398 INFO L225 Difference]: With dead ends: 354137 [2021-06-05 08:16:49,398 INFO L226 Difference]: Without dead ends: 354137 [2021-06-05 08:16:49,398 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1810 ImplicationChecksByTransitivity, 2587.9ms TimeCoverageRelationStatistics Valid=880, Invalid=4820, Unknown=0, NotChecked=0, Total=5700 [2021-06-05 08:16:50,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354137 states. [2021-06-05 08:16:57,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354137 to 314630. [2021-06-05 08:16:58,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314630 states, 314621 states have (on average 3.1888907606294556) internal successors, (1003292), 314629 states have internal predecessors, (1003292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:17:00,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314630 states to 314630 states and 1003292 transitions. [2021-06-05 08:17:00,935 INFO L78 Accepts]: Start accepts. Automaton has 314630 states and 1003292 transitions. Word has length 54 [2021-06-05 08:17:00,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:17:00,942 INFO L482 AbstractCegarLoop]: Abstraction has 314630 states and 1003292 transitions. [2021-06-05 08:17:00,942 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 3.590909090909091) internal successors, (79), 22 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:17:00,942 INFO L276 IsEmpty]: Start isEmpty. Operand 314630 states and 1003292 transitions. [2021-06-05 08:17:00,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 08:17:00,982 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:17:00,982 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:17:01,212 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2021-06-05 08:17:01,213 INFO L430 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:17:01,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:17:01,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1223453548, now seen corresponding path program 1 times [2021-06-05 08:17:01,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:17:01,213 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595495922] [2021-06-05 08:17:01,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:17:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:17:01,264 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:17:01,265 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:17:01,265 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595495922] [2021-06-05 08:17:01,265 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595495922] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:17:01,265 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:17:01,265 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 08:17:01,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850497264] [2021-06-05 08:17:01,265 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 08:17:01,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:17:01,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 08:17:01,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 08:17:01,266 INFO L87 Difference]: Start difference. First operand 314630 states and 1003292 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:17:04,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:17:04,540 INFO L93 Difference]: Finished difference Result 348448 states and 1095021 transitions. [2021-06-05 08:17:04,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 08:17:04,553 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-06-05 08:17:04,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:17:06,072 INFO L225 Difference]: With dead ends: 348448 [2021-06-05 08:17:06,073 INFO L226 Difference]: Without dead ends: 348448 [2021-06-05 08:17:06,073 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 08:17:06,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348448 states. [2021-06-05 08:17:13,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348448 to 332822. [2021-06-05 08:17:13,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332822 states, 332813 states have (on average 3.156622487703305) internal successors, (1050565), 332821 states have internal predecessors, (1050565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:17:15,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332822 states to 332822 states and 1050565 transitions. [2021-06-05 08:17:15,991 INFO L78 Accepts]: Start accepts. Automaton has 332822 states and 1050565 transitions. Word has length 54 [2021-06-05 08:17:15,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:17:15,991 INFO L482 AbstractCegarLoop]: Abstraction has 332822 states and 1050565 transitions. [2021-06-05 08:17:15,991 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:17:15,991 INFO L276 IsEmpty]: Start isEmpty. Operand 332822 states and 1050565 transitions. [2021-06-05 08:17:16,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-05 08:17:16,027 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:17:16,027 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:17:16,027 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-06-05 08:17:16,027 INFO L430 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:17:16,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:17:16,027 INFO L82 PathProgramCache]: Analyzing trace with hash 554611805, now seen corresponding path program 2 times [2021-06-05 08:17:16,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:17:16,027 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839373548] [2021-06-05 08:17:16,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:17:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:17:16,065 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:17:16,066 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:17:16,066 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839373548] [2021-06-05 08:17:16,066 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839373548] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:17:16,066 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:17:16,066 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 08:17:16,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98817746] [2021-06-05 08:17:16,066 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 08:17:16,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:17:16,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 08:17:16,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 08:17:16,067 INFO L87 Difference]: Start difference. First operand 332822 states and 1050565 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:17:18,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:17:18,351 INFO L93 Difference]: Finished difference Result 338252 states and 1066198 transitions. [2021-06-05 08:17:18,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 08:17:18,351 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-06-05 08:17:18,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:17:19,301 INFO L225 Difference]: With dead ends: 338252 [2021-06-05 08:17:19,302 INFO L226 Difference]: Without dead ends: 338252 [2021-06-05 08:17:19,302 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 40.6ms TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-06-05 08:17:20,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338252 states. [2021-06-05 08:17:26,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338252 to 316772. [2021-06-05 08:17:26,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316772 states, 316764 states have (on average 3.17766539126921) internal successors, (1006570), 316771 states have internal predecessors, (1006570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:17:28,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316772 states to 316772 states and 1006570 transitions. [2021-06-05 08:17:28,489 INFO L78 Accepts]: Start accepts. Automaton has 316772 states and 1006570 transitions. Word has length 60 [2021-06-05 08:17:28,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:17:28,489 INFO L482 AbstractCegarLoop]: Abstraction has 316772 states and 1006570 transitions. [2021-06-05 08:17:28,489 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:17:28,489 INFO L276 IsEmpty]: Start isEmpty. Operand 316772 states and 1006570 transitions. [2021-06-05 08:17:28,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 08:17:28,527 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:17:28,527 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:17:28,527 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-06-05 08:17:28,528 INFO L430 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:17:28,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:17:28,528 INFO L82 PathProgramCache]: Analyzing trace with hash 177318449, now seen corresponding path program 1 times [2021-06-05 08:17:28,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:17:28,528 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064469722] [2021-06-05 08:17:28,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:17:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:17:28,571 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:17:28,571 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:17:28,571 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064469722] [2021-06-05 08:17:28,571 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064469722] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:17:28,572 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:17:28,572 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 08:17:28,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912782335] [2021-06-05 08:17:28,572 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 08:17:28,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:17:28,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 08:17:28,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 08:17:28,572 INFO L87 Difference]: Start difference. First operand 316772 states and 1006570 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:17:30,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:17:30,971 INFO L93 Difference]: Finished difference Result 342022 states and 1066348 transitions. [2021-06-05 08:17:30,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 08:17:30,971 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 08:17:30,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:17:32,037 INFO L225 Difference]: With dead ends: 342022 [2021-06-05 08:17:32,037 INFO L226 Difference]: Without dead ends: 342022 [2021-06-05 08:17:32,037 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 64.9ms TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-06-05 08:17:33,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342022 states. [2021-06-05 08:17:38,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342022 to 251854. [2021-06-05 08:17:39,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251854 states, 251846 states have (on average 3.1394780937557076) internal successors, (790665), 251853 states have internal predecessors, (790665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:17:40,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251854 states to 251854 states and 790665 transitions. [2021-06-05 08:17:40,055 INFO L78 Accepts]: Start accepts. Automaton has 251854 states and 790665 transitions. Word has length 63 [2021-06-05 08:17:40,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:17:40,056 INFO L482 AbstractCegarLoop]: Abstraction has 251854 states and 790665 transitions. [2021-06-05 08:17:40,056 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:17:40,056 INFO L276 IsEmpty]: Start isEmpty. Operand 251854 states and 790665 transitions. [2021-06-05 08:17:40,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 08:17:40,083 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:17:40,083 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:17:40,083 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-06-05 08:17:40,083 INFO L430 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:17:40,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:17:40,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1690856691, now seen corresponding path program 1 times [2021-06-05 08:17:40,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:17:40,083 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294136697] [2021-06-05 08:17:40,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:17:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:17:40,126 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:17:40,126 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:17:40,126 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294136697] [2021-06-05 08:17:40,126 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294136697] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:17:40,126 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:17:40,126 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 08:17:40,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911882387] [2021-06-05 08:17:40,127 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 08:17:40,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:17:40,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 08:17:40,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 08:17:40,127 INFO L87 Difference]: Start difference. First operand 251854 states and 790665 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:17:42,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:17:42,226 INFO L93 Difference]: Finished difference Result 280582 states and 865679 transitions. [2021-06-05 08:17:42,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 08:17:42,226 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 08:17:42,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:17:43,060 INFO L225 Difference]: With dead ends: 280582 [2021-06-05 08:17:43,060 INFO L226 Difference]: Without dead ends: 278366 [2021-06-05 08:17:43,060 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 71.4ms TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-06-05 08:17:44,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278366 states. [2021-06-05 08:17:49,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278366 to 207750. [2021-06-05 08:17:49,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207750 states, 207742 states have (on average 3.0916473317865427) internal successors, (642265), 207749 states have internal predecessors, (642265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:17:50,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207750 states to 207750 states and 642265 transitions. [2021-06-05 08:17:50,664 INFO L78 Accepts]: Start accepts. Automaton has 207750 states and 642265 transitions. Word has length 63 [2021-06-05 08:17:50,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:17:50,664 INFO L482 AbstractCegarLoop]: Abstraction has 207750 states and 642265 transitions. [2021-06-05 08:17:50,664 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:17:50,664 INFO L276 IsEmpty]: Start isEmpty. Operand 207750 states and 642265 transitions. [2021-06-05 08:17:50,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 08:17:50,687 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:17:50,687 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:17:50,687 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-06-05 08:17:50,687 INFO L430 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:17:50,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:17:50,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1559950079, now seen corresponding path program 2 times [2021-06-05 08:17:50,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:17:50,688 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906077104] [2021-06-05 08:17:50,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:17:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:17:50,764 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:17:50,764 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:17:50,764 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906077104] [2021-06-05 08:17:50,764 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906077104] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:17:50,764 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311466164] [2021-06-05 08:17:50,765 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:17:50,841 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 08:17:50,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:17:50,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 44 conjunts are in the unsatisfiable core [2021-06-05 08:17:50,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:17:50,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:17:50,855 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:17:50,858 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:17:50,858 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:17:50,858 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:17:50,871 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:17:50,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 08:17:50,872 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:17:50,875 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:17:50,875 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:17:50,875 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2021-06-05 08:17:50,911 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:17:50,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2021-06-05 08:17:50,912 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:17:50,916 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:17:50,916 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:17:50,917 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:15 [2021-06-05 08:17:50,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:17:50,938 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:17:50,943 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:17:50,944 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:17:50,944 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:15 [2021-06-05 08:17:51,004 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-06-05 08:17:51,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 18 [2021-06-05 08:17:51,005 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:17:51,011 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:17:51,012 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:17:51,012 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:25 [2021-06-05 08:17:51,052 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:17:51,052 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311466164] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:17:51,052 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:17:51,052 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 13 [2021-06-05 08:17:51,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169800300] [2021-06-05 08:17:51,052 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 08:17:51,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:17:51,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 08:17:51,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2021-06-05 08:17:51,053 INFO L87 Difference]: Start difference. First operand 207750 states and 642265 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:17:52,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:17:52,679 INFO L93 Difference]: Finished difference Result 212918 states and 655450 transitions. [2021-06-05 08:17:52,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 08:17:52,679 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 08:17:52,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:17:53,213 INFO L225 Difference]: With dead ends: 212918 [2021-06-05 08:17:53,213 INFO L226 Difference]: Without dead ends: 212798 [2021-06-05 08:17:53,214 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 144.6ms TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2021-06-05 08:17:53,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212798 states. [2021-06-05 08:17:57,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212798 to 203466. [2021-06-05 08:17:57,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203466 states, 203458 states have (on average 3.0975926235390103) internal successors, (630230), 203465 states have internal predecessors, (630230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:17:58,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203466 states to 203466 states and 630230 transitions. [2021-06-05 08:17:58,759 INFO L78 Accepts]: Start accepts. Automaton has 203466 states and 630230 transitions. Word has length 63 [2021-06-05 08:17:58,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:17:58,759 INFO L482 AbstractCegarLoop]: Abstraction has 203466 states and 630230 transitions. [2021-06-05 08:17:58,760 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:17:58,760 INFO L276 IsEmpty]: Start isEmpty. Operand 203466 states and 630230 transitions. [2021-06-05 08:17:58,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 08:17:58,816 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:17:58,816 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:17:59,016 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60 [2021-06-05 08:17:59,017 INFO L430 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:17:59,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:17:59,017 INFO L82 PathProgramCache]: Analyzing trace with hash 2023592423, now seen corresponding path program 3 times [2021-06-05 08:17:59,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:17:59,017 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539187877] [2021-06-05 08:17:59,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:17:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:17:59,093 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:17:59,093 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:17:59,093 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539187877] [2021-06-05 08:17:59,093 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539187877] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:17:59,093 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337213572] [2021-06-05 08:17:59,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:17:59,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 08:17:59,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:17:59,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 44 conjunts are in the unsatisfiable core [2021-06-05 08:17:59,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:17:59,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:17:59,184 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:17:59,187 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:17:59,187 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:17:59,188 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:17:59,200 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:17:59,200 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 08:17:59,202 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:17:59,204 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:17:59,205 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:17:59,205 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2021-06-05 08:17:59,240 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:17:59,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2021-06-05 08:17:59,242 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:17:59,245 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:17:59,246 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:17:59,246 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:15 [2021-06-05 08:17:59,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:17:59,266 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:17:59,271 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:17:59,271 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:17:59,271 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:15 [2021-06-05 08:17:59,320 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-06-05 08:17:59,320 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 18 [2021-06-05 08:17:59,321 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:17:59,327 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:17:59,328 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:17:59,328 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:25 [2021-06-05 08:17:59,387 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-06-05 08:17:59,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2021-06-05 08:17:59,389 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:17:59,401 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:17:59,428 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:17:59,428 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2021-06-05 08:17:59,455 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:17:59,455 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337213572] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:17:59,456 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:17:59,456 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 14 [2021-06-05 08:17:59,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898316808] [2021-06-05 08:17:59,456 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 08:17:59,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:17:59,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 08:17:59,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-06-05 08:17:59,456 INFO L87 Difference]: Start difference. First operand 203466 states and 630230 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:18:00,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:18:00,507 INFO L93 Difference]: Finished difference Result 211138 states and 650492 transitions. [2021-06-05 08:18:00,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 08:18:00,508 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 08:18:00,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:18:01,646 INFO L225 Difference]: With dead ends: 211138 [2021-06-05 08:18:01,646 INFO L226 Difference]: Without dead ends: 211138 [2021-06-05 08:18:01,646 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 179.3ms TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2021-06-05 08:18:02,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211138 states. [2021-06-05 08:18:05,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211138 to 203184. [2021-06-05 08:18:05,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203184 states, 203176 states have (on average 3.0976936252313267) internal successors, (629377), 203183 states have internal predecessors, (629377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:18:06,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203184 states to 203184 states and 629377 transitions. [2021-06-05 08:18:06,548 INFO L78 Accepts]: Start accepts. Automaton has 203184 states and 629377 transitions. Word has length 63 [2021-06-05 08:18:06,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:18:06,548 INFO L482 AbstractCegarLoop]: Abstraction has 203184 states and 629377 transitions. [2021-06-05 08:18:06,548 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:18:06,548 INFO L276 IsEmpty]: Start isEmpty. Operand 203184 states and 629377 transitions. [2021-06-05 08:18:06,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 08:18:06,586 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:18:06,586 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:18:06,788 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:18:06,791 INFO L430 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:18:06,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:18:06,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1377036440, now seen corresponding path program 1 times [2021-06-05 08:18:06,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:18:06,791 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936804570] [2021-06-05 08:18:06,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:18:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:18:06,849 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:18:06,849 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:18:06,850 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936804570] [2021-06-05 08:18:06,850 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936804570] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:18:06,850 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:18:06,850 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 08:18:06,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230294367] [2021-06-05 08:18:06,850 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 08:18:06,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:18:06,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 08:18:06,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 08:18:06,851 INFO L87 Difference]: Start difference. First operand 203184 states and 629377 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:18:08,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:18:08,600 INFO L93 Difference]: Finished difference Result 254572 states and 782842 transitions. [2021-06-05 08:18:08,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 08:18:08,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-06-05 08:18:08,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:18:09,255 INFO L225 Difference]: With dead ends: 254572 [2021-06-05 08:18:09,255 INFO L226 Difference]: Without dead ends: 254572 [2021-06-05 08:18:09,256 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 49.5ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 08:18:10,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254572 states. [2021-06-05 08:18:14,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254572 to 245716. [2021-06-05 08:18:14,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245716 states, 245708 states have (on average 3.0869405961547853) internal successors, (758486), 245715 states have internal predecessors, (758486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:18:16,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245716 states to 245716 states and 758486 transitions. [2021-06-05 08:18:16,223 INFO L78 Accepts]: Start accepts. Automaton has 245716 states and 758486 transitions. Word has length 68 [2021-06-05 08:18:16,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:18:16,223 INFO L482 AbstractCegarLoop]: Abstraction has 245716 states and 758486 transitions. [2021-06-05 08:18:16,224 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:18:16,224 INFO L276 IsEmpty]: Start isEmpty. Operand 245716 states and 758486 transitions. [2021-06-05 08:18:16,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-06-05 08:18:16,275 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:18:16,275 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:18:16,275 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-06-05 08:18:16,275 INFO L430 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:18:16,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:18:16,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1719112151, now seen corresponding path program 1 times [2021-06-05 08:18:16,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:18:16,275 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735465929] [2021-06-05 08:18:16,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:18:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:18:16,375 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:18:16,375 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:18:16,375 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735465929] [2021-06-05 08:18:16,375 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735465929] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:18:16,375 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418864055] [2021-06-05 08:18:16,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:18:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:18:16,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 08:18:16,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:18:16,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:18:16,484 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:18:16,487 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:18:16,487 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:18:16,487 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:18:16,524 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:18:16,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:18:16,526 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:18:16,531 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:18:16,533 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:18:16,533 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:18:16,669 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:18:16,670 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 08:18:16,672 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:18:16,679 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:18:16,680 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:18:16,680 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2021-06-05 08:18:16,718 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:18:16,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2021-06-05 08:18:16,720 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:18:16,725 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:18:16,726 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:18:16,726 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:18 [2021-06-05 08:18:16,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2021-06-05 08:18:16,755 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:18:16,761 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:18:16,761 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:18:16,761 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:25 [2021-06-05 08:18:16,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2021-06-05 08:18:16,808 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:18:16,818 INFO L628 ElimStorePlain]: treesize reduction 4, result has 84.0 percent of original size [2021-06-05 08:18:16,819 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:18:16,819 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2021-06-05 08:18:16,864 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:18:16,864 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418864055] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:18:16,864 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:18:16,864 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2021-06-05 08:18:16,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187821205] [2021-06-05 08:18:16,865 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 08:18:16,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:18:16,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 08:18:16,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2021-06-05 08:18:16,865 INFO L87 Difference]: Start difference. First operand 245716 states and 758486 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:18:18,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:18:18,918 INFO L93 Difference]: Finished difference Result 319770 states and 975346 transitions. [2021-06-05 08:18:18,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 08:18:18,919 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-06-05 08:18:18,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:18:19,720 INFO L225 Difference]: With dead ends: 319770 [2021-06-05 08:18:19,720 INFO L226 Difference]: Without dead ends: 319770 [2021-06-05 08:18:19,720 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 239.9ms TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2021-06-05 08:18:20,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319770 states. [2021-06-05 08:18:26,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319770 to 271994. [2021-06-05 08:18:26,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271994 states, 271986 states have (on average 3.069231504562735) internal successors, (834788), 271993 states have internal predecessors, (834788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:18:27,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271994 states to 271994 states and 834788 transitions. [2021-06-05 08:18:27,735 INFO L78 Accepts]: Start accepts. Automaton has 271994 states and 834788 transitions. Word has length 70 [2021-06-05 08:18:27,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:18:27,735 INFO L482 AbstractCegarLoop]: Abstraction has 271994 states and 834788 transitions. [2021-06-05 08:18:27,735 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:18:27,735 INFO L276 IsEmpty]: Start isEmpty. Operand 271994 states and 834788 transitions. [2021-06-05 08:18:27,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-06-05 08:18:27,781 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:18:27,781 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:18:27,981 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:18:27,982 INFO L430 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:18:27,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:18:27,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1727197378, now seen corresponding path program 1 times [2021-06-05 08:18:27,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:18:27,982 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516318534] [2021-06-05 08:18:27,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:18:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:18:28,122 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:18:28,123 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:18:28,123 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516318534] [2021-06-05 08:18:28,123 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516318534] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:18:28,123 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352540575] [2021-06-05 08:18:28,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:18:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:18:28,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 44 conjunts are in the unsatisfiable core [2021-06-05 08:18:28,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:18:28,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:18:28,214 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:18:28,216 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:18:28,217 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:18:28,217 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:18:28,258 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:18:28,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:18:28,260 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:18:28,265 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:18:28,266 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:18:28,266 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:18:29,234 INFO L354 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2021-06-05 08:18:29,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2021-06-05 08:18:29,236 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:18:29,243 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:18:29,245 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:18:29,245 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:23 [2021-06-05 08:18:29,323 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:18:29,323 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 08:18:29,325 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:18:29,332 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:18:29,333 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:18:29,334 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2021-06-05 08:18:29,376 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:18:29,376 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2021-06-05 08:18:29,377 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:18:29,382 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:18:29,383 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:18:29,383 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:18 [2021-06-05 08:18:29,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2021-06-05 08:18:29,409 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:18:29,415 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:18:29,415 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:18:29,415 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:25 [2021-06-05 08:18:29,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2021-06-05 08:18:29,469 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:18:29,479 INFO L628 ElimStorePlain]: treesize reduction 4, result has 84.0 percent of original size [2021-06-05 08:18:29,479 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:18:29,479 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2021-06-05 08:18:29,543 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:18:29,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2021-06-05 08:18:29,544 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:18:29,548 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:18:29,549 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:18:29,549 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2021-06-05 08:18:29,567 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:18:29,567 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352540575] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:18:29,567 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:18:29,567 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 21 [2021-06-05 08:18:29,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255899117] [2021-06-05 08:18:29,568 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 08:18:29,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:18:29,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 08:18:29,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2021-06-05 08:18:29,568 INFO L87 Difference]: Start difference. First operand 271994 states and 834788 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:18:31,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:18:31,837 INFO L93 Difference]: Finished difference Result 319780 states and 974936 transitions. [2021-06-05 08:18:31,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 08:18:31,838 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-06-05 08:18:31,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:18:32,677 INFO L225 Difference]: With dead ends: 319780 [2021-06-05 08:18:32,677 INFO L226 Difference]: Without dead ends: 319780 [2021-06-05 08:18:32,678 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 377.7ms TimeCoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2021-06-05 08:18:33,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319780 states. [2021-06-05 08:18:39,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319780 to 279088. [2021-06-05 08:18:39,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279088 states, 279080 states have (on average 3.065529597248101) internal successors, (855528), 279087 states have internal predecessors, (855528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:18:41,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279088 states to 279088 states and 855528 transitions. [2021-06-05 08:18:41,533 INFO L78 Accepts]: Start accepts. Automaton has 279088 states and 855528 transitions. Word has length 70 [2021-06-05 08:18:41,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:18:41,534 INFO L482 AbstractCegarLoop]: Abstraction has 279088 states and 855528 transitions. [2021-06-05 08:18:41,534 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:18:41,534 INFO L276 IsEmpty]: Start isEmpty. Operand 279088 states and 855528 transitions. [2021-06-05 08:18:41,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-06-05 08:18:41,592 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:18:41,593 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:18:41,808 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2021-06-05 08:18:41,809 INFO L430 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:18:41,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:18:41,809 INFO L82 PathProgramCache]: Analyzing trace with hash -535679580, now seen corresponding path program 2 times [2021-06-05 08:18:41,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:18:41,809 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636879472] [2021-06-05 08:18:41,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:18:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:18:42,043 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:18:42,043 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:18:42,043 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636879472] [2021-06-05 08:18:42,044 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636879472] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:18:42,044 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516413284] [2021-06-05 08:18:42,044 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:18:42,129 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 08:18:42,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:18:42,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 47 conjunts are in the unsatisfiable core [2021-06-05 08:18:42,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:18:42,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:18:42,153 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:18:42,156 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:18:42,156 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:18:42,157 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:18:42,195 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:18:42,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:18:42,197 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:18:42,203 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:18:42,207 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:18:42,207 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:18:42,363 INFO L354 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2021-06-05 08:18:42,364 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2021-06-05 08:18:42,365 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:18:42,372 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:18:42,374 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:18:42,374 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:23 [2021-06-05 08:18:42,437 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:18:42,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2021-06-05 08:18:42,438 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:18:42,445 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:18:42,448 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:18:42,448 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:53, output treesize:25 [2021-06-05 08:18:42,505 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:18:42,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 08:18:42,507 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:18:42,515 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:18:42,517 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:18:42,517 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:18 [2021-06-05 08:18:42,545 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2021-06-05 08:18:42,546 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:18:42,553 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:18:42,554 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:18:42,554 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:25 [2021-06-05 08:18:42,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2021-06-05 08:18:42,639 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:18:42,651 INFO L628 ElimStorePlain]: treesize reduction 4, result has 84.0 percent of original size [2021-06-05 08:18:42,652 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:18:42,652 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2021-06-05 08:18:42,704 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:18:42,705 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516413284] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:18:42,705 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:18:42,705 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 20 [2021-06-05 08:18:42,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62985298] [2021-06-05 08:18:42,705 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 08:18:42,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:18:42,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 08:18:42,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2021-06-05 08:18:42,706 INFO L87 Difference]: Start difference. First operand 279088 states and 855528 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:18:45,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:18:45,135 INFO L93 Difference]: Finished difference Result 290452 states and 890350 transitions. [2021-06-05 08:18:45,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 08:18:45,136 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-06-05 08:18:45,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:18:46,188 INFO L225 Difference]: With dead ends: 290452 [2021-06-05 08:18:46,188 INFO L226 Difference]: Without dead ends: 290452 [2021-06-05 08:18:46,189 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 340.6ms TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2021-06-05 08:18:47,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290452 states. [2021-06-05 08:18:52,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290452 to 282480. [2021-06-05 08:18:53,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282480 states, 282472 states have (on average 3.0673057860602113) internal successors, (866428), 282479 states have internal predecessors, (866428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:18:54,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282480 states to 282480 states and 866428 transitions. [2021-06-05 08:18:54,105 INFO L78 Accepts]: Start accepts. Automaton has 282480 states and 866428 transitions. Word has length 70 [2021-06-05 08:18:54,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:18:54,105 INFO L482 AbstractCegarLoop]: Abstraction has 282480 states and 866428 transitions. [2021-06-05 08:18:54,105 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:18:54,105 INFO L276 IsEmpty]: Start isEmpty. Operand 282480 states and 866428 transitions. [2021-06-05 08:18:54,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-06-05 08:18:54,149 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:18:54,149 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:18:54,349 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:18:54,350 INFO L430 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:18:54,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:18:54,350 INFO L82 PathProgramCache]: Analyzing trace with hash 590511182, now seen corresponding path program 3 times [2021-06-05 08:18:54,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:18:54,350 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469632052] [2021-06-05 08:18:54,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:18:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:18:54,546 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:18:54,546 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:18:54,546 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469632052] [2021-06-05 08:18:54,546 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469632052] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:18:54,546 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960485821] [2021-06-05 08:18:54,546 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:18:54,623 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 08:18:54,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:18:54,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 50 conjunts are in the unsatisfiable core [2021-06-05 08:18:54,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:18:54,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:18:54,638 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:18:54,640 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:18:54,641 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:18:54,641 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:18:54,661 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:18:54,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:18:54,663 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:18:54,667 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:18:54,668 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:18:54,668 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:18:55,666 INFO L354 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2021-06-05 08:18:55,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2021-06-05 08:18:55,668 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:18:55,674 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:18:55,676 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:18:55,676 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:26 [2021-06-05 08:18:55,735 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:18:55,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2021-06-05 08:18:55,737 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:18:55,745 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:18:55,746 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:18:55,746 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:61, output treesize:33 [2021-06-05 08:18:55,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 08:18:55,873 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 08:18:55,875 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:18:55,882 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:18:55,884 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:18:55,884 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:29 [2021-06-05 08:18:55,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 08:18:55,943 INFO L354 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2021-06-05 08:18:55,943 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 14 [2021-06-05 08:18:55,945 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:18:55,953 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:18:55,954 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:18:55,954 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:26 [2021-06-05 08:18:56,007 INFO L354 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2021-06-05 08:18:56,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 33 [2021-06-05 08:18:56,010 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:18:56,019 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:18:56,023 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:18:56,023 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:25 [2021-06-05 08:18:56,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2021-06-05 08:18:56,083 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:18:56,093 INFO L628 ElimStorePlain]: treesize reduction 4, result has 84.0 percent of original size [2021-06-05 08:18:56,094 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:18:56,094 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2021-06-05 08:18:56,159 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:18:56,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2021-06-05 08:18:56,160 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:18:56,163 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:18:56,164 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:18:56,164 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2021-06-05 08:18:56,186 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:18:56,186 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960485821] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:18:56,186 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:18:56,186 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [16] total 27 [2021-06-05 08:18:56,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431905810] [2021-06-05 08:18:56,186 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 08:18:56,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:18:56,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 08:18:56,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2021-06-05 08:18:56,187 INFO L87 Difference]: Start difference. First operand 282480 states and 866428 transitions. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:58,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:19:58,829 INFO L93 Difference]: Finished difference Result 456492 states and 1393202 transitions. [2021-06-05 08:19:58,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-06-05 08:19:58,830 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-06-05 08:19:58,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:20:00,064 INFO L225 Difference]: With dead ends: 456492 [2021-06-05 08:20:00,064 INFO L226 Difference]: Without dead ends: 456492 [2021-06-05 08:20:00,064 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 1139.3ms TimeCoverageRelationStatistics Valid=511, Invalid=2911, Unknown=0, NotChecked=0, Total=3422 [2021-06-05 08:20:01,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456492 states. [2021-06-05 08:20:08,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456492 to 303854. [2021-06-05 08:20:08,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303854 states, 303846 states have (on average 3.0647005390888804) internal successors, (931197), 303853 states have internal predecessors, (931197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:20:09,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303854 states to 303854 states and 931197 transitions. [2021-06-05 08:20:09,698 INFO L78 Accepts]: Start accepts. Automaton has 303854 states and 931197 transitions. Word has length 70 [2021-06-05 08:20:09,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:20:09,699 INFO L482 AbstractCegarLoop]: Abstraction has 303854 states and 931197 transitions. [2021-06-05 08:20:09,699 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:20:09,699 INFO L276 IsEmpty]: Start isEmpty. Operand 303854 states and 931197 transitions. [2021-06-05 08:20:09,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-06-05 08:20:09,748 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:20:09,748 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:20:09,952 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2021-06-05 08:20:09,953 INFO L430 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:20:09,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:20:09,953 INFO L82 PathProgramCache]: Analyzing trace with hash 750021941, now seen corresponding path program 2 times [2021-06-05 08:20:09,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:20:09,953 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365294483] [2021-06-05 08:20:09,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:20:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:20:10,094 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:20:10,094 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:20:10,094 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365294483] [2021-06-05 08:20:10,094 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365294483] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:20:10,094 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382385784] [2021-06-05 08:20:10,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:20:10,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 08:20:10,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:20:10,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 08:20:10,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:20:10,171 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:20:10,172 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:10,175 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:10,175 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:20:10,175 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:20:10,209 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:20:10,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:20:10,210 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:10,215 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:10,216 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:20:10,216 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:20:10,345 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:20:10,345 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 08:20:10,346 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:10,354 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:10,358 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:20:10,359 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:31 [2021-06-05 08:20:11,227 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:20:11,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2021-06-05 08:20:11,228 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:11,241 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:11,245 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:20:11,245 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:66, output treesize:38 [2021-06-05 08:20:11,352 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-05 08:20:11,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2021-06-05 08:20:11,355 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:11,368 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:11,369 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:20:11,369 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:18 [2021-06-05 08:20:11,398 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2021-06-05 08:20:11,399 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:11,406 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:11,407 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:20:11,407 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:25 [2021-06-05 08:20:11,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2021-06-05 08:20:11,465 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:11,477 INFO L628 ElimStorePlain]: treesize reduction 4, result has 84.0 percent of original size [2021-06-05 08:20:11,478 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:20:11,478 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2021-06-05 08:20:11,546 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:20:11,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2021-06-05 08:20:11,547 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:11,552 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:11,553 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:20:11,553 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2021-06-05 08:20:11,575 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:20:11,575 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382385784] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:20:11,576 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:20:11,576 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 22 [2021-06-05 08:20:11,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906691482] [2021-06-05 08:20:11,576 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 08:20:11,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:20:11,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 08:20:11,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2021-06-05 08:20:11,577 INFO L87 Difference]: Start difference. First operand 303854 states and 931197 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:20:13,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:20:13,813 INFO L93 Difference]: Finished difference Result 321882 states and 985637 transitions. [2021-06-05 08:20:13,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 08:20:13,814 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-06-05 08:20:13,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:20:14,688 INFO L225 Difference]: With dead ends: 321882 [2021-06-05 08:20:14,689 INFO L226 Difference]: Without dead ends: 321882 [2021-06-05 08:20:14,689 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 384.4ms TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2021-06-05 08:20:15,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321882 states. [2021-06-05 08:20:21,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321882 to 304334. [2021-06-05 08:20:21,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304334 states, 304326 states have (on average 3.0647167839750793) internal successors, (932673), 304333 states have internal predecessors, (932673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:20:22,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304334 states to 304334 states and 932673 transitions. [2021-06-05 08:20:22,948 INFO L78 Accepts]: Start accepts. Automaton has 304334 states and 932673 transitions. Word has length 70 [2021-06-05 08:20:22,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:20:22,948 INFO L482 AbstractCegarLoop]: Abstraction has 304334 states and 932673 transitions. [2021-06-05 08:20:22,948 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:20:22,948 INFO L276 IsEmpty]: Start isEmpty. Operand 304334 states and 932673 transitions. [2021-06-05 08:20:22,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-06-05 08:20:22,999 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:20:22,999 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:20:23,200 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2021-06-05 08:20:23,201 INFO L430 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:20:23,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:20:23,201 INFO L82 PathProgramCache]: Analyzing trace with hash -216527897, now seen corresponding path program 3 times [2021-06-05 08:20:23,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:20:23,201 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778631492] [2021-06-05 08:20:23,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:20:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:20:23,403 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:20:23,403 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:20:23,403 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778631492] [2021-06-05 08:20:23,403 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778631492] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:20:23,403 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974155801] [2021-06-05 08:20:23,404 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:20:23,477 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 08:20:23,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:20:23,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 50 conjunts are in the unsatisfiable core [2021-06-05 08:20:23,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:20:23,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:20:23,491 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:23,494 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:23,495 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:20:23,495 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:20:23,514 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:20:23,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:20:23,516 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:23,521 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:23,522 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:20:23,522 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:20:24,504 INFO L354 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2021-06-05 08:20:24,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2021-06-05 08:20:24,506 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:24,513 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:24,514 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:20:24,514 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:26 [2021-06-05 08:20:24,564 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:20:24,565 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2021-06-05 08:20:24,566 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:24,574 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:24,576 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:20:24,576 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:61, output treesize:33 [2021-06-05 08:20:24,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 08:20:24,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 08:20:24,694 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:24,700 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:24,701 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:20:24,701 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:29 [2021-06-05 08:20:24,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 08:20:24,753 INFO L354 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2021-06-05 08:20:24,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 14 [2021-06-05 08:20:24,755 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:24,761 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:24,762 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:20:24,762 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:26 [2021-06-05 08:20:24,830 INFO L354 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2021-06-05 08:20:24,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 33 [2021-06-05 08:20:24,833 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:24,844 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:24,845 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:20:24,845 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:25 [2021-06-05 08:20:24,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2021-06-05 08:20:24,892 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:24,903 INFO L628 ElimStorePlain]: treesize reduction 4, result has 84.0 percent of original size [2021-06-05 08:20:24,903 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:20:24,903 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2021-06-05 08:20:24,969 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:20:24,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2021-06-05 08:20:24,973 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:24,977 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:24,978 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:20:24,978 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2021-06-05 08:20:25,000 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:20:25,001 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974155801] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:20:25,001 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:20:25,001 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [16] total 27 [2021-06-05 08:20:25,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430537258] [2021-06-05 08:20:25,001 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 08:20:25,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:20:25,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 08:20:25,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2021-06-05 08:20:25,001 INFO L87 Difference]: Start difference. First operand 304334 states and 932673 transitions. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2021-06-05 08:21:13,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-06-05 08:21:13,609 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:21:13,609 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 08:21:13,609 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT (1/2) [2021-06-05 08:21:13,610 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 08:21:13,611 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 08:21:13,611 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 08:21:13,611 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 08:21:13,611 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 08:21:13,611 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 08:21:13,611 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 08:21:13,611 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 08:21:13,611 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 08:21:13,619 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 126 places, 138 transitions, 288 flow [2021-06-05 08:21:13,619 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 08:21:13,619 INFO L315 ceAbstractionStarter]: Result for error location InUseError was TIMEOUT (2/2) [2021-06-05 08:21:13,619 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2021-06-05 08:21:13,621 WARN L196 ceAbstractionStarter]: Timeout [2021-06-05 08:21:13,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 08:21:13 BasicIcfg [2021-06-05 08:21:13,621 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 08:21:13,622 INFO L168 Benchmark]: Toolchain (without parser) took 651140.95 ms. Allocated memory was 369.1 MB in the beginning and 16.0 GB in the end (delta: 15.6 GB). Free memory was 331.6 MB in the beginning and 9.3 GB in the end (delta: -8.9 GB). Peak memory consumption was 6.7 GB. Max. memory is 16.0 GB. [2021-06-05 08:21:13,622 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 369.1 MB. Free memory is still 349.4 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 08:21:13,622 INFO L168 Benchmark]: CACSL2BoogieTranslator took 522.77 ms. Allocated memory is still 369.1 MB. Free memory was 331.3 MB in the beginning and 331.4 MB in the end (delta: -125.4 kB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. [2021-06-05 08:21:13,622 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.95 ms. Allocated memory is still 369.1 MB. Free memory was 331.4 MB in the beginning and 329.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 08:21:13,622 INFO L168 Benchmark]: Boogie Preprocessor took 34.13 ms. Allocated memory is still 369.1 MB. Free memory was 329.4 MB in the beginning and 328.4 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 08:21:13,622 INFO L168 Benchmark]: RCFGBuilder took 626.12 ms. Allocated memory is still 369.1 MB. Free memory was 328.4 MB in the beginning and 291.7 MB in the end (delta: 36.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.0 GB. [2021-06-05 08:21:13,622 INFO L168 Benchmark]: TraceAbstraction took 649894.54 ms. Allocated memory was 369.1 MB in the beginning and 16.0 GB in the end (delta: 15.6 GB). Free memory was 290.6 MB in the beginning and 9.3 GB in the end (delta: -9.0 GB). Peak memory consumption was 6.7 GB. Max. memory is 16.0 GB. [2021-06-05 08:21:13,623 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 369.1 MB. Free memory is still 349.4 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 522.77 ms. Allocated memory is still 369.1 MB. Free memory was 331.3 MB in the beginning and 331.4 MB in the end (delta: -125.4 kB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 57.95 ms. Allocated memory is still 369.1 MB. Free memory was 331.4 MB in the beginning and 329.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 34.13 ms. Allocated memory is still 369.1 MB. Free memory was 329.4 MB in the beginning and 328.4 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 626.12 ms. Allocated memory is still 369.1 MB. Free memory was 328.4 MB in the beginning and 291.7 MB in the end (delta: 36.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 649894.54 ms. Allocated memory was 369.1 MB in the beginning and 16.0 GB in the end (delta: 15.6 GB). Free memory was 290.6 MB in the beginning and 9.3 GB in the end (delta: -9.0 GB). Peak memory consumption was 6.7 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 702]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (304334states) and FLOYD_HOARE automaton (currently 41 states, 14 states before enhancement),while ReachableStatesComputation was computing reachable states (99073 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 705]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (304334states) and FLOYD_HOARE automaton (currently 41 states, 14 states before enhancement),while ReachableStatesComputation was computing reachable states (99073 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 712]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (304334states) and FLOYD_HOARE automaton (currently 41 states, 14 states before enhancement),while ReachableStatesComputation was computing reachable states (99073 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 719]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing initial abstraction,while PetriNet2FiniteAutomaton was constructing automaton for Petri net that has has 126 places, 138 transitions, 288 flow. Already constructed 2 states. Currently 1 states in worklist.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 122 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5080.8ms, OverallIterations: 8, TraceHistogramMax: 2, EmptinessCheckTime: 33.2ms, AutomataDifference: 1441.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 52.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 585 SDtfs, 920 SDslu, 1799 SDs, 0 SdLazy, 630 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 488.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 229 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1264.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=647occurred in iteration=0, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 121.9ms AutomataMinimizationTime, 8 MinimizatonAttempts, 388 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 70.4ms SsaConstructionTime, 230.0ms SatisfiabilityAnalysisTime, 2163.8ms InterpolantComputationTime, 487 NumberOfCodeBlocks, 480 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 476 ConstructedInterpolants, 2 QuantifiedInterpolants, 2592 SizeOfPredicates, 47 NumberOfNonLiveVariables, 356 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 40/44 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 170 locations, 10 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 644554.4ms, OverallIterations: 60, TraceHistogramMax: 3, EmptinessCheckTime: 1361.3ms, AutomataDifference: 313540.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1953.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 22204 SDtfs, 60329 SDslu, 159953 SDs, 0 SdLazy, 55612 SolverSat, 5446 SolverUnsat, 60 SolverUnknown, 0 SolverNotchecked, 151124.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3847 GetRequests, 1313 SyntacticMatches, 12 SemanticMatches, 2522 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57799 ImplicationChecksByTransitivity, 58710.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=332822occurred in iteration=48, InterpolantAutomatonStates: 2128, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 290265.2ms AutomataMinimizationTime, 59 MinimizatonAttempts, 2894173 StatesRemovedByMinimization, 58 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 428.6ms SsaConstructionTime, 882.0ms SatisfiabilityAnalysisTime, 29383.6ms InterpolantComputationTime, 4534 NumberOfCodeBlocks, 4360 NumberOfCodeBlocksAsserted, 90 NumberOfCheckSat, 4450 ConstructedInterpolants, 197 QuantifiedInterpolants, 46311 SizeOfPredicates, 529 NumberOfNonLiveVariables, 3608 ConjunctsInSsa, 1025 ConjunctsInUnsatCore, 84 InterpolantComputations, 48 PerfectInterpolantSequences, 662/741 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 3 procedures, 122 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 60.3ms, OverallIterations: 1, TraceHistogramMax: 2, EmptinessCheckTime: 1.3ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 13.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=647occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9ms SsaConstructionTime, 6.1ms SatisfiabilityAnalysisTime, 0.0ms InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 4 procedures, 170 locations, 10 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 8.4ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown