/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_7.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 00:59:33,512 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 00:59:33,515 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 00:59:33,557 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 00:59:33,558 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 00:59:33,562 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 00:59:33,566 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 00:59:33,573 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 00:59:33,576 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 00:59:33,580 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 00:59:33,586 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 00:59:33,587 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 00:59:33,587 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 00:59:33,590 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 00:59:33,592 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 00:59:33,594 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 00:59:33,595 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 00:59:33,601 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 00:59:33,604 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 00:59:33,611 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 00:59:33,613 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 00:59:33,614 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 00:59:33,616 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 00:59:33,619 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 00:59:33,626 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 00:59:33,627 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 00:59:33,627 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 00:59:33,628 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 00:59:33,629 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 00:59:33,634 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 00:59:33,634 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 00:59:33,635 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 00:59:33,637 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 00:59:33,638 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 00:59:33,639 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 00:59:33,640 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 00:59:33,651 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 00:59:33,652 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 00:59:33,652 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 00:59:33,653 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 00:59:33,656 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 00:59:33,658 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 00:59:33,674 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 00:59:33,674 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 00:59:33,680 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 00:59:33,680 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 00:59:33,680 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 00:59:33,680 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 00:59:33,681 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 00:59:33,681 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 00:59:33,681 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 00:59:33,681 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 00:59:33,682 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 00:59:33,683 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 00:59:33,683 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 00:59:33,683 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 00:59:33,684 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 00:59:33,684 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 00:59:33,685 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 00:59:33,685 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 00:59:33,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:59:33,685 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 00:59:33,685 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 00:59:33,685 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 00:59:33,686 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-10-24 00:59:34,057 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 00:59:34,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 00:59:34,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 00:59:34,112 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 00:59:34,113 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 00:59:34,114 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2020-10-24 00:59:34,197 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/878967c83/1930daa099ff49cf81c7984c7bdbdf05/FLAGebe755679 [2020-10-24 00:59:34,815 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 00:59:34,815 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2020-10-24 00:59:34,824 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/878967c83/1930daa099ff49cf81c7984c7bdbdf05/FLAGebe755679 [2020-10-24 00:59:35,190 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/878967c83/1930daa099ff49cf81c7984c7bdbdf05 [2020-10-24 00:59:35,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 00:59:35,204 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 00:59:35,208 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 00:59:35,209 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 00:59:35,213 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 00:59:35,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:59:35" (1/1) ... [2020-10-24 00:59:35,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c41f4cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:59:35, skipping insertion in model container [2020-10-24 00:59:35,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:59:35" (1/1) ... [2020-10-24 00:59:35,227 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 00:59:35,255 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 00:59:35,448 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:59:35,459 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 00:59:35,485 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:59:35,499 INFO L208 MainTranslator]: Completed translation [2020-10-24 00:59:35,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:59:35 WrapperNode [2020-10-24 00:59:35,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 00:59:35,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 00:59:35,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 00:59:35,501 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 00:59:35,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:59:35" (1/1) ... [2020-10-24 00:59:35,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:59:35" (1/1) ... [2020-10-24 00:59:35,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:59:35" (1/1) ... [2020-10-24 00:59:35,521 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:59:35" (1/1) ... [2020-10-24 00:59:35,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:59:35" (1/1) ... [2020-10-24 00:59:35,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:59:35" (1/1) ... [2020-10-24 00:59:35,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:59:35" (1/1) ... [2020-10-24 00:59:35,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 00:59:35,548 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 00:59:35,549 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 00:59:35,549 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 00:59:35,550 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:59:35" (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 [2020-10-24 00:59:35,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 00:59:35,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 00:59:35,629 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 00:59:35,629 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 00:59:35,629 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 00:59:35,630 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 00:59:35,630 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 00:59:35,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 00:59:35,630 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 00:59:35,630 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 00:59:35,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 00:59:35,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 00:59:35,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 00:59:35,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 00:59:35,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 00:59:35,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 00:59:36,014 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 00:59:36,015 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-24 00:59:36,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:59:36 BoogieIcfgContainer [2020-10-24 00:59:36,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 00:59:36,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 00:59:36,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 00:59:36,024 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 00:59:36,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:59:35" (1/3) ... [2020-10-24 00:59:36,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36809dc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:59:36, skipping insertion in model container [2020-10-24 00:59:36,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:59:35" (2/3) ... [2020-10-24 00:59:36,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36809dc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:59:36, skipping insertion in model container [2020-10-24 00:59:36,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:59:36" (3/3) ... [2020-10-24 00:59:36,027 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2020-10-24 00:59:36,040 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 00:59:36,045 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 00:59:36,064 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 00:59:36,115 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 00:59:36,116 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 00:59:36,116 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 00:59:36,119 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 00:59:36,119 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 00:59:36,119 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 00:59:36,120 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 00:59:36,120 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 00:59:36,157 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states. [2020-10-24 00:59:36,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-10-24 00:59:36,176 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:36,178 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:59:36,179 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:36,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:36,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1602311135, now seen corresponding path program 1 times [2020-10-24 00:59:36,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:36,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [615598994] [2020-10-24 00:59:36,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:36,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:36,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:36,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:36,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [615598994] [2020-10-24 00:59:36,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:36,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:36,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379157988] [2020-10-24 00:59:36,710 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:36,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:36,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:36,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:36,735 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 4 states. [2020-10-24 00:59:37,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:37,161 INFO L93 Difference]: Finished difference Result 203 states and 274 transitions. [2020-10-24 00:59:37,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:37,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2020-10-24 00:59:37,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:37,178 INFO L225 Difference]: With dead ends: 203 [2020-10-24 00:59:37,178 INFO L226 Difference]: Without dead ends: 136 [2020-10-24 00:59:37,182 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 00:59:37,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-10-24 00:59:37,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2020-10-24 00:59:37,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-10-24 00:59:37,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 173 transitions. [2020-10-24 00:59:37,264 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 173 transitions. Word has length 64 [2020-10-24 00:59:37,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:59:37,265 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 173 transitions. [2020-10-24 00:59:37,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:59:37,265 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 173 transitions. [2020-10-24 00:59:37,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-10-24 00:59:37,268 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:37,268 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:59:37,269 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 00:59:37,269 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:37,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:37,270 INFO L82 PathProgramCache]: Analyzing trace with hash 179683855, now seen corresponding path program 1 times [2020-10-24 00:59:37,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:37,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1627479588] [2020-10-24 00:59:37,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:37,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:37,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:37,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:37,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1627479588] [2020-10-24 00:59:37,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:37,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:37,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62715811] [2020-10-24 00:59:37,393 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:37,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:37,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:37,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:37,394 INFO L87 Difference]: Start difference. First operand 135 states and 173 transitions. Second operand 4 states. [2020-10-24 00:59:37,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:37,694 INFO L93 Difference]: Finished difference Result 163 states and 212 transitions. [2020-10-24 00:59:37,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:37,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2020-10-24 00:59:37,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:37,697 INFO L225 Difference]: With dead ends: 163 [2020-10-24 00:59:37,697 INFO L226 Difference]: Without dead ends: 160 [2020-10-24 00:59:37,698 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 00:59:37,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-10-24 00:59:37,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 135. [2020-10-24 00:59:37,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-10-24 00:59:37,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 172 transitions. [2020-10-24 00:59:37,733 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 172 transitions. Word has length 65 [2020-10-24 00:59:37,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:59:37,733 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 172 transitions. [2020-10-24 00:59:37,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:59:37,734 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 172 transitions. [2020-10-24 00:59:37,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-10-24 00:59:37,735 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:37,736 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:59:37,736 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 00:59:37,736 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:37,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:37,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1875549338, now seen corresponding path program 1 times [2020-10-24 00:59:37,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:37,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [864336298] [2020-10-24 00:59:37,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:37,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:37,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:37,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [864336298] [2020-10-24 00:59:37,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:37,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:37,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721091848] [2020-10-24 00:59:37,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:37,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:37,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:37,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:37,892 INFO L87 Difference]: Start difference. First operand 135 states and 172 transitions. Second operand 4 states. [2020-10-24 00:59:38,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:38,191 INFO L93 Difference]: Finished difference Result 315 states and 425 transitions. [2020-10-24 00:59:38,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:38,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2020-10-24 00:59:38,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:38,199 INFO L225 Difference]: With dead ends: 315 [2020-10-24 00:59:38,199 INFO L226 Difference]: Without dead ends: 221 [2020-10-24 00:59:38,201 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 00:59:38,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2020-10-24 00:59:38,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2020-10-24 00:59:38,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-10-24 00:59:38,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 289 transitions. [2020-10-24 00:59:38,288 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 289 transitions. Word has length 65 [2020-10-24 00:59:38,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:59:38,289 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 289 transitions. [2020-10-24 00:59:38,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:59:38,290 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 289 transitions. [2020-10-24 00:59:38,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-10-24 00:59:38,300 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:38,301 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:59:38,301 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 00:59:38,302 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:38,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:38,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1979914163, now seen corresponding path program 1 times [2020-10-24 00:59:38,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:38,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [473817419] [2020-10-24 00:59:38,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:38,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:38,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:38,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [473817419] [2020-10-24 00:59:38,436 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:38,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:38,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546591986] [2020-10-24 00:59:38,437 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:38,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:38,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:38,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:38,439 INFO L87 Difference]: Start difference. First operand 220 states and 289 transitions. Second operand 4 states. [2020-10-24 00:59:38,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:38,712 INFO L93 Difference]: Finished difference Result 564 states and 768 transitions. [2020-10-24 00:59:38,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:38,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2020-10-24 00:59:38,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:38,715 INFO L225 Difference]: With dead ends: 564 [2020-10-24 00:59:38,716 INFO L226 Difference]: Without dead ends: 385 [2020-10-24 00:59:38,718 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 00:59:38,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2020-10-24 00:59:38,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 384. [2020-10-24 00:59:38,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-10-24 00:59:38,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 511 transitions. [2020-10-24 00:59:38,801 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 511 transitions. Word has length 66 [2020-10-24 00:59:38,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:59:38,802 INFO L481 AbstractCegarLoop]: Abstraction has 384 states and 511 transitions. [2020-10-24 00:59:38,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:59:38,802 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 511 transitions. [2020-10-24 00:59:38,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-10-24 00:59:38,804 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:38,804 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:59:38,804 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 00:59:38,804 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:38,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:38,805 INFO L82 PathProgramCache]: Analyzing trace with hash 476041895, now seen corresponding path program 1 times [2020-10-24 00:59:38,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:38,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [540125395] [2020-10-24 00:59:38,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:38,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:38,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:38,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:38,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [540125395] [2020-10-24 00:59:38,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:38,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:38,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447749351] [2020-10-24 00:59:38,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:38,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:38,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:38,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:38,897 INFO L87 Difference]: Start difference. First operand 384 states and 511 transitions. Second operand 4 states. [2020-10-24 00:59:39,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:39,182 INFO L93 Difference]: Finished difference Result 472 states and 634 transitions. [2020-10-24 00:59:39,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:39,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2020-10-24 00:59:39,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:39,185 INFO L225 Difference]: With dead ends: 472 [2020-10-24 00:59:39,186 INFO L226 Difference]: Without dead ends: 469 [2020-10-24 00:59:39,186 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 00:59:39,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2020-10-24 00:59:39,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 384. [2020-10-24 00:59:39,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-10-24 00:59:39,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 507 transitions. [2020-10-24 00:59:39,262 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 507 transitions. Word has length 66 [2020-10-24 00:59:39,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:59:39,263 INFO L481 AbstractCegarLoop]: Abstraction has 384 states and 507 transitions. [2020-10-24 00:59:39,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:59:39,263 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 507 transitions. [2020-10-24 00:59:39,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-10-24 00:59:39,264 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:39,264 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:59:39,265 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 00:59:39,265 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:39,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:39,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1073218075, now seen corresponding path program 1 times [2020-10-24 00:59:39,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:39,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [430376387] [2020-10-24 00:59:39,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:39,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:39,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:39,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:39,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [430376387] [2020-10-24 00:59:39,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:39,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:39,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114994773] [2020-10-24 00:59:39,327 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:39,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:39,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:39,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:39,328 INFO L87 Difference]: Start difference. First operand 384 states and 507 transitions. Second operand 4 states. [2020-10-24 00:59:39,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:39,585 INFO L93 Difference]: Finished difference Result 468 states and 622 transitions. [2020-10-24 00:59:39,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:39,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2020-10-24 00:59:39,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:39,588 INFO L225 Difference]: With dead ends: 468 [2020-10-24 00:59:39,588 INFO L226 Difference]: Without dead ends: 465 [2020-10-24 00:59:39,589 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 00:59:39,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2020-10-24 00:59:39,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 384. [2020-10-24 00:59:39,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-10-24 00:59:39,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 503 transitions. [2020-10-24 00:59:39,665 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 503 transitions. Word has length 67 [2020-10-24 00:59:39,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:59:39,666 INFO L481 AbstractCegarLoop]: Abstraction has 384 states and 503 transitions. [2020-10-24 00:59:39,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:59:39,666 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 503 transitions. [2020-10-24 00:59:39,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-10-24 00:59:39,667 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:39,667 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:59:39,667 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 00:59:39,667 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:39,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:39,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1240186874, now seen corresponding path program 1 times [2020-10-24 00:59:39,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:39,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [357564887] [2020-10-24 00:59:39,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:39,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:39,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:39,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [357564887] [2020-10-24 00:59:39,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:39,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:39,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789502703] [2020-10-24 00:59:39,730 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:39,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:39,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:39,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:39,731 INFO L87 Difference]: Start difference. First operand 384 states and 503 transitions. Second operand 4 states. [2020-10-24 00:59:40,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:40,036 INFO L93 Difference]: Finished difference Result 1044 states and 1394 transitions. [2020-10-24 00:59:40,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:40,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2020-10-24 00:59:40,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:40,040 INFO L225 Difference]: With dead ends: 1044 [2020-10-24 00:59:40,041 INFO L226 Difference]: Without dead ends: 701 [2020-10-24 00:59:40,043 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 00:59:40,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2020-10-24 00:59:40,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 700. [2020-10-24 00:59:40,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2020-10-24 00:59:40,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 915 transitions. [2020-10-24 00:59:40,174 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 915 transitions. Word has length 67 [2020-10-24 00:59:40,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:59:40,174 INFO L481 AbstractCegarLoop]: Abstraction has 700 states and 915 transitions. [2020-10-24 00:59:40,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:59:40,175 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 915 transitions. [2020-10-24 00:59:40,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-10-24 00:59:40,176 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:40,176 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:59:40,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 00:59:40,177 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:40,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:40,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1889145293, now seen corresponding path program 1 times [2020-10-24 00:59:40,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:40,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [166036636] [2020-10-24 00:59:40,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:40,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:40,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:40,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [166036636] [2020-10-24 00:59:40,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:40,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:40,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096962846] [2020-10-24 00:59:40,238 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:40,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:40,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:40,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:40,239 INFO L87 Difference]: Start difference. First operand 700 states and 915 transitions. Second operand 4 states. [2020-10-24 00:59:40,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:40,636 INFO L93 Difference]: Finished difference Result 848 states and 1110 transitions. [2020-10-24 00:59:40,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:40,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2020-10-24 00:59:40,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:40,642 INFO L225 Difference]: With dead ends: 848 [2020-10-24 00:59:40,642 INFO L226 Difference]: Without dead ends: 845 [2020-10-24 00:59:40,643 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 00:59:40,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2020-10-24 00:59:40,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 700. [2020-10-24 00:59:40,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2020-10-24 00:59:40,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 907 transitions. [2020-10-24 00:59:40,758 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 907 transitions. Word has length 68 [2020-10-24 00:59:40,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:59:40,758 INFO L481 AbstractCegarLoop]: Abstraction has 700 states and 907 transitions. [2020-10-24 00:59:40,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:59:40,759 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 907 transitions. [2020-10-24 00:59:40,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-10-24 00:59:40,762 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:40,763 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:59:40,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 00:59:40,763 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:40,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:40,764 INFO L82 PathProgramCache]: Analyzing trace with hash 216534137, now seen corresponding path program 1 times [2020-10-24 00:59:40,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:40,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1584112266] [2020-10-24 00:59:40,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:40,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:40,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:40,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1584112266] [2020-10-24 00:59:40,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:40,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:40,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88782299] [2020-10-24 00:59:40,842 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:40,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:40,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:40,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:40,843 INFO L87 Difference]: Start difference. First operand 700 states and 907 transitions. Second operand 4 states. [2020-10-24 00:59:41,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:41,296 INFO L93 Difference]: Finished difference Result 1968 states and 2574 transitions. [2020-10-24 00:59:41,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:41,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2020-10-24 00:59:41,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:41,303 INFO L225 Difference]: With dead ends: 1968 [2020-10-24 00:59:41,303 INFO L226 Difference]: Without dead ends: 1309 [2020-10-24 00:59:41,306 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 00:59:41,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2020-10-24 00:59:41,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1308. [2020-10-24 00:59:41,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1308 states. [2020-10-24 00:59:41,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1675 transitions. [2020-10-24 00:59:41,506 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 1675 transitions. Word has length 68 [2020-10-24 00:59:41,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:59:41,507 INFO L481 AbstractCegarLoop]: Abstraction has 1308 states and 1675 transitions. [2020-10-24 00:59:41,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:59:41,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1675 transitions. [2020-10-24 00:59:41,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-10-24 00:59:41,509 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:41,509 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:59:41,509 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 00:59:41,509 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:41,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:41,510 INFO L82 PathProgramCache]: Analyzing trace with hash 766882343, now seen corresponding path program 1 times [2020-10-24 00:59:41,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:41,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2091845554] [2020-10-24 00:59:41,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:41,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:41,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:41,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2091845554] [2020-10-24 00:59:41,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:41,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:41,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756607180] [2020-10-24 00:59:41,565 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:41,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:41,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:41,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:41,566 INFO L87 Difference]: Start difference. First operand 1308 states and 1675 transitions. Second operand 4 states. [2020-10-24 00:59:42,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:42,127 INFO L93 Difference]: Finished difference Result 1568 states and 1998 transitions. [2020-10-24 00:59:42,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:42,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2020-10-24 00:59:42,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:42,136 INFO L225 Difference]: With dead ends: 1568 [2020-10-24 00:59:42,137 INFO L226 Difference]: Without dead ends: 1565 [2020-10-24 00:59:42,138 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 00:59:42,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2020-10-24 00:59:42,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1308. [2020-10-24 00:59:42,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1308 states. [2020-10-24 00:59:42,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1659 transitions. [2020-10-24 00:59:42,399 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 1659 transitions. Word has length 69 [2020-10-24 00:59:42,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:59:42,400 INFO L481 AbstractCegarLoop]: Abstraction has 1308 states and 1659 transitions. [2020-10-24 00:59:42,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:59:42,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1659 transitions. [2020-10-24 00:59:42,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-10-24 00:59:42,402 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:42,402 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:59:42,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 00:59:42,402 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:42,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:42,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1869743246, now seen corresponding path program 1 times [2020-10-24 00:59:42,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:42,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2147439433] [2020-10-24 00:59:42,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:42,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:42,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:42,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2147439433] [2020-10-24 00:59:42,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:42,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:42,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991054756] [2020-10-24 00:59:42,464 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:42,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:42,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:42,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:42,465 INFO L87 Difference]: Start difference. First operand 1308 states and 1659 transitions. Second operand 4 states. [2020-10-24 00:59:43,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:43,048 INFO L93 Difference]: Finished difference Result 3744 states and 4766 transitions. [2020-10-24 00:59:43,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:43,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2020-10-24 00:59:43,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:43,080 INFO L225 Difference]: With dead ends: 3744 [2020-10-24 00:59:43,080 INFO L226 Difference]: Without dead ends: 2477 [2020-10-24 00:59:43,083 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 00:59:43,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2020-10-24 00:59:43,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 2476. [2020-10-24 00:59:43,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2476 states. [2020-10-24 00:59:43,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 3083 transitions. [2020-10-24 00:59:43,411 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 3083 transitions. Word has length 69 [2020-10-24 00:59:43,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:59:43,411 INFO L481 AbstractCegarLoop]: Abstraction has 2476 states and 3083 transitions. [2020-10-24 00:59:43,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:59:43,411 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 3083 transitions. [2020-10-24 00:59:43,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-10-24 00:59:43,414 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:43,414 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:59:43,414 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-24 00:59:43,414 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:43,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:43,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1499371967, now seen corresponding path program 1 times [2020-10-24 00:59:43,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:43,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [103325355] [2020-10-24 00:59:43,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:43,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:43,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:43,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [103325355] [2020-10-24 00:59:43,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:43,480 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:43,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578156015] [2020-10-24 00:59:43,481 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:43,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:43,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:43,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:43,482 INFO L87 Difference]: Start difference. First operand 2476 states and 3083 transitions. Second operand 4 states. [2020-10-24 00:59:44,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:44,341 INFO L93 Difference]: Finished difference Result 2928 states and 3598 transitions. [2020-10-24 00:59:44,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:44,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2020-10-24 00:59:44,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:44,355 INFO L225 Difference]: With dead ends: 2928 [2020-10-24 00:59:44,355 INFO L226 Difference]: Without dead ends: 2925 [2020-10-24 00:59:44,360 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 00:59:44,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2020-10-24 00:59:44,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 2476. [2020-10-24 00:59:44,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2476 states. [2020-10-24 00:59:44,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 3051 transitions. [2020-10-24 00:59:44,773 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 3051 transitions. Word has length 70 [2020-10-24 00:59:44,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:59:44,774 INFO L481 AbstractCegarLoop]: Abstraction has 2476 states and 3051 transitions. [2020-10-24 00:59:44,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:59:44,774 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 3051 transitions. [2020-10-24 00:59:44,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-10-24 00:59:44,776 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:44,777 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:59:44,777 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-24 00:59:44,777 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:44,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:44,777 INFO L82 PathProgramCache]: Analyzing trace with hash -2119821147, now seen corresponding path program 1 times [2020-10-24 00:59:44,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:44,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1250096245] [2020-10-24 00:59:44,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:44,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:44,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:44,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1250096245] [2020-10-24 00:59:44,842 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:44,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:44,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782602167] [2020-10-24 00:59:44,843 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:44,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:44,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:44,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:44,845 INFO L87 Difference]: Start difference. First operand 2476 states and 3051 transitions. Second operand 4 states. [2020-10-24 00:59:45,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:45,832 INFO L93 Difference]: Finished difference Result 7151 states and 8813 transitions. [2020-10-24 00:59:45,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:45,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2020-10-24 00:59:45,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:45,844 INFO L225 Difference]: With dead ends: 7151 [2020-10-24 00:59:45,844 INFO L226 Difference]: Without dead ends: 2476 [2020-10-24 00:59:45,854 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 00:59:45,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2476 states. [2020-10-24 00:59:46,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2476 to 2476. [2020-10-24 00:59:46,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2476 states. [2020-10-24 00:59:46,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 2923 transitions. [2020-10-24 00:59:46,330 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 2923 transitions. Word has length 70 [2020-10-24 00:59:46,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:59:46,330 INFO L481 AbstractCegarLoop]: Abstraction has 2476 states and 2923 transitions. [2020-10-24 00:59:46,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:59:46,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 2923 transitions. [2020-10-24 00:59:46,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-10-24 00:59:46,333 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:46,333 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:59:46,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-24 00:59:46,334 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:46,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:46,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1563241933, now seen corresponding path program 1 times [2020-10-24 00:59:46,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:46,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [768424837] [2020-10-24 00:59:46,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:46,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:46,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:46,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:46,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [768424837] [2020-10-24 00:59:46,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:46,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:46,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162219925] [2020-10-24 00:59:46,414 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:46,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:46,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:46,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:46,415 INFO L87 Difference]: Start difference. First operand 2476 states and 2923 transitions. Second operand 4 states. [2020-10-24 00:59:46,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:46,870 INFO L93 Difference]: Finished difference Result 2476 states and 2923 transitions. [2020-10-24 00:59:46,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:46,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2020-10-24 00:59:46,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:46,871 INFO L225 Difference]: With dead ends: 2476 [2020-10-24 00:59:46,871 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 00:59:46,876 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 00:59:46,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 00:59:46,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 00:59:46,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 00:59:46,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 00:59:46,877 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2020-10-24 00:59:46,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:59:46,877 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 00:59:46,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:59:46,878 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 00:59:46,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 00:59:46,878 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-24 00:59:46,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 00:59:47,140 WARN L193 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 85 [2020-10-24 00:59:47,398 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 273 DAG size of output: 31 [2020-10-24 00:59:48,277 WARN L193 SmtUtils]: Spent 834.00 ms on a formula simplification. DAG size of input: 382 DAG size of output: 31 [2020-10-24 00:59:48,758 WARN L193 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 382 DAG size of output: 31 [2020-10-24 00:59:49,245 WARN L193 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 382 DAG size of output: 31 [2020-10-24 00:59:49,702 WARN L193 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 382 DAG size of output: 31 [2020-10-24 00:59:50,258 WARN L193 SmtUtils]: Spent 553.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2020-10-24 00:59:50,441 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 85 [2020-10-24 00:59:50,691 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 41 [2020-10-24 00:59:51,034 WARN L193 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 363 DAG size of output: 31 [2020-10-24 00:59:51,280 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2020-10-24 00:59:51,447 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 65 [2020-10-24 00:59:51,612 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 318 DAG size of output: 34 [2020-10-24 00:59:52,032 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 349 DAG size of output: 31 [2020-10-24 00:59:52,250 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 41 [2020-10-24 00:59:52,411 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 121 [2020-10-24 00:59:52,853 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 382 DAG size of output: 31 [2020-10-24 00:59:53,033 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 288 DAG size of output: 45 [2020-10-24 00:59:53,173 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 318 DAG size of output: 34 [2020-10-24 00:59:53,425 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 382 DAG size of output: 31 [2020-10-24 00:59:53,621 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 323 DAG size of output: 31 [2020-10-24 00:59:53,735 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-24 00:59:54,240 WARN L193 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 384 DAG size of output: 39 [2020-10-24 00:59:54,535 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 377 DAG size of output: 31 [2020-10-24 00:59:54,698 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 121 [2020-10-24 00:59:55,869 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-10-24 01:00:02,873 WARN L193 SmtUtils]: Spent 6.94 s on a formula simplification. DAG size of input: 179 DAG size of output: 159 [2020-10-24 01:00:03,946 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-10-24 01:00:04,140 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-10-24 01:00:04,372 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-10-24 01:00:05,473 WARN L193 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-10-24 01:00:08,403 WARN L193 SmtUtils]: Spent 2.93 s on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2020-10-24 01:00:08,849 WARN L193 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-10-24 01:00:08,971 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2020-10-24 01:00:10,261 WARN L193 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2020-10-24 01:00:10,707 WARN L193 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-10-24 01:00:10,906 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-10-24 01:00:13,575 WARN L193 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2020-10-24 01:00:16,559 WARN L193 SmtUtils]: Spent 2.89 s on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2020-10-24 01:00:17,072 WARN L193 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-10-24 01:00:17,547 WARN L193 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-10-24 01:00:20,266 WARN L193 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2020-10-24 01:00:21,448 WARN L193 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2020-10-24 01:00:21,679 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-10-24 01:00:21,983 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-10-24 01:00:24,593 WARN L193 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2020-10-24 01:00:25,101 WARN L193 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-10-24 01:00:25,210 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2020-10-24 01:00:25,214 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-10-24 01:00:25,215 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-10-24 01:00:25,215 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-10-24 01:00:25,215 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-10-24 01:00:25,215 INFO L277 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-10-24 01:00:25,215 INFO L277 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-10-24 01:00:25,216 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 01:00:25,216 INFO L277 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-10-24 01:00:25,216 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-24 01:00:25,216 INFO L277 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-10-24 01:00:25,216 INFO L270 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-10-24 01:00:25,217 INFO L277 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-10-24 01:00:25,217 INFO L277 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-10-24 01:00:25,217 INFO L277 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-10-24 01:00:25,217 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-24 01:00:25,217 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 01:00:25,217 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-24 01:00:25,218 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-24 01:00:25,218 INFO L270 CegarLoopResult]: At program point L93-1(lines 32 118) the Hoare annotation is: (let ((.cse0 (= main_~p5~0 0)) (.cse1 (= main_~lk6~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~p7~0 0)) (.cse5 (= main_~lk4~0 1)) (.cse6 (= main_~p6~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse3 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse4 .cse3) (and .cse5 .cse6 .cse0 .cse7) (and .cse5 .cse0 .cse7 .cse1) (and .cse5 .cse6 .cse0 .cse3) (and .cse5 .cse0 .cse1 .cse3) (and .cse5 .cse1 .cse4 .cse3) (and .cse7 .cse1 .cse2 .cse4) (and .cse6 .cse0 .cse2 .cse3) (and .cse6 .cse7 .cse2 .cse4) (and .cse6 .cse0 .cse7 .cse2) (and .cse6 .cse2 .cse4 .cse3) (and .cse5 .cse7 .cse1 .cse4) (and .cse0 .cse7 .cse1 .cse2) (and .cse5 .cse6 .cse7 .cse4) (and .cse5 .cse6 .cse4 .cse3))) [2020-10-24 01:00:25,218 INFO L277 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-10-24 01:00:25,218 INFO L277 CegarLoopResult]: At program point mainEXIT(lines 6 123) the Hoare annotation is: true [2020-10-24 01:00:25,219 INFO L270 CegarLoopResult]: At program point L85(line 85) the Hoare annotation is: (let ((.cse9 (= main_~lk4~0 1)) (.cse12 (= main_~p2~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse8 (= main_~lk6~0 1)) (.cse11 (= main_~lk5~0 1)) (.cse6 (= main_~lk7~0 1)) (.cse1 (= main_~p6~0 0)) (.cse10 (= main_~p3~0 0)) (.cse2 (= main_~p5~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse7 (= main_~p7~0 0)) (.cse4 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse7 .cse8 .cse4 .cse5) (and .cse9 .cse1 .cse10 .cse3 .cse11 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse2 .cse7 .cse12 .cse5) (and .cse10 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse1 .cse10 .cse3 .cse4 .cse11 .cse5 .cse6) (and .cse9 .cse0 .cse2 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse3 .cse7 .cse11 .cse5) (and .cse10 .cse3 .cse7 .cse8 .cse4 .cse11 .cse5) (and .cse1 .cse10 .cse2 .cse7 .cse4 .cse12 .cse5) (and .cse9 .cse1 .cse10 .cse2 .cse3 .cse5 .cse6) (and .cse10 .cse7 .cse8 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse0 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse2 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse3 .cse7 .cse8 .cse11 .cse5) (and .cse9 .cse10 .cse3 .cse8 .cse11 .cse5 .cse6) (and .cse9 .cse0 .cse2 .cse7 .cse8 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse7 .cse11 .cse12 .cse5) (and .cse9 .cse1 .cse10 .cse7 .cse11 .cse12 .cse5) (and .cse10 .cse3 .cse8 .cse4 .cse11 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse10 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse8 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse3 .cse7 .cse8 .cse5) (and .cse9 .cse0 .cse3 .cse8 .cse11 .cse5 .cse6) (and .cse0 .cse3 .cse7 .cse8 .cse4 .cse11 .cse5) (and .cse0 .cse1 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse1 .cse10 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse2 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse8 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse9 .cse0 .cse1 .cse11 .cse12 .cse5 .cse6) (and .cse10 .cse2 .cse8 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse7 .cse8 .cse12 .cse5) (and .cse0 .cse1 .cse7 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse9 .cse10 .cse7 .cse8 .cse11 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse2 .cse7 .cse12 .cse5) (and .cse10 .cse2 .cse3 .cse7 .cse8 .cse4 .cse5) (and .cse10 .cse8 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse8 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse11 .cse5 .cse6) (and .cse1 .cse10 .cse3 .cse7 .cse4 .cse11 .cse5) (and .cse0 .cse2 .cse8 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse2 .cse3 .cse7 .cse5) (and .cse0 .cse1 .cse2 .cse7 .cse4 .cse12 .cse5) (and .cse9 .cse0 .cse3 .cse7 .cse8 .cse11 .cse5) (and .cse0 .cse1 .cse3 .cse7 .cse4 .cse11 .cse5) (and .cse9 .cse0 .cse1 .cse3 .cse11 .cse5 .cse6) (and .cse10 .cse2 .cse7 .cse8 .cse4 .cse12 .cse5) (and .cse9 .cse0 .cse2 .cse8 .cse12 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse0 .cse7 .cse8 .cse11 .cse12 .cse5) (and .cse0 .cse2 .cse7 .cse8 .cse4 .cse12 .cse5) (and .cse9 .cse10 .cse8 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse3 .cse7 .cse11 .cse5) (and .cse1 .cse10 .cse7 .cse4 .cse11 .cse12 .cse5) (and .cse0 .cse3 .cse8 .cse4 .cse11 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse3 .cse7 .cse4 .cse5))) [2020-10-24 01:00:25,219 INFO L270 CegarLoopResult]: At program point L110(line 110) the Hoare annotation is: (let ((.cse0 (= main_~lk6~0 1))) (or (and .cse0 (= main_~lk7~0 1)) (and (= main_~p7~0 0) .cse0))) [2020-10-24 01:00:25,220 INFO L270 CegarLoopResult]: At program point L77-1(lines 32 118) the Hoare annotation is: (let ((.cse1 (= main_~p6~0 0)) (.cse8 (= main_~p3~0 0)) (.cse2 (= main_~p5~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse10 (= main_~p7~0 0)) (.cse4 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1)) (.cse7 (= main_~lk4~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse13 (= main_~lk6~0 1)) (.cse9 (= main_~lk5~0 1)) (.cse12 (= main_~p1~0 0)) (.cse11 (= main_~p2~0 0)) (.cse6 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse10 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse5 .cse6) (and .cse1 .cse8 .cse3 .cse10 .cse4 .cse9 .cse12) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse13 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse12) (and .cse8 .cse3 .cse10 .cse13 .cse4 .cse9 .cse5) (and .cse8 .cse2 .cse3 .cse10 .cse13 .cse4 .cse12) (and .cse7 .cse8 .cse10 .cse13 .cse9 .cse12 .cse11) (and .cse7 .cse0 .cse2 .cse3 .cse13 .cse5 .cse6) (and .cse7 .cse8 .cse3 .cse10 .cse13 .cse9 .cse5) (and .cse7 .cse0 .cse2 .cse10 .cse13 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse12 .cse6) (and .cse7 .cse1 .cse8 .cse10 .cse9 .cse11 .cse5) (and .cse8 .cse3 .cse10 .cse13 .cse4 .cse9 .cse12) (and .cse8 .cse3 .cse13 .cse4 .cse9 .cse5 .cse6) (and .cse0 .cse10 .cse13 .cse4 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse3 .cse10 .cse13 .cse9 .cse12) (and .cse0 .cse2 .cse13 .cse4 .cse12 .cse11 .cse6) (and .cse0 .cse3 .cse10 .cse13 .cse4 .cse9 .cse12) (and .cse7 .cse1 .cse8 .cse3 .cse9 .cse12 .cse6) (and .cse7 .cse8 .cse2 .cse3 .cse10 .cse13 .cse5) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse12 .cse6) (and .cse7 .cse0 .cse3 .cse13 .cse9 .cse5 .cse6) (and .cse8 .cse10 .cse13 .cse4 .cse9 .cse12 .cse11) (and .cse0 .cse3 .cse10 .cse13 .cse4 .cse9 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse10 .cse12 .cse11) (and .cse1 .cse8 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse13 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse3 .cse13 .cse4 .cse9 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse12 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse13 .cse4 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse12 .cse11 .cse6) (and .cse7 .cse8 .cse10 .cse13 .cse9 .cse11 .cse5) (and .cse8 .cse13 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse13 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5 .cse6) (and .cse1 .cse8 .cse3 .cse10 .cse4 .cse9 .cse5) (and .cse0 .cse1 .cse10 .cse4 .cse9 .cse12 .cse11) (and .cse0 .cse2 .cse13 .cse4 .cse11 .cse5 .cse6) (and .cse1 .cse8 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse10 .cse5) (and .cse0 .cse13 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse11 .cse5) (and .cse1 .cse8 .cse10 .cse4 .cse9 .cse12 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse10 .cse9 .cse12) (and .cse8 .cse2 .cse10 .cse13 .cse4 .cse12 .cse11) (and .cse7 .cse0 .cse2 .cse13 .cse11 .cse5 .cse6) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse10 .cse13 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse12) (and .cse0 .cse2 .cse10 .cse13 .cse4 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse9 .cse12 .cse6) (and .cse7 .cse8 .cse3 .cse13 .cse9 .cse12 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse10 .cse9 .cse5) (and .cse7 .cse8 .cse2 .cse3 .cse10 .cse13 .cse12) (and .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse12) (and .cse7 .cse0 .cse2 .cse13 .cse12 .cse11 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse13 .cse4 .cse5) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse12 .cse6) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse11 .cse6) (and .cse8 .cse13 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse12 .cse6) (and .cse0 .cse10 .cse13 .cse4 .cse9 .cse12 .cse11) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6) (and .cse8 .cse2 .cse13 .cse4 .cse12 .cse11 .cse6) (and .cse1 .cse8 .cse2 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse13 .cse9 .cse12 .cse11 .cse6) (and .cse7 .cse0 .cse1 .cse10 .cse9 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse10 .cse9 .cse12 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse10 .cse9 .cse5) (and .cse1 .cse8 .cse2 .cse10 .cse4 .cse11 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse7 .cse0 .cse3 .cse13 .cse9 .cse12 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse6) (and .cse8 .cse10 .cse13 .cse4 .cse9 .cse11 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse3 .cse13 .cse9 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse10 .cse13 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse10 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse10 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse10 .cse12) (and .cse8 .cse3 .cse13 .cse4 .cse9 .cse12 .cse6) (and .cse7 .cse8 .cse2 .cse3 .cse13 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse13 .cse12 .cse11 .cse6) (and .cse7 .cse8 .cse2 .cse13 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse3 .cse10 .cse9 .cse12) (and .cse7 .cse8 .cse2 .cse3 .cse13 .cse12 .cse6) (and .cse0 .cse1 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse9 .cse12 .cse11 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse13 .cse12 .cse6) (and .cse1 .cse8 .cse2 .cse4 .cse12 .cse11 .cse6) (and .cse8 .cse2 .cse13 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse10 .cse13 .cse12 .cse11) (and .cse7 .cse8 .cse2 .cse10 .cse13 .cse11 .cse5) (and .cse0 .cse1 .cse10 .cse4 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse10 .cse11 .cse5) (and .cse8 .cse2 .cse3 .cse10 .cse13 .cse4 .cse5) (and .cse0 .cse1 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse3 .cse10 .cse13 .cse9 .cse5) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse13 .cse12) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse9 .cse5) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse12 .cse6) (and .cse1 .cse8 .cse2 .cse10 .cse4 .cse12 .cse11) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse9 .cse12) (and .cse8 .cse2 .cse10 .cse13 .cse4 .cse11 .cse5) (and .cse7 .cse0 .cse10 .cse13 .cse9 .cse12 .cse11) (and .cse0 .cse2 .cse10 .cse13 .cse4 .cse12 .cse11) (and .cse7 .cse8 .cse3 .cse10 .cse13 .cse9 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse12 .cse6) (and .cse7 .cse8 .cse13 .cse9 .cse11 .cse5 .cse6) (and .cse1 .cse8 .cse10 .cse4 .cse9 .cse11 .cse5) (and .cse0 .cse3 .cse13 .cse4 .cse9 .cse5 .cse6) (and .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse0 .cse13 .cse9 .cse12 .cse11 .cse6))) [2020-10-24 01:00:25,220 INFO L277 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: true [2020-10-24 01:00:25,220 INFO L277 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: true [2020-10-24 01:00:25,220 INFO L277 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: true [2020-10-24 01:00:25,221 INFO L270 CegarLoopResult]: At program point L69-1(lines 32 118) the Hoare annotation is: (let ((.cse0 (= main_~lk3~0 1)) (.cse6 (= main_~p2~0 0)) (.cse2 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~lk1~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse7 (= main_~p3~0 0)) (.cse5 (= main_~p5~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse9 (= main_~p1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse6 .cse4) (and .cse8 .cse0 .cse5 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse0 .cse5 .cse1 .cse4) (and .cse7 .cse1 .cse2 .cse3 .cse9) (and .cse8 .cse7 .cse5 .cse6 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse7 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse9 .cse6) (and .cse8 .cse7 .cse3 .cse6 .cse4) (and .cse8 .cse7 .cse3 .cse9 .cse6) (and .cse7 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse0 .cse5 .cse1 .cse9) (and .cse7 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse5 .cse9 .cse6) (and .cse8 .cse7 .cse5 .cse9 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse9) (and .cse0 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse7 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse3 .cse9 .cse6) (and .cse0 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse9 .cse6) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse9))) [2020-10-24 01:00:25,221 INFO L270 CegarLoopResult]: At program point L94(line 94) the Hoare annotation is: (let ((.cse5 (= main_~p7~0 0)) (.cse8 (= main_~lk6~0 1)) (.cse7 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse2 (= main_~p6~0 0)) (.cse6 (= main_~p5~0 0)) (.cse4 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse3) (and .cse1 .cse2 .cse6 .cse7 .cse4) (and .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse7 .cse3) (and .cse1 .cse8 .cse7 .cse3 .cse4) (and .cse1 .cse2 .cse6 .cse5 .cse7) (and .cse0 .cse1 .cse6 .cse5 .cse8) (and .cse0 .cse1 .cse5 .cse8 .cse3) (and .cse0 .cse1 .cse6 .cse8 .cse4) (and .cse0 .cse1 .cse2 .cse6 .cse5) (and .cse0 .cse1 .cse8 .cse3 .cse4) (and .cse1 .cse6 .cse8 .cse7 .cse4) (and .cse1 .cse6 .cse5 .cse8 .cse7) (and .cse1 .cse5 .cse8 .cse7 .cse3) (and .cse0 .cse1 .cse2 .cse6 .cse4))) [2020-10-24 01:00:25,221 INFO L270 CegarLoopResult]: At program point L61-1(lines 32 118) the Hoare annotation is: (let ((.cse2 (= main_~lk1~0 1)) (.cse4 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse5 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 .cse1 .cse2) (and .cse0 .cse1 .cse5) (and .cse4 .cse5 .cse3) (and .cse4 .cse3 .cse2) (and .cse4 .cse1 .cse5) (and .cse0 .cse5 .cse3))) [2020-10-24 01:00:25,221 INFO L277 CegarLoopResult]: At program point L119(lines 7 123) the Hoare annotation is: true [2020-10-24 01:00:25,221 INFO L277 CegarLoopResult]: At program point L53(lines 53 55) the Hoare annotation is: true [2020-10-24 01:00:25,221 INFO L277 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-10-24 01:00:25,221 INFO L277 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: true [2020-10-24 01:00:25,222 INFO L270 CegarLoopResult]: At program point L53-2(lines 32 118) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-10-24 01:00:25,222 INFO L277 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: true [2020-10-24 01:00:25,222 INFO L270 CegarLoopResult]: At program point L78(line 78) the Hoare annotation is: (let ((.cse6 (= main_~lk6~0 1)) (.cse9 (= main_~p1~0 0)) (.cse10 (= main_~lk3~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~p2~0 0)) (.cse1 (= main_~p6~0 0)) (.cse2 (= main_~p3~0 0)) (.cse11 (= main_~p5~0 0)) (.cse8 (= main_~lk2~0 1)) (.cse7 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse8 .cse6 .cse3 .cse9) (and .cse10 .cse11 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse11 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse6 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse11 .cse6 .cse9 .cse4) (and .cse0 .cse2 .cse6 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse6 .cse9 .cse4) (and .cse0 .cse10 .cse8 .cse6 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse9 .cse4) (and .cse10 .cse11 .cse8 .cse6 .cse7 .cse9) (and .cse10 .cse1 .cse11 .cse8 .cse7 .cse5) (and .cse10 .cse11 .cse8 .cse6 .cse7 .cse5) (and .cse2 .cse11 .cse8 .cse6 .cse7 .cse9) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse8 .cse9) (and .cse10 .cse1 .cse8 .cse7 .cse3 .cse5) (and .cse2 .cse11 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse10 .cse11 .cse8 .cse6 .cse5) (and .cse10 .cse11 .cse6 .cse7 .cse9 .cse4) (and .cse1 .cse2 .cse11 .cse7 .cse4 .cse5) (and .cse10 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse9) (and .cse2 .cse11 .cse6 .cse7 .cse9 .cse4) (and .cse10 .cse1 .cse11 .cse7 .cse9 .cse4) (and .cse0 .cse10 .cse8 .cse6 .cse3 .cse9) (and .cse0 .cse10 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse11 .cse8 .cse5) (and .cse0 .cse10 .cse6 .cse3 .cse9 .cse4) (and .cse10 .cse8 .cse6 .cse7 .cse3 .cse9) (and .cse10 .cse1 .cse7 .cse3 .cse9 .cse4) (and .cse10 .cse1 .cse11 .cse7 .cse4 .cse5) (and .cse1 .cse2 .cse7 .cse3 .cse9 .cse4) (and .cse1 .cse2 .cse8 .cse7 .cse3 .cse9) (and .cse0 .cse2 .cse8 .cse6 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse8 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse10 .cse8 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse2 .cse11 .cse8 .cse6 .cse9) (and .cse10 .cse6 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse1 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse8 .cse7 .cse3 .cse5) (and .cse10 .cse1 .cse8 .cse7 .cse3 .cse9) (and .cse0 .cse1 .cse2 .cse11 .cse9 .cse4) (and .cse2 .cse6 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse8 .cse6 .cse9) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse10 .cse1 .cse11 .cse8 .cse7 .cse9) (and .cse2 .cse8 .cse6 .cse7 .cse3 .cse9) (and .cse2 .cse11 .cse8 .cse6 .cse7 .cse5) (and .cse0 .cse2 .cse11 .cse8 .cse6 .cse5) (and .cse2 .cse8 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse9) (and .cse0 .cse2 .cse11 .cse6 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse8 .cse7 .cse9) (and .cse1 .cse2 .cse11 .cse7 .cse9 .cse4) (and .cse0 .cse10 .cse1 .cse11 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4) (and .cse10 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse8 .cse7 .cse5))) [2020-10-24 01:00:25,223 INFO L277 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: true [2020-10-24 01:00:25,223 INFO L277 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-10-24 01:00:25,223 INFO L270 CegarLoopResult]: At program point L70(line 70) the Hoare annotation is: (let ((.cse6 (= main_~p2~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p1~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse4 .cse5 .cse3 .cse6) (and .cse5 .cse2 .cse3 .cse6) (and .cse5 .cse1 .cse2 .cse7) (and .cse0 .cse2 .cse6 .cse7) (and .cse5 .cse2 .cse6 .cse7) (and .cse4 .cse0 .cse6 .cse7) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse0 .cse1 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7))) [2020-10-24 01:00:25,223 INFO L270 CegarLoopResult]: At program point L103-1(lines 32 118) the Hoare annotation is: (let ((.cse0 (= main_~lk6~0 1)) (.cse2 (= main_~p7~0 0)) (.cse3 (= main_~p6~0 0)) (.cse1 (= main_~lk7~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and .cse3 .cse2) (and .cse3 .cse1))) [2020-10-24 01:00:25,223 INFO L277 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: true [2020-10-24 01:00:25,223 INFO L270 CegarLoopResult]: At program point L95(line 95) the Hoare annotation is: (let ((.cse5 (= main_~p7~0 0)) (.cse8 (= main_~lk6~0 1)) (.cse7 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse2 (= main_~p6~0 0)) (.cse6 (= main_~p5~0 0)) (.cse4 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse3) (and .cse1 .cse2 .cse6 .cse7 .cse4) (and .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse7 .cse3) (and .cse1 .cse8 .cse7 .cse3 .cse4) (and .cse1 .cse2 .cse6 .cse5 .cse7) (and .cse0 .cse1 .cse6 .cse5 .cse8) (and .cse0 .cse1 .cse5 .cse8 .cse3) (and .cse0 .cse1 .cse6 .cse8 .cse4) (and .cse0 .cse1 .cse2 .cse6 .cse5) (and .cse0 .cse1 .cse8 .cse3 .cse4) (and .cse1 .cse6 .cse8 .cse7 .cse4) (and .cse1 .cse6 .cse5 .cse8 .cse7) (and .cse1 .cse5 .cse8 .cse7 .cse3) (and .cse0 .cse1 .cse2 .cse6 .cse4))) [2020-10-24 01:00:25,224 INFO L270 CegarLoopResult]: At program point L62(line 62) the Hoare annotation is: (let ((.cse0 (= main_~lk2~0 1)) (.cse2 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0)) (.cse1 (= main_~lk1~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse2) (and .cse3 .cse1))) [2020-10-24 01:00:25,224 INFO L277 CegarLoopResult]: At program point L54(line 54) the Hoare annotation is: true [2020-10-24 01:00:25,224 INFO L277 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-10-24 01:00:25,224 INFO L277 CegarLoopResult]: At program point mainFINAL(lines 6 123) the Hoare annotation is: true [2020-10-24 01:00:25,224 INFO L270 CegarLoopResult]: At program point L104(line 104) the Hoare annotation is: (let ((.cse0 (= main_~p6~0 0)) (.cse4 (= main_~lk7~0 1)) (.cse1 (= main_~p7~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse2 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2 .cse4) (and .cse0 .cse2 .cse4) (and .cse1 .cse3 .cse2))) [2020-10-24 01:00:25,224 INFO L277 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2020-10-24 01:00:25,224 INFO L277 CegarLoopResult]: At program point mainENTRY(lines 6 123) the Hoare annotation is: true [2020-10-24 01:00:25,225 INFO L270 CegarLoopResult]: At program point L121(line 121) the Hoare annotation is: false [2020-10-24 01:00:25,225 INFO L270 CegarLoopResult]: At program point L88-1(lines 32 118) the Hoare annotation is: (let ((.cse7 (= main_~lk6~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse9 (= main_~p5~0 0)) (.cse4 (= main_~lk7~0 1)) (.cse2 (= main_~p6~0 0)) (.cse6 (= main_~p3~0 0)) (.cse5 (= main_~p7~0 0)) (.cse8 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse3) (and .cse6 .cse5 .cse7 .cse8 .cse3) (and .cse2 .cse6 .cse9 .cse8 .cse4) (and .cse1 .cse2 .cse9 .cse5 .cse8) (and .cse6 .cse9 .cse5 .cse7 .cse8) (and .cse0 .cse1 .cse5 .cse7 .cse3) (and .cse0 .cse1 .cse9 .cse7 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse5) (and .cse0 .cse6 .cse9 .cse7 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse4) (and .cse0 .cse2 .cse6 .cse5 .cse3) (and .cse1 .cse9 .cse7 .cse8 .cse4) (and .cse0 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse2 .cse9 .cse8 .cse4) (and .cse6 .cse7 .cse8 .cse3 .cse4) (and .cse1 .cse2 .cse8 .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse8 .cse3) (and .cse1 .cse7 .cse8 .cse3 .cse4) (and .cse2 .cse6 .cse9 .cse5 .cse8) (and .cse0 .cse1 .cse9 .cse5 .cse7) (and .cse6 .cse9 .cse7 .cse8 .cse4) (and .cse0 .cse6 .cse9 .cse5 .cse7) (and .cse0 .cse6 .cse5 .cse7 .cse3) (and .cse0 .cse1 .cse2 .cse9 .cse5) (and .cse2 .cse6 .cse8 .cse3 .cse4) (and .cse0 .cse1 .cse7 .cse3 .cse4) (and .cse1 .cse9 .cse5 .cse7 .cse8) (and .cse0 .cse6 .cse7 .cse3 .cse4) (and .cse1 .cse5 .cse7 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse9 .cse4) (and .cse2 .cse6 .cse5 .cse8 .cse3))) [2020-10-24 01:00:25,225 INFO L277 CegarLoopResult]: At program point L113-1(lines 32 118) the Hoare annotation is: true [2020-10-24 01:00:25,225 INFO L277 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: true [2020-10-24 01:00:25,225 INFO L277 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-10-24 01:00:25,225 INFO L277 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-10-24 01:00:25,226 INFO L277 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: true [2020-10-24 01:00:25,226 INFO L270 CegarLoopResult]: At program point L105(line 105) the Hoare annotation is: (let ((.cse0 (= main_~p6~0 0)) (.cse4 (= main_~lk7~0 1)) (.cse1 (= main_~p7~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse2 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2 .cse4) (and .cse0 .cse2 .cse4) (and .cse1 .cse3 .cse2))) [2020-10-24 01:00:25,226 INFO L277 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: true [2020-10-24 01:00:25,226 INFO L270 CegarLoopResult]: At program point L122(line 122) the Hoare annotation is: false [2020-10-24 01:00:25,227 INFO L270 CegarLoopResult]: At program point L89(line 89) the Hoare annotation is: (let ((.cse8 (= main_~lk4~0 1)) (.cse1 (= main_~p3~0 0)) (.cse0 (= main_~p6~0 0)) (.cse3 (= main_~p7~0 0)) (.cse5 (= main_~lk5~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse9 (= main_~p5~0 0)) (.cse2 (= main_~lk2~0 1)) (.cse7 (= main_~lk6~0 1)) (.cse4 (= main_~p4~0 0)) (.cse10 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse3 .cse7) (and .cse8 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse6 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse3 .cse7 .cse5) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse7 .cse10) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse1 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse6 .cse0 .cse9 .cse2 .cse4 .cse10) (and .cse8 .cse1 .cse9 .cse2 .cse3 .cse7) (and .cse8 .cse1 .cse9 .cse2 .cse7 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse3) (and .cse6 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse10) (and .cse1 .cse9 .cse2 .cse7 .cse4 .cse10) (and .cse6 .cse0 .cse2 .cse4 .cse5 .cse10) (and .cse6 .cse0 .cse9 .cse2 .cse3 .cse4) (and .cse8 .cse1 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse3) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10) (and .cse1 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse6 .cse0 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse9 .cse2 .cse7 .cse4 .cse10))) [2020-10-24 01:00:25,227 INFO L277 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: true [2020-10-24 01:00:25,227 INFO L277 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: true [2020-10-24 01:00:25,227 INFO L277 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: true [2020-10-24 01:00:25,227 INFO L270 CegarLoopResult]: At program point L114(line 114) the Hoare annotation is: (= main_~lk7~0 1) [2020-10-24 01:00:25,227 INFO L270 CegarLoopResult]: At program point L114-1(lines 7 123) the Hoare annotation is: false [2020-10-24 01:00:25,227 INFO L277 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-10-24 01:00:25,228 INFO L270 CegarLoopResult]: At program point L73-1(lines 32 118) the Hoare annotation is: (let ((.cse6 (= main_~lk6~0 1)) (.cse9 (= main_~p1~0 0)) (.cse10 (= main_~lk3~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~p2~0 0)) (.cse1 (= main_~p6~0 0)) (.cse2 (= main_~p3~0 0)) (.cse11 (= main_~p5~0 0)) (.cse8 (= main_~lk2~0 1)) (.cse7 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse8 .cse6 .cse3 .cse9) (and .cse10 .cse11 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse11 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse6 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse11 .cse6 .cse9 .cse4) (and .cse0 .cse2 .cse6 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse6 .cse9 .cse4) (and .cse0 .cse10 .cse8 .cse6 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse9 .cse4) (and .cse10 .cse11 .cse8 .cse6 .cse7 .cse9) (and .cse10 .cse1 .cse11 .cse8 .cse7 .cse5) (and .cse10 .cse11 .cse8 .cse6 .cse7 .cse5) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse5) (and .cse2 .cse11 .cse8 .cse6 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse8 .cse9) (and .cse10 .cse1 .cse8 .cse7 .cse3 .cse5) (and .cse2 .cse11 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse10 .cse11 .cse8 .cse6 .cse5) (and .cse10 .cse11 .cse6 .cse7 .cse9 .cse4) (and .cse1 .cse2 .cse11 .cse7 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse9) (and .cse10 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse2 .cse11 .cse6 .cse7 .cse9 .cse4) (and .cse10 .cse1 .cse11 .cse7 .cse9 .cse4) (and .cse0 .cse10 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse10 .cse8 .cse6 .cse3 .cse9) (and .cse0 .cse10 .cse1 .cse11 .cse8 .cse5) (and .cse0 .cse10 .cse6 .cse3 .cse9 .cse4) (and .cse10 .cse8 .cse6 .cse7 .cse3 .cse9) (and .cse10 .cse1 .cse7 .cse3 .cse9 .cse4) (and .cse1 .cse2 .cse8 .cse7 .cse3 .cse9) (and .cse1 .cse2 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse2 .cse8 .cse6 .cse3 .cse5) (and .cse10 .cse1 .cse11 .cse7 .cse4 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse8 .cse5) (and .cse10 .cse8 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse2 .cse11 .cse8 .cse6 .cse9) (and .cse10 .cse6 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse1 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse8 .cse7 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse9 .cse4) (and .cse10 .cse1 .cse8 .cse7 .cse3 .cse9) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse8 .cse6 .cse9) (and .cse10 .cse1 .cse11 .cse8 .cse7 .cse9) (and .cse2 .cse8 .cse6 .cse7 .cse3 .cse9) (and .cse0 .cse2 .cse11 .cse8 .cse6 .cse5) (and .cse2 .cse11 .cse8 .cse6 .cse7 .cse5) (and .cse2 .cse8 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse9) (and .cse0 .cse2 .cse11 .cse6 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse8 .cse7 .cse9) (and .cse1 .cse2 .cse11 .cse7 .cse9 .cse4) (and .cse0 .cse10 .cse1 .cse11 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4) (and .cse10 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse8 .cse7 .cse5))) [2020-10-24 01:00:25,228 INFO L270 CegarLoopResult]: At program point L98-1(lines 32 118) the Hoare annotation is: (let ((.cse2 (= main_~lk5~0 1)) (.cse0 (= main_~p6~0 0)) (.cse5 (= main_~lk7~0 1)) (.cse3 (= main_~p5~0 0)) (.cse1 (= main_~p7~0 0)) (.cse4 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse1) (and .cse3 .cse4 .cse5) (and .cse4 .cse2 .cse5) (and .cse0 .cse2 .cse5) (and .cse1 .cse4 .cse2) (and .cse0 .cse3 .cse5) (and .cse3 .cse1 .cse4))) [2020-10-24 01:00:25,229 INFO L270 CegarLoopResult]: At program point L65-1(lines 32 118) the Hoare annotation is: (let ((.cse6 (= main_~p2~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p1~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse4 .cse5 .cse3 .cse6) (and .cse5 .cse2 .cse3 .cse6) (and .cse5 .cse1 .cse2 .cse7) (and .cse0 .cse2 .cse6 .cse7) (and .cse5 .cse2 .cse6 .cse7) (and .cse4 .cse0 .cse6 .cse7) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse0 .cse1 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7))) [2020-10-24 01:00:25,229 INFO L270 CegarLoopResult]: At program point L90(line 90) the Hoare annotation is: (let ((.cse8 (= main_~lk4~0 1)) (.cse1 (= main_~p3~0 0)) (.cse0 (= main_~p6~0 0)) (.cse3 (= main_~p7~0 0)) (.cse5 (= main_~lk5~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse9 (= main_~p5~0 0)) (.cse2 (= main_~lk2~0 1)) (.cse7 (= main_~lk6~0 1)) (.cse4 (= main_~p4~0 0)) (.cse10 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse3 .cse7) (and .cse8 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse6 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse3 .cse7 .cse5) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse7 .cse10) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse1 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse6 .cse0 .cse9 .cse2 .cse4 .cse10) (and .cse8 .cse1 .cse9 .cse2 .cse3 .cse7) (and .cse8 .cse1 .cse9 .cse2 .cse7 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse3) (and .cse6 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse10) (and .cse1 .cse9 .cse2 .cse7 .cse4 .cse10) (and .cse6 .cse0 .cse2 .cse4 .cse5 .cse10) (and .cse6 .cse0 .cse9 .cse2 .cse3 .cse4) (and .cse8 .cse1 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse3) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10) (and .cse1 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse6 .cse0 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse9 .cse2 .cse7 .cse4 .cse10))) [2020-10-24 01:00:25,229 INFO L277 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-10-24 01:00:25,229 INFO L270 CegarLoopResult]: At program point L57-1(lines 32 118) the Hoare annotation is: (let ((.cse0 (= main_~lk2~0 1)) (.cse2 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0)) (.cse1 (= main_~lk1~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse2) (and .cse3 .cse1))) [2020-10-24 01:00:25,229 INFO L270 CegarLoopResult]: At program point L115(line 115) the Hoare annotation is: (= main_~lk7~0 1) [2020-10-24 01:00:25,229 INFO L277 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: true [2020-10-24 01:00:25,230 INFO L270 CegarLoopResult]: At program point L74(line 74) the Hoare annotation is: (let ((.cse0 (= main_~lk3~0 1)) (.cse6 (= main_~p2~0 0)) (.cse2 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~lk1~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse7 (= main_~p3~0 0)) (.cse5 (= main_~p5~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse9 (= main_~p1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse6 .cse4) (and .cse8 .cse0 .cse5 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse0 .cse5 .cse1 .cse4) (and .cse7 .cse1 .cse2 .cse3 .cse9) (and .cse8 .cse7 .cse5 .cse6 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse7 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse9 .cse6) (and .cse8 .cse7 .cse3 .cse6 .cse4) (and .cse8 .cse7 .cse3 .cse9 .cse6) (and .cse7 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse0 .cse5 .cse1 .cse9) (and .cse7 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse5 .cse9 .cse6) (and .cse8 .cse7 .cse5 .cse9 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse9) (and .cse0 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse7 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse3 .cse9 .cse6) (and .cse0 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse9 .cse6) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse9))) [2020-10-24 01:00:25,230 INFO L277 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: true [2020-10-24 01:00:25,230 INFO L277 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: true [2020-10-24 01:00:25,230 INFO L277 CegarLoopResult]: At program point L8-1(line 8) the Hoare annotation is: true [2020-10-24 01:00:25,230 INFO L270 CegarLoopResult]: At program point L99(line 99) the Hoare annotation is: (let ((.cse2 (= main_~p5~0 0)) (.cse3 (= main_~p7~0 0)) (.cse1 (= main_~p6~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~lk6~0 1)) (.cse5 (= main_~lk5~0 1)) (.cse6 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse6) (and .cse0 .cse2 .cse4 .cse6) (and .cse0 .cse1 .cse3 .cse5) (and .cse0 .cse1 .cse5 .cse6) (and .cse0 .cse4 .cse5 .cse6))) [2020-10-24 01:00:25,231 INFO L270 CegarLoopResult]: At program point L66(line 66) the Hoare annotation is: (let ((.cse2 (= main_~lk1~0 1)) (.cse4 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse5 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 .cse1 .cse2) (and .cse0 .cse1 .cse5) (and .cse4 .cse5 .cse3) (and .cse4 .cse3 .cse2) (and .cse4 .cse1 .cse5) (and .cse0 .cse5 .cse3))) [2020-10-24 01:00:25,231 INFO L277 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-10-24 01:00:25,231 INFO L277 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: true [2020-10-24 01:00:25,231 INFO L277 CegarLoopResult]: At program point L33-2(line 33) the Hoare annotation is: true [2020-10-24 01:00:25,231 INFO L270 CegarLoopResult]: At program point L58(line 58) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-10-24 01:00:25,232 INFO L270 CegarLoopResult]: At program point L83-1(lines 32 118) the Hoare annotation is: (let ((.cse5 (= main_~lk5~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse1 (= main_~p3~0 0)) (.cse0 (= main_~p6~0 0)) (.cse3 (= main_~p7~0 0)) (.cse11 (= main_~p2~0 0)) (.cse6 (= main_~lk3~0 1)) (.cse9 (= main_~p5~0 0)) (.cse2 (= main_~lk2~0 1)) (.cse7 (= main_~lk6~0 1)) (.cse4 (= main_~p4~0 0)) (.cse10 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse3 .cse7) (and .cse8 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse7 .cse10) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse1 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse0 .cse1 .cse4 .cse5 .cse11 .cse10) (and .cse1 .cse7 .cse4 .cse5 .cse11 .cse10) (and .cse8 .cse1 .cse9 .cse3 .cse7 .cse11) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse3) (and .cse8 .cse6 .cse0 .cse3 .cse5 .cse11) (and .cse6 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse11 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse11 .cse10) (and .cse1 .cse3 .cse7 .cse4 .cse5 .cse11) (and .cse6 .cse0 .cse2 .cse4 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse5 .cse11 .cse10) (and .cse8 .cse0 .cse1 .cse3 .cse5 .cse11) (and .cse8 .cse6 .cse3 .cse7 .cse5 .cse11) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10) (and .cse8 .cse6 .cse7 .cse5 .cse11 .cse10) (and .cse1 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse1 .cse9 .cse3 .cse7 .cse4 .cse11) (and .cse8 .cse0 .cse1 .cse5 .cse11 .cse10) (and .cse6 .cse0 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse3 .cse4 .cse5 .cse11) (and .cse6 .cse9 .cse3 .cse7 .cse4 .cse11) (and .cse6 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse10) (and .cse6 .cse9 .cse7 .cse4 .cse11 .cse10) (and .cse8 .cse6 .cse2 .cse3 .cse7 .cse5) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse11) (and .cse8 .cse6 .cse9 .cse3 .cse7 .cse11) (and .cse8 .cse6 .cse0 .cse2 .cse3 .cse5) (and .cse8 .cse1 .cse3 .cse7 .cse5 .cse11) (and .cse8 .cse6 .cse9 .cse7 .cse11 .cse10) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse6 .cse0 .cse9 .cse2 .cse4 .cse10) (and .cse8 .cse1 .cse9 .cse2 .cse3 .cse7) (and .cse8 .cse1 .cse9 .cse2 .cse7 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse3 .cse11) (and .cse0 .cse1 .cse9 .cse4 .cse11 .cse10) (and .cse6 .cse0 .cse4 .cse5 .cse11 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse3 .cse11) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse10) (and .cse6 .cse3 .cse7 .cse4 .cse5 .cse11) (and .cse6 .cse0 .cse9 .cse4 .cse11 .cse10) (and .cse1 .cse9 .cse2 .cse7 .cse4 .cse10) (and .cse1 .cse9 .cse7 .cse4 .cse11 .cse10) (and .cse6 .cse7 .cse4 .cse5 .cse11 .cse10) (and .cse6 .cse0 .cse9 .cse2 .cse3 .cse4) (and .cse8 .cse1 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse3) (and .cse8 .cse1 .cse7 .cse5 .cse11 .cse10) (and .cse8 .cse1 .cse9 .cse7 .cse11 .cse10) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse11) (and .cse6 .cse0 .cse9 .cse3 .cse4 .cse11) (and .cse6 .cse9 .cse2 .cse7 .cse4 .cse10))) [2020-10-24 01:00:25,232 INFO L277 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-10-24 01:00:25,232 INFO L277 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-10-24 01:00:25,232 INFO L277 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: true [2020-10-24 01:00:25,232 INFO L270 CegarLoopResult]: At program point L108-1(lines 32 118) the Hoare annotation is: (or (= main_~p7~0 0) (= main_~lk7~0 1)) [2020-10-24 01:00:25,233 INFO L277 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-10-24 01:00:25,233 INFO L270 CegarLoopResult]: At program point L100(line 100) the Hoare annotation is: (let ((.cse2 (= main_~p5~0 0)) (.cse3 (= main_~p7~0 0)) (.cse1 (= main_~p6~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~lk6~0 1)) (.cse5 (= main_~lk5~0 1)) (.cse6 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse6) (and .cse0 .cse2 .cse4 .cse6) (and .cse0 .cse1 .cse3 .cse5) (and .cse0 .cse1 .cse5 .cse6) (and .cse0 .cse4 .cse5 .cse6))) [2020-10-24 01:00:25,233 INFO L277 CegarLoopResult]: At program point L34(lines 34 36) the Hoare annotation is: true [2020-10-24 01:00:25,233 INFO L277 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: true [2020-10-24 01:00:25,233 INFO L277 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: true [2020-10-24 01:00:25,233 INFO L277 CegarLoopResult]: At program point L26-2(line 26) the Hoare annotation is: true [2020-10-24 01:00:25,234 INFO L270 CegarLoopResult]: At program point L84(line 84) the Hoare annotation is: (let ((.cse9 (= main_~lk4~0 1)) (.cse12 (= main_~p2~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse8 (= main_~lk6~0 1)) (.cse11 (= main_~lk5~0 1)) (.cse6 (= main_~lk7~0 1)) (.cse1 (= main_~p6~0 0)) (.cse10 (= main_~p3~0 0)) (.cse2 (= main_~p5~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse7 (= main_~p7~0 0)) (.cse4 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse7 .cse8 .cse4 .cse5) (and .cse9 .cse1 .cse10 .cse3 .cse11 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse2 .cse7 .cse12 .cse5) (and .cse10 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse1 .cse10 .cse3 .cse4 .cse11 .cse5 .cse6) (and .cse9 .cse0 .cse2 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse3 .cse7 .cse11 .cse5) (and .cse10 .cse3 .cse7 .cse8 .cse4 .cse11 .cse5) (and .cse1 .cse10 .cse2 .cse7 .cse4 .cse12 .cse5) (and .cse9 .cse1 .cse10 .cse2 .cse3 .cse5 .cse6) (and .cse10 .cse7 .cse8 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse0 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse2 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse3 .cse7 .cse8 .cse11 .cse5) (and .cse9 .cse10 .cse3 .cse8 .cse11 .cse5 .cse6) (and .cse9 .cse0 .cse2 .cse7 .cse8 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse7 .cse11 .cse12 .cse5) (and .cse9 .cse1 .cse10 .cse7 .cse11 .cse12 .cse5) (and .cse10 .cse3 .cse8 .cse4 .cse11 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse10 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse8 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse3 .cse7 .cse8 .cse5) (and .cse9 .cse0 .cse3 .cse8 .cse11 .cse5 .cse6) (and .cse0 .cse3 .cse7 .cse8 .cse4 .cse11 .cse5) (and .cse0 .cse1 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse1 .cse10 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse2 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse8 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse9 .cse0 .cse1 .cse11 .cse12 .cse5 .cse6) (and .cse10 .cse2 .cse8 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse7 .cse8 .cse12 .cse5) (and .cse0 .cse1 .cse7 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse9 .cse10 .cse7 .cse8 .cse11 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse2 .cse7 .cse12 .cse5) (and .cse10 .cse2 .cse3 .cse7 .cse8 .cse4 .cse5) (and .cse10 .cse8 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse8 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse11 .cse5 .cse6) (and .cse1 .cse10 .cse3 .cse7 .cse4 .cse11 .cse5) (and .cse0 .cse2 .cse8 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse2 .cse3 .cse7 .cse5) (and .cse0 .cse1 .cse2 .cse7 .cse4 .cse12 .cse5) (and .cse9 .cse0 .cse3 .cse7 .cse8 .cse11 .cse5) (and .cse0 .cse1 .cse3 .cse7 .cse4 .cse11 .cse5) (and .cse9 .cse0 .cse1 .cse3 .cse11 .cse5 .cse6) (and .cse10 .cse2 .cse7 .cse8 .cse4 .cse12 .cse5) (and .cse9 .cse0 .cse2 .cse8 .cse12 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse0 .cse7 .cse8 .cse11 .cse12 .cse5) (and .cse0 .cse2 .cse7 .cse8 .cse4 .cse12 .cse5) (and .cse9 .cse10 .cse8 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse3 .cse7 .cse11 .cse5) (and .cse1 .cse10 .cse7 .cse4 .cse11 .cse12 .cse5) (and .cse0 .cse3 .cse8 .cse4 .cse11 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse3 .cse7 .cse4 .cse5))) [2020-10-24 01:00:25,234 INFO L277 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-10-24 01:00:25,234 INFO L270 CegarLoopResult]: At program point L109(line 109) the Hoare annotation is: (let ((.cse0 (= main_~lk6~0 1))) (or (and .cse0 (= main_~lk7~0 1)) (and (= main_~p7~0 0) .cse0))) [2020-10-24 01:00:25,234 INFO L277 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: true [2020-10-24 01:00:25,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 01:00:25 BoogieIcfgContainer [2020-10-24 01:00:25,253 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 01:00:25,257 INFO L168 Benchmark]: Toolchain (without parser) took 50056.54 ms. Allocated memory was 125.8 MB in the beginning and 935.3 MB in the end (delta: 809.5 MB). Free memory was 102.2 MB in the beginning and 758.2 MB in the end (delta: -656.0 MB). Peak memory consumption was 586.7 MB. Max. memory is 8.0 GB. [2020-10-24 01:00:25,259 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 125.8 MB. Free memory was 102.1 MB in the beginning and 102.0 MB in the end (delta: 69.7 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 01:00:25,260 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.47 ms. Allocated memory is still 125.8 MB. Free memory was 101.6 MB in the beginning and 91.8 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-24 01:00:25,265 INFO L168 Benchmark]: Boogie Preprocessor took 42.27 ms. Allocated memory is still 125.8 MB. Free memory was 91.8 MB in the beginning and 90.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-10-24 01:00:25,268 INFO L168 Benchmark]: RCFGBuilder took 468.83 ms. Allocated memory was 125.8 MB in the beginning and 152.0 MB in the end (delta: 26.2 MB). Free memory was 90.2 MB in the beginning and 127.2 MB in the end (delta: -37.0 MB). Peak memory consumption was 18.6 MB. Max. memory is 8.0 GB. [2020-10-24 01:00:25,268 INFO L168 Benchmark]: TraceAbstraction took 49233.25 ms. Allocated memory was 152.0 MB in the beginning and 935.3 MB in the end (delta: 783.3 MB). Free memory was 126.8 MB in the beginning and 758.2 MB in the end (delta: -631.4 MB). Peak memory consumption was 583.8 MB. Max. memory is 8.0 GB. [2020-10-24 01:00:25,271 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.24 ms. Allocated memory is still 125.8 MB. Free memory was 102.1 MB in the beginning and 102.0 MB in the end (delta: 69.7 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 291.47 ms. Allocated memory is still 125.8 MB. Free memory was 101.6 MB in the beginning and 91.8 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 42.27 ms. Allocated memory is still 125.8 MB. Free memory was 91.8 MB in the beginning and 90.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 468.83 ms. Allocated memory was 125.8 MB in the beginning and 152.0 MB in the end (delta: 26.2 MB). Free memory was 90.2 MB in the beginning and 127.2 MB in the end (delta: -37.0 MB). Peak memory consumption was 18.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 49233.25 ms. Allocated memory was 152.0 MB in the beginning and 935.3 MB in the end (delta: 783.3 MB). Free memory was 126.8 MB in the beginning and 758.2 MB in the end (delta: -631.4 MB). Peak memory consumption was 583.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 3]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 10.7s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 38.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1939 SDtfs, 2220 SDslu, 237 SDs, 0 SdLazy, 1392 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2476occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 1048 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 100 LocationsWithAnnotation, 152 PreInvPairs, 4832 NumberOfFragments, 13960 HoareAnnotationTreeSize, 152 FomulaSimplifications, 1343345 FormulaSimplificationTreeSizeReduction, 7.8s HoareSimplificationTime, 100 FomulaSimplificationsInter, 24188 FormulaSimplificationTreeSizeReductionInter, 30.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 945 NumberOfCodeBlocks, 945 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 931 ConstructedInterpolants, 0 QuantifiedInterpolants, 103873 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...