/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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_8.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 22:00:10,406 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 22:00:10,411 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 22:00:10,453 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 22:00:10,454 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 22:00:10,461 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 22:00:10,465 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 22:00:10,468 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 22:00:10,471 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 22:00:10,474 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 22:00:10,475 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 22:00:10,476 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 22:00:10,476 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 22:00:10,478 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 22:00:10,481 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 22:00:10,482 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 22:00:10,483 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 22:00:10,484 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 22:00:10,486 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 22:00:10,494 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 22:00:10,496 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 22:00:10,497 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 22:00:10,498 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 22:00:10,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 22:00:10,514 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 22:00:10,514 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 22:00:10,515 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 22:00:10,518 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 22:00:10,518 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 22:00:10,519 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 22:00:10,519 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 22:00:10,520 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 22:00:10,521 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 22:00:10,522 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 22:00:10,523 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 22:00:10,523 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 22:00:10,524 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 22:00:10,524 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 22:00:10,524 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 22:00:10,525 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 22:00:10,526 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 22:00:10,526 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 22:00:10,538 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 22:00:10,539 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 22:00:10,542 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 22:00:10,542 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 22:00:10,543 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 22:00:10,543 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 22:00:10,544 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 22:00:10,544 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 22:00:10,544 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 22:00:10,544 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 22:00:10,544 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 22:00:10,544 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 22:00:10,545 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 22:00:10,545 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 22:00:10,545 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 22:00:10,545 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 22:00:10,545 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 22:00:10,547 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 22:00:10,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 22:00:10,547 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 22:00:10,547 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 22:00:10,548 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 22:00:10,548 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-09-04 22:00:11,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 22:00:11,024 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 22:00:11,028 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 22:00:11,029 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 22:00:11,030 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 22:00:11,031 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8.c [2020-09-04 22:00:11,111 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/71aa71991/b6a428193cb541dab42d920b017a9304/FLAG019b7de8e [2020-09-04 22:00:11,641 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 22:00:11,642 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/locks/test_locks_8.c [2020-09-04 22:00:11,653 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/71aa71991/b6a428193cb541dab42d920b017a9304/FLAG019b7de8e [2020-09-04 22:00:11,975 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/71aa71991/b6a428193cb541dab42d920b017a9304 [2020-09-04 22:00:11,990 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 22:00:11,992 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 22:00:11,994 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 22:00:11,994 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 22:00:11,998 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 22:00:11,999 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 10:00:11" (1/1) ... [2020-09-04 22:00:12,003 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30fa97df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:12, skipping insertion in model container [2020-09-04 22:00:12,004 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 10:00:11" (1/1) ... [2020-09-04 22:00:12,013 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 22:00:12,039 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 22:00:12,245 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 22:00:12,251 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 22:00:12,276 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 22:00:12,292 INFO L208 MainTranslator]: Completed translation [2020-09-04 22:00:12,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:12 WrapperNode [2020-09-04 22:00:12,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 22:00:12,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 22:00:12,294 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 22:00:12,294 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 22:00:12,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:12" (1/1) ... [2020-09-04 22:00:12,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:12" (1/1) ... [2020-09-04 22:00:12,393 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:12" (1/1) ... [2020-09-04 22:00:12,393 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:12" (1/1) ... [2020-09-04 22:00:12,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:12" (1/1) ... [2020-09-04 22:00:12,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:12" (1/1) ... [2020-09-04 22:00:12,419 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:12" (1/1) ... [2020-09-04 22:00:12,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 22:00:12,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 22:00:12,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 22:00:12,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 22:00:12,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:12" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-04 22:00:12,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 22:00:12,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 22:00:12,500 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 22:00:12,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 22:00:12,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 22:00:12,501 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 22:00:12,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 22:00:12,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 22:00:12,902 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 22:00:12,902 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-04 22:00:12,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 10:00:12 BoogieIcfgContainer [2020-09-04 22:00:12,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 22:00:12,911 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 22:00:12,911 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 22:00:12,915 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 22:00:12,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 10:00:11" (1/3) ... [2020-09-04 22:00:12,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bcf92b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 10:00:12, skipping insertion in model container [2020-09-04 22:00:12,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:12" (2/3) ... [2020-09-04 22:00:12,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bcf92b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 10:00:12, skipping insertion in model container [2020-09-04 22:00:12,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 10:00:12" (3/3) ... [2020-09-04 22:00:12,919 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2020-09-04 22:00:12,931 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 22:00:12,941 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 22:00:12,963 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 22:00:12,991 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 22:00:12,992 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 22:00:12,992 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 22:00:12,992 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 22:00:12,993 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 22:00:12,993 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 22:00:12,993 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 22:00:12,993 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 22:00:13,013 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2020-09-04 22:00:13,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-09-04 22:00:13,028 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:13,030 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] [2020-09-04 22:00:13,030 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:13,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:13,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1717644884, now seen corresponding path program 1 times [2020-09-04 22:00:13,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:13,049 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [689751948] [2020-09-04 22:00:13,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:13,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:13,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:13,323 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [689751948] [2020-09-04 22:00:13,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:13,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:13,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142534148] [2020-09-04 22:00:13,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:13,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:13,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:13,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:13,355 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 3 states. [2020-09-04 22:00:13,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:13,470 INFO L93 Difference]: Finished difference Result 213 states and 291 transitions. [2020-09-04 22:00:13,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:13,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-09-04 22:00:13,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:13,495 INFO L225 Difference]: With dead ends: 213 [2020-09-04 22:00:13,496 INFO L226 Difference]: Without dead ends: 144 [2020-09-04 22:00:13,501 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:13,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-09-04 22:00:13,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2020-09-04 22:00:13,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-09-04 22:00:13,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 186 transitions. [2020-09-04 22:00:13,577 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 186 transitions. Word has length 61 [2020-09-04 22:00:13,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:13,578 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 186 transitions. [2020-09-04 22:00:13,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:13,579 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 186 transitions. [2020-09-04 22:00:13,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-09-04 22:00:13,582 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:13,582 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] [2020-09-04 22:00:13,582 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 22:00:13,583 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:13,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:13,584 INFO L82 PathProgramCache]: Analyzing trace with hash 16380224, now seen corresponding path program 1 times [2020-09-04 22:00:13,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:13,586 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [248977412] [2020-09-04 22:00:13,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:13,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:13,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-09-04 22:00:13,700 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [248977412] [2020-09-04 22:00:13,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:13,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:13,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034847882] [2020-09-04 22:00:13,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:13,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:13,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:13,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:13,707 INFO L87 Difference]: Start difference. First operand 142 states and 186 transitions. Second operand 3 states. [2020-09-04 22:00:13,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:13,797 INFO L93 Difference]: Finished difference Result 173 states and 229 transitions. [2020-09-04 22:00:13,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:13,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-09-04 22:00:13,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:13,801 INFO L225 Difference]: With dead ends: 173 [2020-09-04 22:00:13,801 INFO L226 Difference]: Without dead ends: 171 [2020-09-04 22:00:13,802 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:13,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-09-04 22:00:13,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 142. [2020-09-04 22:00:13,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-09-04 22:00:13,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 185 transitions. [2020-09-04 22:00:13,829 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 185 transitions. Word has length 62 [2020-09-04 22:00:13,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:13,830 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 185 transitions. [2020-09-04 22:00:13,830 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:13,831 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 185 transitions. [2020-09-04 22:00:13,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-09-04 22:00:13,833 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:13,833 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] [2020-09-04 22:00:13,833 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 22:00:13,833 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:13,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:13,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1707628474, now seen corresponding path program 1 times [2020-09-04 22:00:13,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:13,835 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2051553930] [2020-09-04 22:00:13,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:13,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:13,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:13,907 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2051553930] [2020-09-04 22:00:13,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:13,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:13,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121189098] [2020-09-04 22:00:13,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:13,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:13,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:13,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:13,912 INFO L87 Difference]: Start difference. First operand 142 states and 185 transitions. Second operand 3 states. [2020-09-04 22:00:13,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:13,980 INFO L93 Difference]: Finished difference Result 346 states and 473 transitions. [2020-09-04 22:00:13,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:13,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-09-04 22:00:13,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:13,984 INFO L225 Difference]: With dead ends: 346 [2020-09-04 22:00:13,985 INFO L226 Difference]: Without dead ends: 241 [2020-09-04 22:00:13,986 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:13,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2020-09-04 22:00:14,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 239. [2020-09-04 22:00:14,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2020-09-04 22:00:14,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 320 transitions. [2020-09-04 22:00:14,037 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 320 transitions. Word has length 62 [2020-09-04 22:00:14,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:14,038 INFO L479 AbstractCegarLoop]: Abstraction has 239 states and 320 transitions. [2020-09-04 22:00:14,038 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:14,038 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 320 transitions. [2020-09-04 22:00:14,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-09-04 22:00:14,041 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:14,041 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] [2020-09-04 22:00:14,041 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 22:00:14,042 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:14,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:14,042 INFO L82 PathProgramCache]: Analyzing trace with hash -298745719, now seen corresponding path program 1 times [2020-09-04 22:00:14,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:14,043 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [304891408] [2020-09-04 22:00:14,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:14,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:14,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:14,106 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [304891408] [2020-09-04 22:00:14,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:14,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:14,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126219180] [2020-09-04 22:00:14,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:14,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:14,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:14,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:14,110 INFO L87 Difference]: Start difference. First operand 239 states and 320 transitions. Second operand 3 states. [2020-09-04 22:00:14,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:14,153 INFO L93 Difference]: Finished difference Result 293 states and 396 transitions. [2020-09-04 22:00:14,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:14,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-09-04 22:00:14,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:14,158 INFO L225 Difference]: With dead ends: 293 [2020-09-04 22:00:14,158 INFO L226 Difference]: Without dead ends: 291 [2020-09-04 22:00:14,159 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:14,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-09-04 22:00:14,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 239. [2020-09-04 22:00:14,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2020-09-04 22:00:14,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 318 transitions. [2020-09-04 22:00:14,189 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 318 transitions. Word has length 63 [2020-09-04 22:00:14,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:14,189 INFO L479 AbstractCegarLoop]: Abstraction has 239 states and 318 transitions. [2020-09-04 22:00:14,190 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:14,190 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 318 transitions. [2020-09-04 22:00:14,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-09-04 22:00:14,192 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:14,193 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] [2020-09-04 22:00:14,193 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 22:00:14,193 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:14,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:14,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1397120136, now seen corresponding path program 1 times [2020-09-04 22:00:14,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:14,194 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1412287001] [2020-09-04 22:00:14,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:14,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:14,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:14,258 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1412287001] [2020-09-04 22:00:14,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:14,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:14,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102460509] [2020-09-04 22:00:14,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:14,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:14,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:14,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:14,261 INFO L87 Difference]: Start difference. First operand 239 states and 318 transitions. Second operand 3 states. [2020-09-04 22:00:14,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:14,312 INFO L93 Difference]: Finished difference Result 631 states and 864 transitions. [2020-09-04 22:00:14,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:14,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-09-04 22:00:14,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:14,316 INFO L225 Difference]: With dead ends: 631 [2020-09-04 22:00:14,316 INFO L226 Difference]: Without dead ends: 429 [2020-09-04 22:00:14,318 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:14,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2020-09-04 22:00:14,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 427. [2020-09-04 22:00:14,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2020-09-04 22:00:14,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 574 transitions. [2020-09-04 22:00:14,357 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 574 transitions. Word has length 63 [2020-09-04 22:00:14,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:14,358 INFO L479 AbstractCegarLoop]: Abstraction has 427 states and 574 transitions. [2020-09-04 22:00:14,358 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:14,358 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 574 transitions. [2020-09-04 22:00:14,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-09-04 22:00:14,361 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:14,362 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-09-04 22:00:14,362 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 22:00:14,362 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:14,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:14,362 INFO L82 PathProgramCache]: Analyzing trace with hash 361296622, now seen corresponding path program 1 times [2020-09-04 22:00:14,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:14,363 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1624511339] [2020-09-04 22:00:14,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:14,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:14,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:14,444 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1624511339] [2020-09-04 22:00:14,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:14,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:14,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135992121] [2020-09-04 22:00:14,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:14,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:14,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:14,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:14,448 INFO L87 Difference]: Start difference. First operand 427 states and 574 transitions. Second operand 3 states. [2020-09-04 22:00:14,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:14,530 INFO L93 Difference]: Finished difference Result 1183 states and 1616 transitions. [2020-09-04 22:00:14,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:14,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-09-04 22:00:14,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:14,536 INFO L225 Difference]: With dead ends: 1183 [2020-09-04 22:00:14,536 INFO L226 Difference]: Without dead ends: 793 [2020-09-04 22:00:14,541 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:14,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2020-09-04 22:00:14,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 791. [2020-09-04 22:00:14,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-09-04 22:00:14,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1062 transitions. [2020-09-04 22:00:14,609 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1062 transitions. Word has length 64 [2020-09-04 22:00:14,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:14,610 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 1062 transitions. [2020-09-04 22:00:14,610 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:14,611 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1062 transitions. [2020-09-04 22:00:14,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-09-04 22:00:14,621 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:14,622 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-09-04 22:00:14,622 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 22:00:14,622 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:14,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:14,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1477714988, now seen corresponding path program 1 times [2020-09-04 22:00:14,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:14,628 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [581545948] [2020-09-04 22:00:14,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:14,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:14,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:14,721 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [581545948] [2020-09-04 22:00:14,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:14,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:14,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986070290] [2020-09-04 22:00:14,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:14,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:14,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:14,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:14,724 INFO L87 Difference]: Start difference. First operand 791 states and 1062 transitions. Second operand 3 states. [2020-09-04 22:00:14,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:14,826 INFO L93 Difference]: Finished difference Result 971 states and 1312 transitions. [2020-09-04 22:00:14,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:14,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-09-04 22:00:14,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:14,832 INFO L225 Difference]: With dead ends: 971 [2020-09-04 22:00:14,833 INFO L226 Difference]: Without dead ends: 969 [2020-09-04 22:00:14,834 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:14,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2020-09-04 22:00:14,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 791. [2020-09-04 22:00:14,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-09-04 22:00:14,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1054 transitions. [2020-09-04 22:00:14,894 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1054 transitions. Word has length 64 [2020-09-04 22:00:14,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:14,894 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 1054 transitions. [2020-09-04 22:00:14,894 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:14,895 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1054 transitions. [2020-09-04 22:00:14,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-09-04 22:00:14,896 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:14,897 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-09-04 22:00:14,897 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 22:00:14,897 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:14,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:14,898 INFO L82 PathProgramCache]: Analyzing trace with hash 628943709, now seen corresponding path program 1 times [2020-09-04 22:00:14,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:14,899 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1441982422] [2020-09-04 22:00:14,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:14,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:14,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:14,975 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1441982422] [2020-09-04 22:00:14,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:14,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:14,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507415724] [2020-09-04 22:00:14,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:14,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:14,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:14,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:14,977 INFO L87 Difference]: Start difference. First operand 791 states and 1054 transitions. Second operand 3 states. [2020-09-04 22:00:15,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:15,050 INFO L93 Difference]: Finished difference Result 963 states and 1288 transitions. [2020-09-04 22:00:15,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:15,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-09-04 22:00:15,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:15,056 INFO L225 Difference]: With dead ends: 963 [2020-09-04 22:00:15,056 INFO L226 Difference]: Without dead ends: 961 [2020-09-04 22:00:15,058 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:15,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2020-09-04 22:00:15,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 791. [2020-09-04 22:00:15,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-09-04 22:00:15,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1046 transitions. [2020-09-04 22:00:15,119 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1046 transitions. Word has length 65 [2020-09-04 22:00:15,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:15,119 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 1046 transitions. [2020-09-04 22:00:15,119 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:15,120 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1046 transitions. [2020-09-04 22:00:15,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-09-04 22:00:15,121 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:15,121 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-09-04 22:00:15,121 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 22:00:15,121 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:15,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:15,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1684460868, now seen corresponding path program 1 times [2020-09-04 22:00:15,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:15,123 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [815311599] [2020-09-04 22:00:15,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:15,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:15,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:15,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:15,158 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [815311599] [2020-09-04 22:00:15,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:15,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:15,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029658587] [2020-09-04 22:00:15,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:15,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:15,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:15,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:15,160 INFO L87 Difference]: Start difference. First operand 791 states and 1046 transitions. Second operand 3 states. [2020-09-04 22:00:15,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:15,290 INFO L93 Difference]: Finished difference Result 2251 states and 3000 transitions. [2020-09-04 22:00:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:15,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-09-04 22:00:15,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:15,299 INFO L225 Difference]: With dead ends: 2251 [2020-09-04 22:00:15,299 INFO L226 Difference]: Without dead ends: 1497 [2020-09-04 22:00:15,301 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:15,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2020-09-04 22:00:15,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1495. [2020-09-04 22:00:15,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1495 states. [2020-09-04 22:00:15,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1958 transitions. [2020-09-04 22:00:15,411 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 1958 transitions. Word has length 65 [2020-09-04 22:00:15,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:15,412 INFO L479 AbstractCegarLoop]: Abstraction has 1495 states and 1958 transitions. [2020-09-04 22:00:15,412 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:15,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1958 transitions. [2020-09-04 22:00:15,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-09-04 22:00:15,414 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:15,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] [2020-09-04 22:00:15,414 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 22:00:15,415 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:15,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:15,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1510854248, now seen corresponding path program 1 times [2020-09-04 22:00:15,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:15,415 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [363382986] [2020-09-04 22:00:15,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:15,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:15,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:15,454 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [363382986] [2020-09-04 22:00:15,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:15,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:15,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716126538] [2020-09-04 22:00:15,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:15,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:15,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:15,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:15,456 INFO L87 Difference]: Start difference. First operand 1495 states and 1958 transitions. Second operand 3 states. [2020-09-04 22:00:15,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:15,600 INFO L93 Difference]: Finished difference Result 1803 states and 2360 transitions. [2020-09-04 22:00:15,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:15,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-09-04 22:00:15,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:15,636 INFO L225 Difference]: With dead ends: 1803 [2020-09-04 22:00:15,636 INFO L226 Difference]: Without dead ends: 1801 [2020-09-04 22:00:15,637 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:15,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2020-09-04 22:00:15,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1495. [2020-09-04 22:00:15,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1495 states. [2020-09-04 22:00:15,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1942 transitions. [2020-09-04 22:00:15,748 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 1942 transitions. Word has length 66 [2020-09-04 22:00:15,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:15,749 INFO L479 AbstractCegarLoop]: Abstraction has 1495 states and 1942 transitions. [2020-09-04 22:00:15,749 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:15,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1942 transitions. [2020-09-04 22:00:15,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-09-04 22:00:15,751 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:15,751 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-09-04 22:00:15,751 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 22:00:15,752 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:15,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:15,752 INFO L82 PathProgramCache]: Analyzing trace with hash -678433246, now seen corresponding path program 1 times [2020-09-04 22:00:15,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:15,753 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [929476099] [2020-09-04 22:00:15,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:15,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:15,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:15,793 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [929476099] [2020-09-04 22:00:15,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:15,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:15,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799301200] [2020-09-04 22:00:15,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:15,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:15,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:15,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:15,795 INFO L87 Difference]: Start difference. First operand 1495 states and 1942 transitions. Second operand 3 states. [2020-09-04 22:00:16,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:16,014 INFO L93 Difference]: Finished difference Result 4315 states and 5624 transitions. [2020-09-04 22:00:16,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:16,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-09-04 22:00:16,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:16,029 INFO L225 Difference]: With dead ends: 4315 [2020-09-04 22:00:16,029 INFO L226 Difference]: Without dead ends: 2857 [2020-09-04 22:00:16,034 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:16,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2020-09-04 22:00:16,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 2855. [2020-09-04 22:00:16,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2855 states. [2020-09-04 22:00:16,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2855 states to 2855 states and 3654 transitions. [2020-09-04 22:00:16,246 INFO L78 Accepts]: Start accepts. Automaton has 2855 states and 3654 transitions. Word has length 66 [2020-09-04 22:00:16,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:16,247 INFO L479 AbstractCegarLoop]: Abstraction has 2855 states and 3654 transitions. [2020-09-04 22:00:16,247 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:16,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2855 states and 3654 transitions. [2020-09-04 22:00:16,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-09-04 22:00:16,250 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:16,250 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-09-04 22:00:16,250 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 22:00:16,250 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:16,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:16,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1214689743, now seen corresponding path program 1 times [2020-09-04 22:00:16,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:16,252 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [820331259] [2020-09-04 22:00:16,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:16,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:16,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:16,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:16,287 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [820331259] [2020-09-04 22:00:16,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:16,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:16,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242105901] [2020-09-04 22:00:16,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:16,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:16,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:16,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:16,289 INFO L87 Difference]: Start difference. First operand 2855 states and 3654 transitions. Second operand 3 states. [2020-09-04 22:00:16,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:16,493 INFO L93 Difference]: Finished difference Result 3403 states and 4328 transitions. [2020-09-04 22:00:16,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:16,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2020-09-04 22:00:16,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:16,510 INFO L225 Difference]: With dead ends: 3403 [2020-09-04 22:00:16,510 INFO L226 Difference]: Without dead ends: 3401 [2020-09-04 22:00:16,511 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:16,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3401 states. [2020-09-04 22:00:16,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3401 to 2855. [2020-09-04 22:00:16,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2855 states. [2020-09-04 22:00:16,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2855 states to 2855 states and 3622 transitions. [2020-09-04 22:00:16,720 INFO L78 Accepts]: Start accepts. Automaton has 2855 states and 3622 transitions. Word has length 67 [2020-09-04 22:00:16,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:16,721 INFO L479 AbstractCegarLoop]: Abstraction has 2855 states and 3622 transitions. [2020-09-04 22:00:16,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:16,721 INFO L276 IsEmpty]: Start isEmpty. Operand 2855 states and 3622 transitions. [2020-09-04 22:00:16,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-09-04 22:00:16,724 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:16,724 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-09-04 22:00:16,724 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 22:00:16,725 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:16,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:16,725 INFO L82 PathProgramCache]: Analyzing trace with hash 443652336, now seen corresponding path program 1 times [2020-09-04 22:00:16,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:16,726 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2143001716] [2020-09-04 22:00:16,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:16,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:16,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:16,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:16,760 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2143001716] [2020-09-04 22:00:16,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:16,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:16,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882231600] [2020-09-04 22:00:16,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:16,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:16,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:16,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:16,763 INFO L87 Difference]: Start difference. First operand 2855 states and 3622 transitions. Second operand 3 states. [2020-09-04 22:00:17,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:17,123 INFO L93 Difference]: Finished difference Result 8299 states and 10536 transitions. [2020-09-04 22:00:17,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:17,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2020-09-04 22:00:17,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:17,149 INFO L225 Difference]: With dead ends: 8299 [2020-09-04 22:00:17,149 INFO L226 Difference]: Without dead ends: 5481 [2020-09-04 22:00:17,158 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:17,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5481 states. [2020-09-04 22:00:17,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5481 to 5479. [2020-09-04 22:00:17,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5479 states. [2020-09-04 22:00:17,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5479 states to 5479 states and 6822 transitions. [2020-09-04 22:00:17,563 INFO L78 Accepts]: Start accepts. Automaton has 5479 states and 6822 transitions. Word has length 67 [2020-09-04 22:00:17,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:17,563 INFO L479 AbstractCegarLoop]: Abstraction has 5479 states and 6822 transitions. [2020-09-04 22:00:17,564 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:17,564 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 6822 transitions. [2020-09-04 22:00:17,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-09-04 22:00:17,568 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:17,568 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-09-04 22:00:17,568 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 22:00:17,569 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:17,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:17,569 INFO L82 PathProgramCache]: Analyzing trace with hash 192792828, now seen corresponding path program 1 times [2020-09-04 22:00:17,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:17,570 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [664741665] [2020-09-04 22:00:17,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:17,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:17,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:17,597 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [664741665] [2020-09-04 22:00:17,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:17,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:17,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28143589] [2020-09-04 22:00:17,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:17,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:17,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:17,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:17,599 INFO L87 Difference]: Start difference. First operand 5479 states and 6822 transitions. Second operand 3 states. [2020-09-04 22:00:18,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:18,017 INFO L93 Difference]: Finished difference Result 6443 states and 7912 transitions. [2020-09-04 22:00:18,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:18,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2020-09-04 22:00:18,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:18,044 INFO L225 Difference]: With dead ends: 6443 [2020-09-04 22:00:18,044 INFO L226 Difference]: Without dead ends: 6441 [2020-09-04 22:00:18,046 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:18,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6441 states. [2020-09-04 22:00:18,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6441 to 5479. [2020-09-04 22:00:18,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5479 states. [2020-09-04 22:00:18,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5479 states to 5479 states and 6758 transitions. [2020-09-04 22:00:18,411 INFO L78 Accepts]: Start accepts. Automaton has 5479 states and 6758 transitions. Word has length 68 [2020-09-04 22:00:18,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:18,412 INFO L479 AbstractCegarLoop]: Abstraction has 5479 states and 6758 transitions. [2020-09-04 22:00:18,412 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:18,412 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 6758 transitions. [2020-09-04 22:00:18,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-09-04 22:00:18,417 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:18,417 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-09-04 22:00:18,417 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 22:00:18,418 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:18,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:18,418 INFO L82 PathProgramCache]: Analyzing trace with hash 868567382, now seen corresponding path program 1 times [2020-09-04 22:00:18,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:18,419 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1810440776] [2020-09-04 22:00:18,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:18,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:18,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:18,452 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1810440776] [2020-09-04 22:00:18,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:18,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:18,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063427399] [2020-09-04 22:00:18,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:18,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:18,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:18,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:18,454 INFO L87 Difference]: Start difference. First operand 5479 states and 6758 transitions. Second operand 3 states. [2020-09-04 22:00:19,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:19,045 INFO L93 Difference]: Finished difference Result 15977 states and 19687 transitions. [2020-09-04 22:00:19,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:19,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2020-09-04 22:00:19,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:19,070 INFO L225 Difference]: With dead ends: 15977 [2020-09-04 22:00:19,070 INFO L226 Difference]: Without dead ends: 5479 [2020-09-04 22:00:19,091 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:19,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2020-09-04 22:00:19,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5479. [2020-09-04 22:00:19,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5479 states. [2020-09-04 22:00:19,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5479 states to 5479 states and 6502 transitions. [2020-09-04 22:00:19,511 INFO L78 Accepts]: Start accepts. Automaton has 5479 states and 6502 transitions. Word has length 68 [2020-09-04 22:00:19,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:19,512 INFO L479 AbstractCegarLoop]: Abstraction has 5479 states and 6502 transitions. [2020-09-04 22:00:19,512 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:19,512 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 6502 transitions. [2020-09-04 22:00:19,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-09-04 22:00:19,517 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:19,517 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-09-04 22:00:19,517 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 22:00:19,517 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:19,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:19,518 INFO L82 PathProgramCache]: Analyzing trace with hash 875079941, now seen corresponding path program 1 times [2020-09-04 22:00:19,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:19,518 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1349775210] [2020-09-04 22:00:19,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:19,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:19,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:19,551 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1349775210] [2020-09-04 22:00:19,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:19,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:19,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529270608] [2020-09-04 22:00:19,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:19,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:19,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:19,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:19,554 INFO L87 Difference]: Start difference. First operand 5479 states and 6502 transitions. Second operand 3 states. [2020-09-04 22:00:19,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:19,724 INFO L93 Difference]: Finished difference Result 5479 states and 6502 transitions. [2020-09-04 22:00:19,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:19,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2020-09-04 22:00:19,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:19,727 INFO L225 Difference]: With dead ends: 5479 [2020-09-04 22:00:19,727 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 22:00:19,737 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:19,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 22:00:19,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 22:00:19,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 22:00:19,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 22:00:19,739 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2020-09-04 22:00:19,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:19,739 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 22:00:19,739 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:19,739 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 22:00:19,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 22:00:19,740 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 22:00:19,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 22:00:21,409 WARN L193 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 289 DAG size of output: 159 [2020-09-04 22:00:21,555 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 23 [2020-09-04 22:00:22,491 WARN L193 SmtUtils]: Spent 932.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2020-09-04 22:00:22,776 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 57 [2020-09-04 22:00:22,996 WARN L193 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 55 [2020-09-04 22:00:23,492 WARN L193 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 387 DAG size of output: 23 [2020-09-04 22:00:23,966 WARN L193 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 352 DAG size of output: 11 [2020-09-04 22:00:24,748 WARN L193 SmtUtils]: Spent 779.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2020-09-04 22:00:25,227 WARN L193 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 93 [2020-09-04 22:00:25,407 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 37 [2020-09-04 22:00:25,725 WARN L193 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 279 DAG size of output: 15 [2020-09-04 22:00:26,329 WARN L193 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 482 DAG size of output: 15 [2020-09-04 22:00:26,748 WARN L193 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 542 DAG size of output: 3 [2020-09-04 22:00:27,085 WARN L193 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 283 DAG size of output: 35 [2020-09-04 22:00:28,321 WARN L193 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 293 DAG size of output: 159 [2020-09-04 22:00:28,550 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 57 [2020-09-04 22:00:28,714 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 25 [2020-09-04 22:00:29,385 WARN L193 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 91 [2020-09-04 22:00:30,604 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 671 DAG size of output: 7 [2020-09-04 22:00:32,993 WARN L193 SmtUtils]: Spent 2.38 s on a formula simplification that was a NOOP. DAG size: 291 [2020-09-04 22:00:33,659 WARN L193 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 91 [2020-09-04 22:00:33,791 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 35 [2020-09-04 22:00:33,961 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 37 [2020-09-04 22:00:34,196 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 17 [2020-09-04 22:00:34,567 WARN L193 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 91 [2020-09-04 22:00:35,419 WARN L193 SmtUtils]: Spent 850.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2020-09-04 22:00:35,665 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 275 DAG size of output: 7 [2020-09-04 22:00:36,128 WARN L193 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 321 DAG size of output: 55 [2020-09-04 22:00:36,295 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 25 [2020-09-04 22:00:36,688 WARN L193 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 352 DAG size of output: 11 [2020-09-04 22:00:36,973 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 281 DAG size of output: 23 [2020-09-04 22:00:37,401 WARN L193 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 93 [2020-09-04 22:00:37,825 WARN L193 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 285 DAG size of output: 55 [2020-09-04 22:00:38,296 WARN L193 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 340 DAG size of output: 35 [2020-09-04 22:00:38,523 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 17 [2020-09-04 22:00:38,945 WARN L193 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 542 DAG size of output: 3 [2020-09-04 22:00:41,894 WARN L193 SmtUtils]: Spent 2.94 s on a formula simplification that was a NOOP. DAG size: 159 [2020-09-04 22:00:45,478 WARN L193 SmtUtils]: Spent 3.51 s on a formula simplification that was a NOOP. DAG size: 161 [2020-09-04 22:00:45,954 WARN L193 SmtUtils]: Spent 473.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-09-04 22:00:46,358 WARN L193 SmtUtils]: Spent 400.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-09-04 22:00:49,480 WARN L193 SmtUtils]: Spent 3.04 s on a formula simplification that was a NOOP. DAG size: 159 [2020-09-04 22:00:50,698 WARN L193 SmtUtils]: Spent 1.22 s on a formula simplification that was a NOOP. DAG size: 93 [2020-09-04 22:00:50,887 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-09-04 22:00:51,111 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-09-04 22:00:54,252 WARN L193 SmtUtils]: Spent 3.14 s on a formula simplification that was a NOOP. DAG size: 159 [2020-09-04 22:00:54,734 WARN L193 SmtUtils]: Spent 478.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-09-04 22:00:55,900 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 91 [2020-09-04 22:01:05,639 WARN L193 SmtUtils]: Spent 9.69 s on a formula simplification that was a NOOP. DAG size: 291 [2020-09-04 22:01:06,741 WARN L193 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 91 [2020-09-04 22:01:06,900 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-09-04 22:01:07,092 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-09-04 22:01:08,223 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 91 [2020-09-04 22:01:11,659 WARN L193 SmtUtils]: Spent 3.43 s on a formula simplification that was a NOOP. DAG size: 161 [2020-09-04 22:01:12,075 WARN L193 SmtUtils]: Spent 401.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-09-04 22:01:13,483 WARN L193 SmtUtils]: Spent 1.24 s on a formula simplification that was a NOOP. DAG size: 93 [2020-09-04 22:01:13,895 WARN L193 SmtUtils]: Spent 407.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-09-04 22:01:14,059 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-09-04 22:01:14,109 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 22:01:14,109 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 22:01:14,109 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 22:01:14,109 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 22:01:14,109 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 22:01:14,109 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 22:01:14,109 INFO L264 CegarLoopResult]: At program point L126(line 126) the Hoare annotation is: (= main_~lk8~0 1) [2020-09-04 22:01:14,110 INFO L264 CegarLoopResult]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2020-09-04 22:01:14,110 INFO L271 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-09-04 22:01:14,110 INFO L264 CegarLoopResult]: At program point L60-1(lines 33 130) 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-09-04 22:01:14,110 INFO L271 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: true [2020-09-04 22:01:14,110 INFO L271 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: true [2020-09-04 22:01:14,111 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 4 135) the Hoare annotation is: true [2020-09-04 22:01:14,113 INFO L264 CegarLoopResult]: At program point L85(line 85) the Hoare annotation is: (let ((.cse13 (= main_~p1~0 0)) (.cse7 (= main_~lk4~0 1)) (.cse11 (= main_~p2~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse12 (= main_~lk6~0 1)) (.cse9 (= main_~lk5~0 1)) (.cse6 (= main_~lk7~0 1)) (.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))) (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 .cse7 .cse0 .cse2 .cse3 .cse10 .cse12 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse13) (and .cse8 .cse3 .cse10 .cse12 .cse4 .cse9 .cse5) (and .cse7 .cse1 .cse8 .cse10 .cse13 .cse9 .cse11) (and .cse8 .cse2 .cse3 .cse10 .cse12 .cse4 .cse13) (and .cse7 .cse0 .cse2 .cse3 .cse12 .cse5 .cse6) (and .cse7 .cse8 .cse3 .cse10 .cse12 .cse9 .cse5) (and .cse7 .cse0 .cse2 .cse10 .cse12 .cse13 .cse11) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse13 .cse6) (and .cse0 .cse3 .cse12 .cse4 .cse13 .cse9 .cse6) (and .cse7 .cse1 .cse8 .cse10 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse13 .cse9 .cse6) (and .cse8 .cse3 .cse12 .cse4 .cse9 .cse5 .cse6) (and .cse0 .cse10 .cse12 .cse4 .cse9 .cse11 .cse5) (and .cse0 .cse2 .cse12 .cse4 .cse13 .cse11 .cse6) (and .cse8 .cse12 .cse4 .cse13 .cse9 .cse11 .cse6) (and .cse7 .cse8 .cse2 .cse3 .cse10 .cse12 .cse5) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse13 .cse6) (and .cse7 .cse0 .cse3 .cse12 .cse9 .cse5 .cse6) (and .cse0 .cse3 .cse10 .cse12 .cse4 .cse9 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse10 .cse13 .cse11) (and .cse1 .cse8 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse12 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse12 .cse4 .cse13 .cse6) (and .cse0 .cse12 .cse4 .cse13 .cse9 .cse11 .cse6) (and .cse0 .cse1 .cse4 .cse13 .cse9 .cse11 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse12 .cse4 .cse13) (and .cse7 .cse0 .cse1 .cse2 .cse13 .cse11 .cse6) (and .cse7 .cse8 .cse10 .cse12 .cse9 .cse11 .cse5) (and .cse0 .cse1 .cse10 .cse4 .cse13 .cse9 .cse11) (and .cse8 .cse12 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse12 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse13 .cse9 .cse11 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5 .cse6) (and .cse8 .cse3 .cse12 .cse4 .cse13 .cse9 .cse6) (and .cse1 .cse8 .cse3 .cse10 .cse4 .cse9 .cse5) (and .cse7 .cse1 .cse8 .cse3 .cse10 .cse13 .cse9) (and .cse0 .cse2 .cse12 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse10 .cse5) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse9 .cse5 .cse6) (and .cse8 .cse2 .cse10 .cse12 .cse4 .cse13 .cse11) (and .cse7 .cse0 .cse2 .cse12 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse3 .cse10 .cse12 .cse13 .cse9) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse10 .cse12 .cse9 .cse11 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse13) (and .cse0 .cse2 .cse10 .cse12 .cse4 .cse11 .cse5) (and .cse7 .cse8 .cse10 .cse12 .cse13 .cse9 .cse11) (and .cse7 .cse1 .cse8 .cse3 .cse10 .cse9 .cse5) (and .cse1 .cse8 .cse10 .cse4 .cse13 .cse9 .cse11) (and .cse8 .cse10 .cse12 .cse4 .cse13 .cse9 .cse11) (and .cse7 .cse8 .cse2 .cse3 .cse10 .cse12 .cse13) (and .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse13) (and .cse0 .cse2 .cse3 .cse10 .cse12 .cse4 .cse5) (and .cse7 .cse0 .cse3 .cse12 .cse13 .cse9 .cse6) (and .cse7 .cse0 .cse2 .cse12 .cse13 .cse11 .cse6) (and .cse8 .cse2 .cse3 .cse12 .cse4 .cse13 .cse6) (and .cse8 .cse2 .cse3 .cse12 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse4 .cse13 .cse11 .cse6) (and .cse0 .cse2 .cse3 .cse12 .cse4 .cse5 .cse6) (and .cse8 .cse2 .cse12 .cse4 .cse13 .cse11 .cse6) (and .cse1 .cse8 .cse2 .cse4 .cse11 .cse5 .cse6) (and .cse0 .cse10 .cse12 .cse4 .cse13 .cse9 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse10 .cse13 .cse9) (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 .cse1 .cse8 .cse2 .cse13 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6) (and .cse8 .cse10 .cse12 .cse4 .cse9 .cse11 .cse5) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse13 .cse9) (and .cse7 .cse1 .cse8 .cse2 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse3 .cse12 .cse9 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse10 .cse12 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse10 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse10 .cse13 .cse11) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse10 .cse13) (and .cse7 .cse8 .cse2 .cse3 .cse12 .cse5 .cse6) (and .cse1 .cse8 .cse4 .cse13 .cse9 .cse11 .cse6) (and .cse7 .cse8 .cse2 .cse12 .cse13 .cse11 .cse6) (and .cse7 .cse8 .cse2 .cse12 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse10 .cse13 .cse9 .cse11) (and .cse1 .cse8 .cse3 .cse10 .cse4 .cse13 .cse9) (and .cse7 .cse0 .cse10 .cse12 .cse13 .cse9 .cse11) (and .cse7 .cse8 .cse2 .cse3 .cse12 .cse13 .cse6) (and .cse0 .cse1 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse13 .cse9 .cse6) (and .cse1 .cse8 .cse3 .cse4 .cse13 .cse9 .cse6) (and .cse1 .cse8 .cse2 .cse4 .cse13 .cse11 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse12 .cse13 .cse6) (and .cse8 .cse2 .cse12 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse10 .cse12 .cse13 .cse11) (and .cse7 .cse8 .cse3 .cse12 .cse13 .cse9 .cse6) (and .cse0 .cse3 .cse10 .cse12 .cse4 .cse13 .cse9) (and .cse7 .cse8 .cse2 .cse10 .cse12 .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 .cse12 .cse4 .cse5) (and .cse8 .cse3 .cse10 .cse12 .cse4 .cse13 .cse9) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse13 .cse11) (and .cse7 .cse8 .cse3 .cse10 .cse12 .cse13 .cse9) (and .cse7 .cse1 .cse8 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse12 .cse13 .cse9 .cse11 .cse6) (and .cse7 .cse0 .cse3 .cse10 .cse12 .cse9 .cse5) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse12 .cse13) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse9 .cse5) (and .cse1 .cse8 .cse2 .cse10 .cse4 .cse13 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse13 .cse9 .cse6) (and .cse8 .cse2 .cse10 .cse12 .cse4 .cse11 .cse5) (and .cse7 .cse8 .cse12 .cse13 .cse9 .cse11 .cse6) (and .cse7 .cse0 .cse1 .cse13 .cse9 .cse11 .cse6) (and .cse0 .cse2 .cse10 .cse12 .cse4 .cse13 .cse11) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse13 .cse6) (and .cse7 .cse8 .cse12 .cse9 .cse11 .cse5 .cse6) (and .cse1 .cse8 .cse10 .cse4 .cse9 .cse11 .cse5) (and .cse0 .cse3 .cse12 .cse4 .cse9 .cse5 .cse6) (and .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse5))) [2020-09-04 22:01:14,113 INFO L271 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: true [2020-09-04 22:01:14,113 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-09-04 22:01:14,114 INFO L264 CegarLoopResult]: At program point L77(line 77) the Hoare annotation is: (let ((.cse0 (= main_~lk3~0 1)) (.cse2 (= main_~p4~0 0)) (.cse4 (= main_~lk1~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse6 (= main_~p2~0 0)) (.cse7 (= main_~lk4~0 1)) (.cse8 (= 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 .cse0 .cse5 .cse6 .cse4) (and .cse8 .cse5 .cse2 .cse6 .cse4) (and .cse8 .cse5 .cse1 .cse2 .cse4) (and .cse7 .cse8 .cse5 .cse1 .cse4) (and .cse7 .cse0 .cse1 .cse3 .cse4) (and .cse7 .cse0 .cse5 .cse1 .cse4) (and .cse7 .cse8 .cse5 .cse6 .cse4) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse7 .cse8 .cse1 .cse3 .cse4) (and .cse7 .cse0 .cse9 .cse3 .cse6) (and .cse0 .cse5 .cse1 .cse2 .cse4) (and .cse0 .cse5 .cse2 .cse9 .cse6) (and .cse7 .cse8 .cse3 .cse6 .cse4) (and .cse8 .cse2 .cse9 .cse3 .cse6) (and .cse7 .cse0 .cse5 .cse1 .cse9) (and .cse8 .cse1 .cse2 .cse9 .cse3) (and .cse0 .cse2 .cse9 .cse3 .cse6) (and .cse8 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse8 .cse1 .cse9 .cse3) (and .cse7 .cse0 .cse5 .cse9 .cse6) (and .cse7 .cse0 .cse1 .cse9 .cse3) (and .cse7 .cse8 .cse5 .cse9 .cse6) (and .cse0 .cse5 .cse1 .cse2 .cse9) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse0 .cse3 .cse6 .cse4) (and .cse8 .cse5 .cse2 .cse9 .cse6) (and .cse8 .cse1 .cse2 .cse3 .cse4) (and .cse7 .cse8 .cse9 .cse3 .cse6) (and .cse7 .cse8 .cse5 .cse1 .cse9))) [2020-09-04 22:01:14,114 INFO L264 CegarLoopResult]: At program point L110-1(lines 33 130) the Hoare annotation is: (let ((.cse1 (= main_~p8~0 0)) (.cse0 (= main_~p6~0 0)) (.cse3 (= main_~p7~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse5 (= main_~lk8~0 1)) (.cse2 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse4) (and .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse3) (and .cse0 .cse5 .cse2) (and .cse1 .cse4 .cse2) (and .cse0 .cse3 .cse5) (and .cse4 .cse5 .cse2))) [2020-09-04 22:01:14,114 INFO L271 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: true [2020-09-04 22:01:14,115 INFO L264 CegarLoopResult]: At program point L102(line 102) the Hoare annotation is: (let ((.cse10 (= main_~p7~0 0)) (.cse9 (= main_~p5~0 0)) (.cse3 (= main_~p4~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse7 (= main_~lk8~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse6 (= main_~p6~0 0)) (.cse1 (= main_~p8~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse5 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse7) (and .cse0 .cse6 .cse9 .cse10 .cse7 .cse3) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse5) (and .cse8 .cse0 .cse6 .cse10 .cse7 .cse4) (and .cse0 .cse10 .cse2 .cse7 .cse3 .cse4) (and .cse0 .cse6 .cse1 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse10 .cse3 .cse4) (and .cse0 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse9 .cse2 .cse7 .cse5) (and .cse0 .cse6 .cse9 .cse7 .cse3 .cse5) (and .cse0 .cse6 .cse10 .cse7 .cse3 .cse4) (and .cse0 .cse9 .cse10 .cse2 .cse7 .cse3) (and .cse0 .cse9 .cse2 .cse7 .cse3 .cse5) (and .cse8 .cse0 .cse6 .cse1 .cse10 .cse4) (and .cse8 .cse0 .cse6 .cse9 .cse10 .cse7) (and .cse8 .cse0 .cse1 .cse10 .cse2 .cse4) (and .cse8 .cse0 .cse10 .cse2 .cse7 .cse4) (and .cse8 .cse0 .cse6 .cse9 .cse7 .cse5) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse8 .cse0 .cse1 .cse9 .cse10 .cse2) (and .cse0 .cse6 .cse1 .cse9 .cse3 .cse5) (and .cse8 .cse0 .cse6 .cse1 .cse9 .cse10) (and .cse0 .cse6 .cse1 .cse9 .cse10 .cse3) (and .cse0 .cse1 .cse10 .cse2 .cse3 .cse4) (and .cse8 .cse0 .cse6 .cse1 .cse9 .cse5) (and .cse0 .cse1 .cse9 .cse10 .cse2 .cse3) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5) (and .cse8 .cse0 .cse2 .cse7 .cse4 .cse5) (and .cse8 .cse0 .cse6 .cse1 .cse4 .cse5))) [2020-09-04 22:01:14,115 INFO L264 CegarLoopResult]: At program point L69(line 69) 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-09-04 22:01:14,115 INFO L264 CegarLoopResult]: At program point L127(line 127) the Hoare annotation is: (= main_~lk8~0 1) [2020-09-04 22:01:14,115 INFO L264 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-09-04 22:01:14,115 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-09-04 22:01:14,116 INFO L264 CegarLoopResult]: At program point L111(line 111) the Hoare annotation is: (let ((.cse3 (= main_~lk7~0 1)) (.cse0 (= main_~lk6~0 1)) (.cse1 (= main_~lk8~0 1)) (.cse4 (= main_~p6~0 0)) (.cse5 (= main_~p8~0 0)) (.cse6 (= main_~p7~0 0)) (.cse2 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3) (and .cse5 .cse0 .cse2 .cse3) (and .cse4 .cse5 .cse2 .cse3) (and .cse4 .cse6 .cse1 .cse2) (and .cse5 .cse6 .cse0 .cse2) (and .cse6 .cse0 .cse1 .cse2) (and .cse4 .cse5 .cse6 .cse2))) [2020-09-04 22:01:14,116 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-09-04 22:01:14,116 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-09-04 22:01:14,116 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-09-04 22:01:14,116 INFO L264 CegarLoopResult]: At program point L95-1(lines 33 130) the Hoare annotation is: (let ((.cse9 (= main_~p7~0 0)) (.cse3 (= main_~p3~0 0)) (.cse11 (= main_~p5~0 0)) (.cse7 (= main_~lk6~0 1)) (.cse10 (= main_~lk8~0 1)) (.cse8 (= main_~p4~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse1 (= main_~p6~0 0)) (.cse2 (= main_~p8~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse5 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse2 .cse7 .cse8 .cse4 .cse5) (and .cse0 .cse3 .cse9 .cse7 .cse10 .cse4) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse11 .cse7 .cse5) (and .cse1 .cse3 .cse11 .cse9 .cse10 .cse8) (and .cse3 .cse11 .cse9 .cse7 .cse10 .cse8) (and .cse1 .cse3 .cse11 .cse10 .cse8 .cse5) (and .cse0 .cse1 .cse3 .cse11 .cse9 .cse10) (and .cse2 .cse3 .cse11 .cse7 .cse8 .cse5) (and .cse6 .cse11 .cse7 .cse10 .cse8 .cse5) (and .cse2 .cse3 .cse7 .cse8 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse11 .cse9 .cse10) (and .cse0 .cse6 .cse2 .cse9 .cse7 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse5) (and .cse0 .cse6 .cse9 .cse7 .cse10 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4) (and .cse0 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse11 .cse9 .cse7) (and .cse1 .cse3 .cse9 .cse10 .cse8 .cse4) (and .cse0 .cse1 .cse3 .cse11 .cse10 .cse5) (and .cse6 .cse1 .cse2 .cse11 .cse8 .cse5) (and .cse0 .cse6 .cse1 .cse2 .cse11 .cse5) (and .cse6 .cse2 .cse11 .cse9 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse9 .cse10 .cse4) (and .cse3 .cse7 .cse10 .cse8 .cse4 .cse5) (and .cse3 .cse9 .cse7 .cse10 .cse8 .cse4) (and .cse0 .cse2 .cse3 .cse11 .cse9 .cse7) (and .cse6 .cse1 .cse10 .cse8 .cse4 .cse5) (and .cse0 .cse6 .cse11 .cse9 .cse7 .cse10) (and .cse1 .cse3 .cse10 .cse8 .cse4 .cse5) (and .cse6 .cse1 .cse11 .cse9 .cse10 .cse8) (and .cse1 .cse2 .cse3 .cse11 .cse8 .cse5) (and .cse1 .cse2 .cse3 .cse11 .cse9 .cse8) (and .cse0 .cse6 .cse1 .cse9 .cse10 .cse4) (and .cse6 .cse9 .cse7 .cse10 .cse8 .cse4) (and .cse2 .cse3 .cse9 .cse7 .cse8 .cse4) (and .cse1 .cse2 .cse3 .cse8 .cse4 .cse5) (and .cse6 .cse1 .cse2 .cse8 .cse4 .cse5) (and .cse0 .cse3 .cse7 .cse10 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse10 .cse4 .cse5) (and .cse6 .cse1 .cse2 .cse9 .cse8 .cse4) (and .cse6 .cse7 .cse10 .cse8 .cse4 .cse5) (and .cse0 .cse6 .cse11 .cse7 .cse10 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse9) (and .cse0 .cse3 .cse11 .cse9 .cse7 .cse10) (and .cse6 .cse1 .cse11 .cse10 .cse8 .cse5) (and .cse6 .cse1 .cse9 .cse10 .cse8 .cse4) (and .cse6 .cse11 .cse9 .cse7 .cse10 .cse8) (and .cse0 .cse6 .cse1 .cse2 .cse9 .cse4) (and .cse1 .cse2 .cse3 .cse9 .cse8 .cse4) (and .cse0 .cse6 .cse1 .cse11 .cse10 .cse5) (and .cse0 .cse6 .cse2 .cse7 .cse4 .cse5) (and .cse2 .cse3 .cse11 .cse9 .cse7 .cse8) (and .cse0 .cse6 .cse1 .cse2 .cse11 .cse9) (and .cse6 .cse1 .cse2 .cse11 .cse9 .cse8) (and .cse6 .cse2 .cse9 .cse7 .cse8 .cse4) (and .cse0 .cse3 .cse11 .cse7 .cse10 .cse5) (and .cse6 .cse2 .cse11 .cse7 .cse8 .cse5) (and .cse0 .cse6 .cse7 .cse10 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse9 .cse7 .cse4) (and .cse0 .cse2 .cse3 .cse11 .cse7 .cse5) (and .cse3 .cse11 .cse7 .cse10 .cse8 .cse5) (and .cse0 .cse6 .cse1 .cse2 .cse4 .cse5))) [2020-09-04 22:01:14,117 INFO L264 CegarLoopResult]: At program point L120-1(lines 33 130) the Hoare annotation is: (or (= main_~p8~0 0) (= main_~lk8~0 1)) [2020-09-04 22:01:14,117 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-09-04 22:01:14,117 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-09-04 22:01:14,117 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-09-04 22:01:14,117 INFO L264 CegarLoopResult]: At program point L112(line 112) the Hoare annotation is: (let ((.cse3 (= main_~lk7~0 1)) (.cse0 (= main_~lk6~0 1)) (.cse1 (= main_~lk8~0 1)) (.cse4 (= main_~p6~0 0)) (.cse5 (= main_~p8~0 0)) (.cse6 (= main_~p7~0 0)) (.cse2 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3) (and .cse5 .cse0 .cse2 .cse3) (and .cse4 .cse5 .cse2 .cse3) (and .cse4 .cse6 .cse1 .cse2) (and .cse5 .cse6 .cse0 .cse2) (and .cse6 .cse0 .cse1 .cse2) (and .cse4 .cse5 .cse6 .cse2))) [2020-09-04 22:01:14,117 INFO L271 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: true [2020-09-04 22:01:14,117 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-09-04 22:01:14,117 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 4 135) the Hoare annotation is: true [2020-09-04 22:01:14,118 INFO L271 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: true [2020-09-04 22:01:14,118 INFO L264 CegarLoopResult]: At program point L96(line 96) the Hoare annotation is: (let ((.cse4 (= main_~lk8~0 1)) (.cse0 (= main_~p3~0 0)) (.cse7 (= main_~p5~0 0)) (.cse2 (= main_~p7~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse5 (= main_~p4~0 0)) (.cse12 (= main_~lk4~0 1)) (.cse10 (= main_~lk3~0 1)) (.cse11 (= main_~p6~0 0)) (.cse8 (= main_~p8~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse6 (= main_~lk5~0 1)) (.cse9 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse7 .cse1 .cse3 .cse5 .cse9) (and .cse10 .cse11 .cse7 .cse1 .cse2 .cse4 .cse5) (and .cse12 .cse0 .cse7 .cse1 .cse3 .cse4 .cse9) (and .cse10 .cse8 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse10 .cse11 .cse1 .cse4 .cse5 .cse6 .cse9) (and .cse12 .cse10 .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse12 .cse11 .cse0 .cse1 .cse2 .cse4 .cse6) (and .cse12 .cse10 .cse8 .cse7 .cse1 .cse3 .cse9) (and .cse12 .cse10 .cse11 .cse7 .cse1 .cse4 .cse9) (and .cse11 .cse8 .cse0 .cse7 .cse1 .cse2 .cse5) (and .cse12 .cse10 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse12 .cse10 .cse11 .cse7 .cse1 .cse2 .cse4) (and .cse10 .cse11 .cse8 .cse1 .cse2 .cse5 .cse6) (and .cse11 .cse0 .cse1 .cse4 .cse5 .cse6 .cse9) (and .cse12 .cse11 .cse8 .cse0 .cse7 .cse1 .cse2) (and .cse10 .cse11 .cse8 .cse1 .cse5 .cse6 .cse9) (and .cse10 .cse1 .cse3 .cse4 .cse5 .cse6 .cse9) (and .cse12 .cse10 .cse8 .cse1 .cse2 .cse3 .cse6) (and .cse12 .cse11 .cse8 .cse0 .cse1 .cse2 .cse6) (and .cse12 .cse8 .cse0 .cse7 .cse1 .cse2 .cse3) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse9) (and .cse12 .cse10 .cse8 .cse7 .cse1 .cse2 .cse3) (and .cse11 .cse8 .cse0 .cse7 .cse1 .cse5 .cse9) (and .cse12 .cse11 .cse8 .cse0 .cse7 .cse1 .cse9) (and .cse10 .cse8 .cse1 .cse3 .cse5 .cse6 .cse9) (and .cse11 .cse0 .cse7 .cse1 .cse2 .cse4 .cse5) (and .cse12 .cse8 .cse0 .cse1 .cse2 .cse3 .cse6) (and .cse12 .cse10 .cse11 .cse1 .cse2 .cse4 .cse6) (and .cse12 .cse8 .cse0 .cse1 .cse3 .cse6 .cse9) (and .cse10 .cse11 .cse8 .cse7 .cse1 .cse2 .cse5) (and .cse10 .cse11 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse12 .cse11 .cse0 .cse7 .cse1 .cse2 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse5 .cse6 .cse9) (and .cse10 .cse8 .cse7 .cse1 .cse3 .cse5 .cse9) (and .cse10 .cse11 .cse8 .cse7 .cse1 .cse5 .cse9) (and .cse12 .cse10 .cse11 .cse8 .cse7 .cse1 .cse9) (and .cse11 .cse8 .cse0 .cse1 .cse5 .cse6 .cse9) (and .cse12 .cse10 .cse11 .cse1 .cse4 .cse6 .cse9) (and .cse12 .cse11 .cse8 .cse0 .cse1 .cse6 .cse9) (and .cse12 .cse11 .cse0 .cse7 .cse1 .cse4 .cse9) (and .cse12 .cse10 .cse11 .cse8 .cse7 .cse1 .cse2) (and .cse0 .cse7 .cse1 .cse3 .cse4 .cse5 .cse9) (and .cse10 .cse8 .cse7 .cse1 .cse2 .cse3 .cse5) (and .cse12 .cse10 .cse1 .cse3 .cse4 .cse6 .cse9) (and .cse10 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse8 .cse0 .cse7 .cse1 .cse3 .cse9) (and .cse10 .cse7 .cse1 .cse3 .cse4 .cse5 .cse9) (and .cse10 .cse11 .cse7 .cse1 .cse4 .cse5 .cse9) (and .cse12 .cse0 .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse12 .cse10 .cse8 .cse1 .cse3 .cse6 .cse9) (and .cse12 .cse10 .cse11 .cse8 .cse1 .cse2 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse4 .cse6 .cse9) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse11 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse12 .cse11 .cse0 .cse1 .cse4 .cse6 .cse9) (and .cse11 .cse0 .cse7 .cse1 .cse4 .cse5 .cse9) (and .cse12 .cse10 .cse7 .cse1 .cse3 .cse4 .cse9) (and .cse11 .cse8 .cse0 .cse1 .cse2 .cse5 .cse6) (and .cse10 .cse7 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse7 .cse1 .cse2 .cse3 .cse5) (and .cse12 .cse10 .cse11 .cse8 .cse1 .cse6 .cse9))) [2020-09-04 22:01:14,118 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) the Hoare annotation is: false [2020-09-04 22:01:14,118 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 135) the Hoare annotation is: true [2020-09-04 22:01:14,119 INFO L264 CegarLoopResult]: At program point L121(line 121) the Hoare annotation is: (let ((.cse0 (= main_~lk7~0 1))) (or (and (= main_~p8~0 0) .cse0) (and (= main_~lk8~0 1) .cse0))) [2020-09-04 22:01:14,119 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-09-04 22:01:14,120 INFO L264 CegarLoopResult]: At program point L80-1(lines 33 130) the Hoare annotation is: (let ((.cse13 (= main_~p1~0 0)) (.cse7 (= main_~lk4~0 1)) (.cse11 (= main_~p2~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse12 (= main_~lk6~0 1)) (.cse9 (= main_~lk5~0 1)) (.cse6 (= main_~lk7~0 1)) (.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))) (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 .cse7 .cse0 .cse2 .cse3 .cse10 .cse12 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse13) (and .cse8 .cse3 .cse10 .cse12 .cse4 .cse9 .cse5) (and .cse7 .cse1 .cse8 .cse10 .cse13 .cse9 .cse11) (and .cse8 .cse2 .cse3 .cse10 .cse12 .cse4 .cse13) (and .cse7 .cse0 .cse2 .cse3 .cse12 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse10 .cse12 .cse13 .cse11) (and .cse7 .cse8 .cse3 .cse10 .cse12 .cse9 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse13 .cse6) (and .cse0 .cse3 .cse12 .cse4 .cse13 .cse9 .cse6) (and .cse7 .cse1 .cse8 .cse10 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse13 .cse9 .cse6) (and .cse8 .cse3 .cse12 .cse4 .cse9 .cse5 .cse6) (and .cse0 .cse10 .cse12 .cse4 .cse9 .cse11 .cse5) (and .cse0 .cse2 .cse12 .cse4 .cse13 .cse11 .cse6) (and .cse8 .cse12 .cse4 .cse13 .cse9 .cse11 .cse6) (and .cse7 .cse8 .cse2 .cse3 .cse10 .cse12 .cse5) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse13 .cse6) (and .cse7 .cse0 .cse3 .cse12 .cse9 .cse5 .cse6) (and .cse0 .cse3 .cse10 .cse12 .cse4 .cse9 .cse5) (and .cse1 .cse8 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse10 .cse13 .cse11) (and .cse7 .cse0 .cse1 .cse2 .cse11 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse0 .cse12 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse12 .cse4 .cse13 .cse6) (and .cse0 .cse12 .cse4 .cse13 .cse9 .cse11 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse12 .cse4 .cse13) (and .cse0 .cse1 .cse4 .cse13 .cse9 .cse11 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse13 .cse11 .cse6) (and .cse7 .cse8 .cse10 .cse12 .cse9 .cse11 .cse5) (and .cse0 .cse1 .cse10 .cse4 .cse13 .cse9 .cse11) (and .cse8 .cse12 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse12 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse13 .cse9 .cse11 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5 .cse6) (and .cse8 .cse3 .cse12 .cse4 .cse13 .cse9 .cse6) (and .cse1 .cse8 .cse3 .cse10 .cse4 .cse9 .cse5) (and .cse7 .cse1 .cse8 .cse3 .cse10 .cse13 .cse9) (and .cse0 .cse2 .cse12 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse10 .cse5) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse9 .cse5 .cse6) (and .cse8 .cse2 .cse10 .cse12 .cse4 .cse13 .cse11) (and .cse7 .cse0 .cse2 .cse12 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse3 .cse10 .cse12 .cse13 .cse9) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse10 .cse12 .cse9 .cse11 .cse5) (and .cse0 .cse2 .cse10 .cse12 .cse4 .cse11 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse13) (and .cse7 .cse8 .cse10 .cse12 .cse13 .cse9 .cse11) (and .cse7 .cse1 .cse8 .cse3 .cse10 .cse9 .cse5) (and .cse8 .cse10 .cse12 .cse4 .cse13 .cse9 .cse11) (and .cse1 .cse8 .cse10 .cse4 .cse13 .cse9 .cse11) (and .cse7 .cse8 .cse2 .cse3 .cse10 .cse12 .cse13) (and .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse13) (and .cse0 .cse2 .cse3 .cse10 .cse12 .cse4 .cse5) (and .cse7 .cse0 .cse3 .cse12 .cse13 .cse9 .cse6) (and .cse7 .cse0 .cse2 .cse12 .cse13 .cse11 .cse6) (and .cse8 .cse2 .cse3 .cse12 .cse4 .cse13 .cse6) (and .cse0 .cse1 .cse2 .cse4 .cse13 .cse11 .cse6) (and .cse8 .cse2 .cse3 .cse12 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse12 .cse4 .cse5 .cse6) (and .cse8 .cse2 .cse12 .cse4 .cse13 .cse11 .cse6) (and .cse1 .cse8 .cse2 .cse4 .cse11 .cse5 .cse6) (and .cse0 .cse10 .cse12 .cse4 .cse13 .cse9 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse10 .cse13 .cse9) (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 .cse1 .cse8 .cse2 .cse13 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6) (and .cse8 .cse10 .cse12 .cse4 .cse9 .cse11 .cse5) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse13 .cse9) (and .cse7 .cse1 .cse8 .cse2 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse3 .cse12 .cse9 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse10 .cse12 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse10 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse10 .cse13 .cse11) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse10 .cse13) (and .cse7 .cse8 .cse2 .cse3 .cse12 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse12 .cse13 .cse11 .cse6) (and .cse1 .cse8 .cse4 .cse13 .cse9 .cse11 .cse6) (and .cse7 .cse0 .cse1 .cse10 .cse13 .cse9 .cse11) (and .cse7 .cse8 .cse2 .cse12 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse10 .cse12 .cse13 .cse9 .cse11) (and .cse1 .cse8 .cse3 .cse10 .cse4 .cse13 .cse9) (and .cse7 .cse8 .cse2 .cse3 .cse12 .cse13 .cse6) (and .cse0 .cse1 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse13 .cse9 .cse6) (and .cse1 .cse8 .cse3 .cse4 .cse13 .cse9 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse12 .cse13 .cse6) (and .cse1 .cse8 .cse2 .cse4 .cse13 .cse11 .cse6) (and .cse8 .cse2 .cse12 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse10 .cse12 .cse13 .cse11) (and .cse7 .cse8 .cse3 .cse12 .cse13 .cse9 .cse6) (and .cse7 .cse8 .cse2 .cse10 .cse12 .cse11 .cse5) (and .cse0 .cse3 .cse10 .cse12 .cse4 .cse13 .cse9) (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 .cse12 .cse4 .cse5) (and .cse8 .cse3 .cse10 .cse12 .cse4 .cse13 .cse9) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse13 .cse11) (and .cse7 .cse8 .cse3 .cse10 .cse12 .cse13 .cse9) (and .cse7 .cse1 .cse8 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse12 .cse13 .cse9 .cse11 .cse6) (and .cse7 .cse0 .cse3 .cse10 .cse12 .cse9 .cse5) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse12 .cse13) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse9 .cse5) (and .cse1 .cse8 .cse2 .cse10 .cse4 .cse13 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse13 .cse9 .cse6) (and .cse8 .cse2 .cse10 .cse12 .cse4 .cse11 .cse5) (and .cse7 .cse8 .cse12 .cse13 .cse9 .cse11 .cse6) (and .cse7 .cse0 .cse1 .cse13 .cse9 .cse11 .cse6) (and .cse0 .cse2 .cse10 .cse12 .cse4 .cse13 .cse11) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse13 .cse6) (and .cse7 .cse8 .cse12 .cse9 .cse11 .cse5 .cse6) (and .cse1 .cse8 .cse10 .cse4 .cse9 .cse11 .cse5) (and .cse0 .cse3 .cse12 .cse4 .cse9 .cse5 .cse6) (and .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse5))) [2020-09-04 22:01:14,120 INFO L264 CegarLoopResult]: At program point L105-1(lines 33 130) the Hoare annotation is: (let ((.cse1 (= main_~p5~0 0)) (.cse6 (= main_~lk7~0 1)) (.cse3 (= main_~lk8~0 1)) (.cse4 (= main_~lk6~0 1)) (.cse0 (= main_~p6~0 0)) (.cse7 (= main_~p8~0 0)) (.cse2 (= main_~p7~0 0)) (.cse5 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse3 .cse5 .cse6) (and .cse7 .cse1 .cse4 .cse6) (and .cse1 .cse2 .cse4 .cse3) (and .cse0 .cse3 .cse5 .cse6) (and .cse0 .cse7 .cse5 .cse6) (and .cse1 .cse4 .cse3 .cse6) (and .cse7 .cse1 .cse2 .cse4) (and .cse0 .cse1 .cse3 .cse6) (and .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse1 .cse2) (and .cse0 .cse2 .cse3 .cse5) (and .cse0 .cse7 .cse1 .cse6) (and .cse2 .cse4 .cse3 .cse5) (and .cse7 .cse2 .cse4 .cse5) (and .cse0 .cse7 .cse2 .cse5))) [2020-09-04 22:01:14,120 INFO L264 CegarLoopResult]: At program point L72-1(lines 33 130) the Hoare annotation is: (let ((.cse0 (= main_~lk3~0 1)) (.cse2 (= main_~p4~0 0)) (.cse4 (= main_~lk1~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse6 (= main_~p2~0 0)) (.cse7 (= main_~lk4~0 1)) (.cse8 (= 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 .cse0 .cse5 .cse6 .cse4) (and .cse8 .cse5 .cse2 .cse6 .cse4) (and .cse8 .cse5 .cse1 .cse2 .cse4) (and .cse7 .cse8 .cse5 .cse1 .cse4) (and .cse7 .cse0 .cse1 .cse3 .cse4) (and .cse7 .cse0 .cse5 .cse1 .cse4) (and .cse7 .cse8 .cse5 .cse6 .cse4) (and .cse7 .cse8 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse4) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse7 .cse0 .cse9 .cse3 .cse6) (and .cse0 .cse5 .cse2 .cse9 .cse6) (and .cse8 .cse2 .cse9 .cse3 .cse6) (and .cse7 .cse8 .cse3 .cse6 .cse4) (and .cse7 .cse0 .cse5 .cse1 .cse9) (and .cse8 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse2 .cse3 .cse6 .cse4) (and .cse8 .cse1 .cse2 .cse9 .cse3) (and .cse0 .cse2 .cse9 .cse3 .cse6) (and .cse7 .cse8 .cse1 .cse9 .cse3) (and .cse7 .cse0 .cse5 .cse9 .cse6) (and .cse7 .cse0 .cse1 .cse9 .cse3) (and .cse7 .cse8 .cse5 .cse9 .cse6) (and .cse0 .cse5 .cse1 .cse2 .cse9) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse0 .cse3 .cse6 .cse4) (and .cse8 .cse5 .cse2 .cse9 .cse6) (and .cse8 .cse1 .cse2 .cse3 .cse4) (and .cse7 .cse8 .cse9 .cse3 .cse6) (and .cse7 .cse8 .cse5 .cse1 .cse9))) [2020-09-04 22:01:14,121 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-09-04 22:01:14,121 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-09-04 22:01:14,121 INFO L264 CegarLoopResult]: At program point L97(line 97) the Hoare annotation is: (let ((.cse4 (= main_~lk8~0 1)) (.cse0 (= main_~p3~0 0)) (.cse7 (= main_~p5~0 0)) (.cse2 (= main_~p7~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse5 (= main_~p4~0 0)) (.cse12 (= main_~lk4~0 1)) (.cse10 (= main_~lk3~0 1)) (.cse11 (= main_~p6~0 0)) (.cse8 (= main_~p8~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse6 (= main_~lk5~0 1)) (.cse9 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse7 .cse1 .cse3 .cse5 .cse9) (and .cse10 .cse11 .cse7 .cse1 .cse2 .cse4 .cse5) (and .cse12 .cse0 .cse7 .cse1 .cse3 .cse4 .cse9) (and .cse10 .cse8 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse10 .cse11 .cse1 .cse4 .cse5 .cse6 .cse9) (and .cse12 .cse10 .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse12 .cse11 .cse0 .cse1 .cse2 .cse4 .cse6) (and .cse12 .cse10 .cse8 .cse7 .cse1 .cse3 .cse9) (and .cse12 .cse10 .cse11 .cse7 .cse1 .cse4 .cse9) (and .cse11 .cse8 .cse0 .cse7 .cse1 .cse2 .cse5) (and .cse12 .cse10 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse12 .cse10 .cse11 .cse7 .cse1 .cse2 .cse4) (and .cse10 .cse11 .cse8 .cse1 .cse2 .cse5 .cse6) (and .cse11 .cse0 .cse1 .cse4 .cse5 .cse6 .cse9) (and .cse12 .cse11 .cse8 .cse0 .cse7 .cse1 .cse2) (and .cse10 .cse11 .cse8 .cse1 .cse5 .cse6 .cse9) (and .cse10 .cse1 .cse3 .cse4 .cse5 .cse6 .cse9) (and .cse12 .cse10 .cse8 .cse1 .cse2 .cse3 .cse6) (and .cse12 .cse11 .cse8 .cse0 .cse1 .cse2 .cse6) (and .cse12 .cse8 .cse0 .cse7 .cse1 .cse2 .cse3) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse9) (and .cse12 .cse10 .cse8 .cse7 .cse1 .cse2 .cse3) (and .cse11 .cse8 .cse0 .cse7 .cse1 .cse5 .cse9) (and .cse12 .cse11 .cse8 .cse0 .cse7 .cse1 .cse9) (and .cse10 .cse8 .cse1 .cse3 .cse5 .cse6 .cse9) (and .cse11 .cse0 .cse7 .cse1 .cse2 .cse4 .cse5) (and .cse12 .cse8 .cse0 .cse1 .cse2 .cse3 .cse6) (and .cse12 .cse10 .cse11 .cse1 .cse2 .cse4 .cse6) (and .cse12 .cse8 .cse0 .cse1 .cse3 .cse6 .cse9) (and .cse10 .cse11 .cse8 .cse7 .cse1 .cse2 .cse5) (and .cse10 .cse11 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse12 .cse11 .cse0 .cse7 .cse1 .cse2 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse5 .cse6 .cse9) (and .cse10 .cse8 .cse7 .cse1 .cse3 .cse5 .cse9) (and .cse10 .cse11 .cse8 .cse7 .cse1 .cse5 .cse9) (and .cse12 .cse10 .cse11 .cse8 .cse7 .cse1 .cse9) (and .cse11 .cse8 .cse0 .cse1 .cse5 .cse6 .cse9) (and .cse12 .cse10 .cse11 .cse1 .cse4 .cse6 .cse9) (and .cse12 .cse11 .cse8 .cse0 .cse1 .cse6 .cse9) (and .cse12 .cse11 .cse0 .cse7 .cse1 .cse4 .cse9) (and .cse12 .cse10 .cse11 .cse8 .cse7 .cse1 .cse2) (and .cse0 .cse7 .cse1 .cse3 .cse4 .cse5 .cse9) (and .cse10 .cse8 .cse7 .cse1 .cse2 .cse3 .cse5) (and .cse12 .cse10 .cse1 .cse3 .cse4 .cse6 .cse9) (and .cse10 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse8 .cse0 .cse7 .cse1 .cse3 .cse9) (and .cse10 .cse7 .cse1 .cse3 .cse4 .cse5 .cse9) (and .cse10 .cse11 .cse7 .cse1 .cse4 .cse5 .cse9) (and .cse12 .cse0 .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse12 .cse10 .cse8 .cse1 .cse3 .cse6 .cse9) (and .cse12 .cse10 .cse11 .cse8 .cse1 .cse2 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse4 .cse6 .cse9) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse11 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse12 .cse11 .cse0 .cse1 .cse4 .cse6 .cse9) (and .cse11 .cse0 .cse7 .cse1 .cse4 .cse5 .cse9) (and .cse12 .cse10 .cse7 .cse1 .cse3 .cse4 .cse9) (and .cse11 .cse8 .cse0 .cse1 .cse2 .cse5 .cse6) (and .cse10 .cse7 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse7 .cse1 .cse2 .cse3 .cse5) (and .cse12 .cse10 .cse11 .cse8 .cse1 .cse6 .cse9))) [2020-09-04 22:01:14,122 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-09-04 22:01:14,122 INFO L264 CegarLoopResult]: At program point L64-1(lines 33 130) 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-09-04 22:01:14,122 INFO L264 CegarLoopResult]: At program point L122(line 122) the Hoare annotation is: (let ((.cse0 (= main_~lk7~0 1))) (or (and (= main_~p8~0 0) .cse0) (and (= main_~lk8~0 1) .cse0))) [2020-09-04 22:01:14,122 INFO L271 CegarLoopResult]: At program point L56(lines 56 58) the Hoare annotation is: true [2020-09-04 22:01:14,122 INFO L264 CegarLoopResult]: At program point L56-2(lines 33 130) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-09-04 22:01:14,123 INFO L264 CegarLoopResult]: At program point L81(line 81) the Hoare annotation is: (let ((.cse6 (= main_~lk6~0 1)) (.cse11 (= main_~p1~0 0)) (.cse8 (= 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)) (.cse9 (= main_~p5~0 0)) (.cse10 (= 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 .cse8 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse8 .cse1 .cse10 .cse7 .cse11 .cse3) (and .cse0 .cse8 .cse1 .cse9 .cse11 .cse4) (and .cse0 .cse8 .cse9 .cse6 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse6 .cse11 .cse3 .cse4) (and .cse0 .cse2 .cse9 .cse6 .cse11 .cse4) (and .cse0 .cse8 .cse9 .cse6 .cse11 .cse4) (and .cse0 .cse8 .cse10 .cse6 .cse3 .cse5) (and .cse8 .cse9 .cse10 .cse6 .cse7 .cse11) (and .cse0 .cse2 .cse6 .cse11 .cse3 .cse4) (and .cse8 .cse1 .cse9 .cse10 .cse7 .cse5) (and .cse8 .cse9 .cse10 .cse6 .cse7 .cse5) (and .cse0 .cse8 .cse1 .cse10 .cse3 .cse5) (and .cse2 .cse9 .cse10 .cse6 .cse7 .cse11) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse10 .cse11) (and .cse8 .cse1 .cse10 .cse7 .cse3 .cse5) (and .cse2 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse10 .cse6 .cse5) (and .cse0 .cse8 .cse10 .cse6 .cse11 .cse3) (and .cse2 .cse6 .cse7 .cse11 .cse3 .cse4) (and .cse8 .cse10 .cse6 .cse7 .cse11 .cse3) (and .cse0 .cse2 .cse10 .cse6 .cse11 .cse3) (and .cse8 .cse9 .cse6 .cse7 .cse11 .cse4) (and .cse8 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse7 .cse4 .cse5) (and .cse2 .cse9 .cse6 .cse7 .cse11 .cse4) (and .cse8 .cse1 .cse9 .cse7 .cse11 .cse4) (and .cse0 .cse8 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse10 .cse5) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse3) (and .cse0 .cse2 .cse10 .cse6 .cse3 .cse5) (and .cse8 .cse1 .cse9 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse7 .cse11 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse9 .cse10 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse10 .cse11 .cse3) (and .cse8 .cse10 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse2 .cse9 .cse10 .cse6 .cse11) (and .cse1 .cse2 .cse10 .cse7 .cse11 .cse3) (and .cse1 .cse2 .cse10 .cse7 .cse3 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse11 .cse4) (and .cse0 .cse8 .cse9 .cse10 .cse6 .cse11) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse1 .cse9 .cse10 .cse7 .cse11) (and .cse0 .cse2 .cse9 .cse10 .cse6 .cse5) (and .cse2 .cse9 .cse10 .cse6 .cse7 .cse5) (and .cse2 .cse10 .cse6 .cse7 .cse3 .cse5) (and .cse8 .cse1 .cse7 .cse11 .cse3 .cse4) (and .cse2 .cse10 .cse6 .cse7 .cse11 .cse3) (and .cse0 .cse8 .cse1 .cse11 .cse3 .cse4) (and .cse0 .cse2 .cse9 .cse6 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse10 .cse7 .cse11) (and .cse1 .cse2 .cse9 .cse7 .cse11 .cse4) (and .cse1 .cse2 .cse7 .cse11 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse4) (and .cse0 .cse8 .cse1 .cse9 .cse10 .cse11) (and .cse8 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse10 .cse7 .cse5))) [2020-09-04 22:01:14,123 INFO L271 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: true [2020-09-04 22:01:14,123 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-09-04 22:01:14,123 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-09-04 22:01:14,124 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-09-04 22:01:14,124 INFO L264 CegarLoopResult]: At program point L106(line 106) the Hoare annotation is: (let ((.cse4 (= main_~lk8~0 1)) (.cse1 (= main_~p6~0 0)) (.cse3 (= main_~p7~0 0)) (.cse6 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse8 (= main_~p8~0 0)) (.cse2 (= main_~p5~0 0)) (.cse5 (= main_~lk6~0 1)) (.cse7 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse4 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse7) (and .cse0 .cse1 .cse8 .cse6 .cse7) (and .cse0 .cse2 .cse5 .cse4 .cse7) (and .cse0 .cse1 .cse2 .cse4 .cse7) (and .cse0 .cse8 .cse3 .cse5 .cse6) (and .cse0 .cse3 .cse5 .cse4 .cse6) (and .cse0 .cse8 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse4 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse2 .cse3 .cse5 .cse4) (and .cse0 .cse1 .cse8 .cse2 .cse3) (and .cse0 .cse1 .cse8 .cse3 .cse6) (and .cse0 .cse8 .cse2 .cse5 .cse7))) [2020-09-04 22:01:14,124 INFO L264 CegarLoopResult]: At program point L73(line 73) 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 .cse5 .cse2 .cse6 .cse7) (and .cse0 .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-09-04 22:01:14,124 INFO L271 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: true [2020-09-04 22:01:14,124 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-09-04 22:01:14,124 INFO L271 CegarLoopResult]: At program point L131(lines 5 135) the Hoare annotation is: true [2020-09-04 22:01:14,125 INFO L264 CegarLoopResult]: At program point L65(line 65) 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-09-04 22:01:14,125 INFO L271 CegarLoopResult]: At program point L57(line 57) the Hoare annotation is: true [2020-09-04 22:01:14,126 INFO L264 CegarLoopResult]: At program point L90-1(lines 33 130) the Hoare annotation is: (let ((.cse11 (= main_~p5~0 0)) (.cse12 (= main_~p7~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse9 (= main_~p8~0 0)) (.cse13 (= main_~lk2~0 1)) (.cse8 (= main_~p6~0 0)) (.cse1 (= main_~p3~0 0)) (.cse7 (= main_~lk3~0 1)) (.cse2 (= main_~lk6~0 1)) (.cse3 (= main_~lk8~0 1)) (.cse10 (= main_~p4~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse5 (= main_~p2~0 0)) (.cse6 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse10 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse11 .cse2 .cse3 .cse5 .cse6) (and .cse7 .cse12 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse0 .cse7 .cse8 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse1 .cse11 .cse13 .cse2 .cse10 .cse6) (and .cse0 .cse8 .cse9 .cse1 .cse11 .cse12 .cse5) (and .cse8 .cse9 .cse1 .cse10 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse11 .cse13 .cse2 .cse3 .cse6) (and .cse7 .cse9 .cse13 .cse12 .cse2 .cse10 .cse4) (and .cse0 .cse8 .cse1 .cse13 .cse12 .cse3 .cse4) (and .cse0 .cse7 .cse8 .cse11 .cse13 .cse3 .cse6) (and .cse0 .cse1 .cse11 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse8 .cse9 .cse1 .cse11 .cse12 .cse10 .cse5) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse4 .cse5) (and .cse7 .cse8 .cse9 .cse13 .cse12 .cse10 .cse4) (and .cse0 .cse7 .cse8 .cse9 .cse11 .cse5 .cse6) (and .cse8 .cse1 .cse13 .cse3 .cse10 .cse4 .cse6) (and .cse0 .cse8 .cse9 .cse1 .cse11 .cse13 .cse12) (and .cse7 .cse8 .cse9 .cse13 .cse10 .cse4 .cse6) (and .cse7 .cse9 .cse12 .cse2 .cse10 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse1 .cse13 .cse12 .cse4) (and .cse0 .cse9 .cse1 .cse11 .cse13 .cse12 .cse2) (and .cse0 .cse7 .cse9 .cse12 .cse2 .cse4 .cse5) (and .cse7 .cse8 .cse9 .cse12 .cse10 .cse4 .cse5) (and .cse7 .cse11 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse1 .cse13 .cse2 .cse3 .cse10 .cse4 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse11 .cse12 .cse5) (and .cse0 .cse7 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse9 .cse11 .cse13 .cse12 .cse2) (and .cse0 .cse8 .cse9 .cse1 .cse11 .cse13 .cse6) (and .cse7 .cse9 .cse13 .cse2 .cse10 .cse4 .cse6) (and .cse0 .cse8 .cse9 .cse1 .cse4 .cse5 .cse6) (and .cse1 .cse11 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse8 .cse1 .cse11 .cse13 .cse12 .cse3 .cse10) (and .cse0 .cse7 .cse9 .cse11 .cse2 .cse5 .cse6) (and .cse0 .cse9 .cse1 .cse13 .cse2 .cse4 .cse6) (and .cse7 .cse8 .cse9 .cse11 .cse13 .cse12 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse13 .cse10 .cse6) (and .cse7 .cse8 .cse11 .cse12 .cse3 .cse10 .cse5) (and .cse8 .cse9 .cse1 .cse13 .cse10 .cse4 .cse6) (and .cse0 .cse8 .cse9 .cse1 .cse13 .cse4 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse11 .cse13 .cse12) (and .cse0 .cse8 .cse1 .cse11 .cse13 .cse3 .cse6) (and .cse8 .cse9 .cse1 .cse11 .cse10 .cse5 .cse6) (and .cse7 .cse11 .cse13 .cse2 .cse3 .cse10 .cse6) (and .cse7 .cse8 .cse9 .cse11 .cse10 .cse5 .cse6) (and .cse0 .cse7 .cse12 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse7 .cse8 .cse9 .cse13 .cse12 .cse4) (and .cse0 .cse7 .cse8 .cse11 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse11 .cse12 .cse2 .cse3 .cse10 .cse5) (and .cse9 .cse1 .cse11 .cse12 .cse2 .cse10 .cse5) (and .cse0 .cse8 .cse9 .cse1 .cse12 .cse4 .cse5) (and .cse0 .cse7 .cse11 .cse13 .cse2 .cse3 .cse6) (and .cse0 .cse7 .cse11 .cse12 .cse2 .cse3 .cse5) (and .cse8 .cse9 .cse1 .cse13 .cse12 .cse10 .cse4) (and .cse7 .cse11 .cse13 .cse12 .cse2 .cse3 .cse10) (and .cse7 .cse8 .cse11 .cse3 .cse10 .cse5 .cse6) (and .cse1 .cse13 .cse12 .cse2 .cse3 .cse10 .cse4) (and .cse1 .cse11 .cse13 .cse12 .cse2 .cse3 .cse10) (and .cse9 .cse1 .cse11 .cse2 .cse10 .cse5 .cse6) (and .cse1 .cse12 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse9 .cse1 .cse12 .cse2 .cse10 .cse4 .cse5) (and .cse7 .cse8 .cse11 .cse13 .cse12 .cse3 .cse10) (and .cse7 .cse9 .cse11 .cse12 .cse2 .cse10 .cse5) (and .cse7 .cse8 .cse13 .cse3 .cse10 .cse4 .cse6) (and .cse0 .cse7 .cse11 .cse13 .cse12 .cse2 .cse3) (and .cse0 .cse7 .cse9 .cse11 .cse13 .cse2 .cse6) (and .cse8 .cse1 .cse11 .cse12 .cse3 .cse10 .cse5) (and .cse8 .cse9 .cse1 .cse11 .cse13 .cse12 .cse10) (and .cse0 .cse7 .cse13 .cse12 .cse2 .cse3 .cse4) (and .cse0 .cse7 .cse8 .cse9 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse11 .cse13 .cse12 .cse3) (and .cse0 .cse7 .cse8 .cse9 .cse12 .cse4 .cse5) (and .cse7 .cse9 .cse11 .cse2 .cse10 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse11 .cse3 .cse5 .cse6) (and .cse0 .cse9 .cse1 .cse11 .cse2 .cse5 .cse6) (and .cse7 .cse13 .cse2 .cse3 .cse10 .cse4 .cse6) (and .cse7 .cse8 .cse9 .cse11 .cse12 .cse10 .cse5) (and .cse0 .cse8 .cse1 .cse12 .cse3 .cse4 .cse5) (and .cse0 .cse7 .cse8 .cse11 .cse12 .cse3 .cse5) (and .cse0 .cse7 .cse8 .cse12 .cse3 .cse4 .cse5) (and .cse0 .cse7 .cse9 .cse13 .cse12 .cse2 .cse4) (and .cse9 .cse1 .cse13 .cse12 .cse2 .cse10 .cse4) (and .cse1 .cse11 .cse12 .cse2 .cse3 .cse10 .cse5) (and .cse0 .cse9 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse9 .cse2 .cse10 .cse4 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse11 .cse12 .cse3 .cse5) (and .cse8 .cse9 .cse1 .cse11 .cse13 .cse10 .cse6) (and .cse8 .cse1 .cse11 .cse3 .cse10 .cse5 .cse6) (and .cse0 .cse9 .cse1 .cse12 .cse2 .cse4 .cse5) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse11 .cse12 .cse2 .cse3 .cse5) (and .cse7 .cse8 .cse12 .cse3 .cse10 .cse4 .cse5) (and .cse0 .cse9 .cse1 .cse13 .cse12 .cse2 .cse4) (and .cse0 .cse7 .cse8 .cse13 .cse12 .cse3 .cse4) (and .cse0 .cse7 .cse9 .cse11 .cse12 .cse2 .cse5) (and .cse0 .cse7 .cse9 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse13 .cse12 .cse3 .cse10 .cse4) (and .cse0 .cse8 .cse1 .cse11 .cse13 .cse12 .cse3) (and .cse1 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6) (and .cse9 .cse1 .cse13 .cse2 .cse10 .cse4 .cse6) (and .cse7 .cse9 .cse11 .cse13 .cse2 .cse10 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse11 .cse13 .cse6) (and .cse0 .cse7 .cse8 .cse13 .cse3 .cse4 .cse6) (and .cse7 .cse9 .cse11 .cse13 .cse12 .cse2 .cse10) (and .cse1 .cse11 .cse13 .cse2 .cse3 .cse10 .cse6) (and .cse0 .cse7 .cse13 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse13 .cse12 .cse2 .cse3 .cse10 .cse4) (and .cse0 .cse9 .cse1 .cse11 .cse13 .cse2 .cse6) (and .cse0 .cse8 .cse9 .cse1 .cse11 .cse5 .cse6) (and .cse8 .cse1 .cse12 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse8 .cse11 .cse13 .cse3 .cse10 .cse6) (and .cse0 .cse1 .cse11 .cse13 .cse12 .cse2 .cse3) (and .cse0 .cse7 .cse9 .cse13 .cse2 .cse4 .cse6) (and .cse0 .cse9 .cse1 .cse11 .cse12 .cse2 .cse5) (and .cse0 .cse1 .cse13 .cse12 .cse2 .cse3 .cse4) (and .cse8 .cse1 .cse13 .cse12 .cse3 .cse10 .cse4) (and .cse0 .cse8 .cse1 .cse13 .cse3 .cse4 .cse6) (and .cse8 .cse1 .cse11 .cse13 .cse3 .cse10 .cse6) (and .cse7 .cse8 .cse3 .cse10 .cse4 .cse5 .cse6) (and .cse8 .cse9 .cse1 .cse12 .cse10 .cse4 .cse5) (and .cse9 .cse1 .cse11 .cse13 .cse12 .cse2 .cse10) (and .cse0 .cse7 .cse8 .cse9 .cse13 .cse4 .cse6) (and .cse8 .cse1 .cse3 .cse10 .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6))) [2020-09-04 22:01:14,126 INFO L271 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-09-04 22:01:14,126 INFO L271 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: true [2020-09-04 22:01:14,126 INFO L271 CegarLoopResult]: At program point L24-2(line 24) the Hoare annotation is: true [2020-09-04 22:01:14,127 INFO L264 CegarLoopResult]: At program point L115-1(lines 33 130) the Hoare annotation is: (let ((.cse1 (= main_~p7~0 0)) (.cse0 (= main_~p8~0 0)) (.cse2 (= main_~lk8~0 1)) (.cse3 (= main_~lk7~0 1))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse0 .cse3) (and .cse2 .cse3))) [2020-09-04 22:01:14,127 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-09-04 22:01:14,127 INFO L264 CegarLoopResult]: At program point L107(line 107) the Hoare annotation is: (let ((.cse4 (= main_~lk8~0 1)) (.cse1 (= main_~p6~0 0)) (.cse3 (= main_~p7~0 0)) (.cse6 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse8 (= main_~p8~0 0)) (.cse2 (= main_~p5~0 0)) (.cse5 (= main_~lk6~0 1)) (.cse7 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse4 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse7) (and .cse0 .cse1 .cse8 .cse6 .cse7) (and .cse0 .cse2 .cse5 .cse4 .cse7) (and .cse0 .cse1 .cse2 .cse4 .cse7) (and .cse0 .cse8 .cse3 .cse5 .cse6) (and .cse0 .cse3 .cse5 .cse4 .cse6) (and .cse0 .cse8 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse4 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse2 .cse3 .cse5 .cse4) (and .cse0 .cse1 .cse8 .cse2 .cse3) (and .cse0 .cse1 .cse8 .cse3 .cse6) (and .cse0 .cse8 .cse2 .cse5 .cse7))) [2020-09-04 22:01:14,128 INFO L264 CegarLoopResult]: At program point L91(line 91) the Hoare annotation is: (let ((.cse13 (= main_~lk7~0 1)) (.cse6 (= main_~p4~0 0)) (.cse9 (= main_~lk3~0 1)) (.cse2 (= main_~p5~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse5 (= main_~lk6~0 1)) (.cse10 (= main_~lk8~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse12 (= main_~p6~0 0)) (.cse0 (= main_~p8~0 0)) (.cse1 (= main_~p3~0 0)) (.cse4 (= main_~p7~0 0)) (.cse11 (= main_~lk5~0 1)) (.cse14 (= main_~p2~0 0)) (.cse7 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse3 .cse4 .cse5 .cse10 .cse11 .cse7) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse13) (and .cse9 .cse12 .cse0 .cse2 .cse3 .cse6 .cse7 .cse13) (and .cse12 .cse1 .cse3 .cse4 .cse10 .cse6 .cse11 .cse7) (and .cse8 .cse9 .cse0 .cse2 .cse5 .cse14 .cse7 .cse13) (and .cse8 .cse9 .cse12 .cse0 .cse3 .cse11 .cse7 .cse13) (and .cse8 .cse9 .cse0 .cse5 .cse11 .cse14 .cse7 .cse13) (and .cse9 .cse0 .cse2 .cse5 .cse6 .cse14 .cse7 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse14 .cse7) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse11 .cse14 .cse7) (and .cse8 .cse12 .cse0 .cse1 .cse11 .cse14 .cse7 .cse13) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse14 .cse7 .cse13) (and .cse8 .cse12 .cse1 .cse2 .cse3 .cse4 .cse10 .cse7) (and .cse8 .cse1 .cse3 .cse5 .cse10 .cse11 .cse7 .cse13) (and .cse9 .cse3 .cse4 .cse5 .cse10 .cse6 .cse11 .cse7) (and .cse8 .cse12 .cse0 .cse1 .cse3 .cse11 .cse7 .cse13) (and .cse8 .cse9 .cse2 .cse3 .cse5 .cse10 .cse7 .cse13) (and .cse8 .cse9 .cse0 .cse2 .cse3 .cse4 .cse5 .cse7) (and .cse8 .cse1 .cse5 .cse10 .cse11 .cse14 .cse7 .cse13) (and .cse8 .cse9 .cse2 .cse4 .cse5 .cse10 .cse14 .cse7) (and .cse8 .cse12 .cse0 .cse1 .cse2 .cse4 .cse14 .cse7) (and .cse8 .cse0 .cse1 .cse3 .cse4 .cse5 .cse11 .cse7) (and .cse8 .cse0 .cse1 .cse5 .cse11 .cse14 .cse7 .cse13) (and .cse8 .cse9 .cse0 .cse3 .cse5 .cse11 .cse7 .cse13) (and .cse8 .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse7) (and .cse12 .cse0 .cse1 .cse2 .cse6 .cse14 .cse7 .cse13) (and .cse9 .cse12 .cse0 .cse3 .cse4 .cse6 .cse11 .cse7) (and .cse9 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse13) (and .cse9 .cse12 .cse3 .cse4 .cse10 .cse6 .cse11 .cse7) (and .cse12 .cse0 .cse1 .cse2 .cse4 .cse6 .cse14 .cse7) (and .cse8 .cse9 .cse12 .cse0 .cse2 .cse4 .cse14 .cse7) (and .cse8 .cse9 .cse4 .cse5 .cse10 .cse11 .cse14 .cse7) (and .cse9 .cse12 .cse2 .cse10 .cse6 .cse14 .cse7 .cse13) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse5 .cse14 .cse7) (and .cse8 .cse12 .cse1 .cse3 .cse4 .cse10 .cse11 .cse7) (and .cse8 .cse9 .cse0 .cse4 .cse5 .cse11 .cse14 .cse7) (and .cse9 .cse3 .cse5 .cse10 .cse6 .cse11 .cse7 .cse13) (and .cse9 .cse5 .cse10 .cse6 .cse11 .cse14 .cse7 .cse13) (and .cse8 .cse12 .cse1 .cse2 .cse3 .cse10 .cse7 .cse13) (and .cse12 .cse1 .cse2 .cse4 .cse10 .cse6 .cse14 .cse7) (and .cse12 .cse1 .cse2 .cse3 .cse10 .cse6 .cse7 .cse13) (and .cse9 .cse12 .cse0 .cse6 .cse11 .cse14 .cse7 .cse13) (and .cse9 .cse12 .cse0 .cse4 .cse6 .cse11 .cse14 .cse7) (and .cse1 .cse3 .cse5 .cse10 .cse6 .cse11 .cse7 .cse13) (and .cse12 .cse1 .cse4 .cse10 .cse6 .cse11 .cse14 .cse7) (and .cse1 .cse4 .cse5 .cse10 .cse6 .cse11 .cse14 .cse7) (and .cse1 .cse2 .cse5 .cse10 .cse6 .cse14 .cse7 .cse13) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse11 .cse14 .cse7) (and .cse8 .cse1 .cse2 .cse5 .cse10 .cse14 .cse7 .cse13) (and .cse12 .cse1 .cse10 .cse6 .cse11 .cse14 .cse7 .cse13) (and .cse8 .cse9 .cse12 .cse2 .cse4 .cse10 .cse14 .cse7) (and .cse8 .cse9 .cse12 .cse0 .cse2 .cse3 .cse4 .cse7) (and .cse9 .cse12 .cse4 .cse10 .cse6 .cse11 .cse14 .cse7) (and .cse9 .cse0 .cse5 .cse6 .cse11 .cse14 .cse7 .cse13) (and .cse0 .cse1 .cse5 .cse6 .cse11 .cse14 .cse7 .cse13) (and .cse9 .cse12 .cse2 .cse3 .cse4 .cse10 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse11 .cse7) (and .cse1 .cse2 .cse4 .cse5 .cse10 .cse6 .cse14 .cse7) (and .cse9 .cse4 .cse5 .cse10 .cse6 .cse11 .cse14 .cse7) (and .cse9 .cse2 .cse3 .cse5 .cse10 .cse6 .cse7 .cse13) (and .cse8 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse7) (and .cse12 .cse0 .cse1 .cse3 .cse6 .cse11 .cse7 .cse13) (and .cse9 .cse0 .cse2 .cse4 .cse5 .cse6 .cse14 .cse7) (and .cse8 .cse9 .cse5 .cse10 .cse11 .cse14 .cse7 .cse13) (and .cse8 .cse1 .cse4 .cse5 .cse10 .cse11 .cse14 .cse7) (and .cse9 .cse12 .cse3 .cse10 .cse6 .cse11 .cse7 .cse13) (and .cse8 .cse12 .cse1 .cse3 .cse10 .cse11 .cse7 .cse13) (and .cse8 .cse1 .cse2 .cse3 .cse5 .cse10 .cse7 .cse13) (and .cse8 .cse9 .cse12 .cse0 .cse11 .cse14 .cse7 .cse13) (and .cse8 .cse12 .cse1 .cse10 .cse11 .cse14 .cse7 .cse13) (and .cse9 .cse12 .cse10 .cse6 .cse11 .cse14 .cse7 .cse13) (and .cse8 .cse9 .cse12 .cse10 .cse11 .cse14 .cse7 .cse13) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse13) (and .cse9 .cse12 .cse0 .cse2 .cse6 .cse14 .cse7 .cse13) (and .cse8 .cse1 .cse2 .cse4 .cse5 .cse10 .cse14 .cse7) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse14 .cse7 .cse13) (and .cse1 .cse5 .cse10 .cse6 .cse11 .cse14 .cse7 .cse13) (and .cse9 .cse2 .cse5 .cse10 .cse6 .cse14 .cse7 .cse13) (and .cse8 .cse9 .cse12 .cse0 .cse2 .cse14 .cse7 .cse13) (and .cse9 .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse13) (and .cse8 .cse12 .cse1 .cse2 .cse4 .cse10 .cse14 .cse7) (and .cse8 .cse12 .cse1 .cse2 .cse10 .cse14 .cse7 .cse13) (and .cse9 .cse0 .cse4 .cse5 .cse6 .cse11 .cse14 .cse7) (and .cse12 .cse1 .cse3 .cse10 .cse6 .cse11 .cse7 .cse13) (and .cse12 .cse1 .cse2 .cse3 .cse4 .cse10 .cse6 .cse7) (and .cse8 .cse9 .cse0 .cse2 .cse3 .cse5 .cse7 .cse13) (and .cse9 .cse0 .cse3 .cse5 .cse6 .cse11 .cse7 .cse13) (and .cse9 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse4 .cse5 .cse11 .cse14 .cse7) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse11 .cse7 .cse13) (and .cse9 .cse12 .cse2 .cse3 .cse10 .cse6 .cse7 .cse13) (and .cse8 .cse9 .cse12 .cse3 .cse10 .cse11 .cse7 .cse13) (and .cse12 .cse0 .cse1 .cse3 .cse4 .cse6 .cse11 .cse7) (and .cse8 .cse9 .cse3 .cse5 .cse10 .cse11 .cse7 .cse13) (and .cse9 .cse2 .cse4 .cse5 .cse10 .cse6 .cse14 .cse7) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7) (and .cse9 .cse12 .cse0 .cse3 .cse6 .cse11 .cse7 .cse13) (and .cse8 .cse12 .cse1 .cse4 .cse10 .cse11 .cse14 .cse7) (and .cse9 .cse12 .cse2 .cse4 .cse10 .cse6 .cse14 .cse7) (and .cse8 .cse9 .cse12 .cse2 .cse3 .cse10 .cse7 .cse13) (and .cse9 .cse12 .cse0 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse12 .cse0 .cse1 .cse6 .cse11 .cse14 .cse7 .cse13) (and .cse8 .cse0 .cse1 .cse3 .cse5 .cse11 .cse7 .cse13) (and .cse8 .cse9 .cse0 .cse3 .cse4 .cse5 .cse11 .cse7) (and .cse1 .cse2 .cse3 .cse5 .cse10 .cse6 .cse7 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse7) (and .cse8 .cse12 .cse0 .cse1 .cse2 .cse14 .cse7 .cse13) (and .cse8 .cse9 .cse2 .cse5 .cse10 .cse14 .cse7 .cse13) (and .cse8 .cse9 .cse12 .cse0 .cse3 .cse4 .cse11 .cse7) (and .cse8 .cse9 .cse12 .cse0 .cse2 .cse3 .cse7 .cse13) (and .cse8 .cse1 .cse3 .cse4 .cse5 .cse10 .cse11 .cse7) (and .cse8 .cse9 .cse12 .cse2 .cse10 .cse14 .cse7 .cse13) (and .cse8 .cse9 .cse12 .cse3 .cse4 .cse10 .cse11 .cse7) (and .cse8 .cse9 .cse12 .cse0 .cse4 .cse11 .cse14 .cse7) (and .cse8 .cse12 .cse0 .cse1 .cse3 .cse4 .cse11 .cse7) (and .cse8 .cse9 .cse0 .cse2 .cse4 .cse5 .cse14 .cse7) (and .cse8 .cse12 .cse0 .cse1 .cse2 .cse3 .cse7 .cse13) (and .cse12 .cse1 .cse2 .cse10 .cse6 .cse14 .cse7 .cse13) (and .cse9 .cse12 .cse0 .cse2 .cse4 .cse6 .cse14 .cse7) (and .cse8 .cse9 .cse12 .cse4 .cse10 .cse11 .cse14 .cse7) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse3 .cse4 .cse5 .cse10 .cse6 .cse11 .cse7) (and .cse8 .cse9 .cse12 .cse2 .cse3 .cse4 .cse10 .cse7) (and .cse9 .cse0 .cse3 .cse4 .cse5 .cse6 .cse11 .cse7) (and .cse8 .cse9 .cse2 .cse3 .cse4 .cse5 .cse10 .cse7) (and .cse8 .cse12 .cse0 .cse1 .cse4 .cse11 .cse14 .cse7))) [2020-09-04 22:01:14,128 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-09-04 22:01:14,129 INFO L264 CegarLoopResult]: At program point L116(line 116) the Hoare annotation is: (let ((.cse1 (= main_~p7~0 0)) (.cse0 (= main_~p8~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse3 (= main_~lk8~0 1)) (.cse4 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse4) (and .cse2 .cse3 .cse4))) [2020-09-04 22:01:14,129 INFO L271 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: true [2020-09-04 22:01:14,129 INFO L271 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-09-04 22:01:14,129 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-09-04 22:01:14,129 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-09-04 22:01:14,129 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-09-04 22:01:14,130 INFO L264 CegarLoopResult]: At program point L100-1(lines 33 130) the Hoare annotation is: (let ((.cse9 (= main_~p7~0 0)) (.cse5 (= main_~lk4~0 1)) (.cse8 (= main_~lk5~0 1)) (.cse1 (= main_~p8~0 0)) (.cse6 (= main_~lk6~0 1)) (.cse0 (= main_~p6~0 0)) (.cse2 (= main_~p5~0 0)) (.cse7 (= main_~lk8~0 1)) (.cse3 (= main_~p4~0 0)) (.cse4 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse3 .cse8 .cse4) (and .cse0 .cse9 .cse7 .cse3 .cse8) (and .cse9 .cse6 .cse7 .cse3 .cse8) (and .cse5 .cse0 .cse2 .cse7 .cse4) (and .cse5 .cse9 .cse6 .cse7 .cse8) (and .cse1 .cse6 .cse3 .cse8 .cse4) (and .cse1 .cse9 .cse6 .cse3 .cse8) (and .cse5 .cse0 .cse9 .cse7 .cse8) (and .cse0 .cse7 .cse3 .cse8 .cse4) (and .cse5 .cse2 .cse9 .cse6 .cse7) (and .cse2 .cse6 .cse7 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse2 .cse9) (and .cse5 .cse0 .cse1 .cse9 .cse8) (and .cse5 .cse1 .cse2 .cse6 .cse4) (and .cse5 .cse0 .cse2 .cse9 .cse7) (and .cse5 .cse0 .cse1 .cse2 .cse4) (and .cse5 .cse0 .cse1 .cse8 .cse4) (and .cse0 .cse2 .cse9 .cse7 .cse3) (and .cse0 .cse1 .cse9 .cse3 .cse8) (and .cse1 .cse2 .cse9 .cse6 .cse3) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse5 .cse2 .cse6 .cse7 .cse4) (and .cse5 .cse1 .cse9 .cse6 .cse8) (and .cse2 .cse9 .cse6 .cse7 .cse3) (and .cse5 .cse1 .cse6 .cse8 .cse4) (and .cse5 .cse1 .cse2 .cse9 .cse6) (and .cse5 .cse0 .cse7 .cse8 .cse4) (and .cse6 .cse7 .cse3 .cse8 .cse4) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse0 .cse2 .cse7 .cse3 .cse4))) [2020-09-04 22:01:14,130 INFO L271 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: true [2020-09-04 22:01:14,130 INFO L271 CegarLoopResult]: At program point L34-1(line 34) the Hoare annotation is: true [2020-09-04 22:01:14,130 INFO L271 CegarLoopResult]: At program point L34-2(line 34) the Hoare annotation is: true [2020-09-04 22:01:14,131 INFO L264 CegarLoopResult]: At program point L92(line 92) the Hoare annotation is: (let ((.cse13 (= main_~lk7~0 1)) (.cse6 (= main_~p4~0 0)) (.cse9 (= main_~lk3~0 1)) (.cse2 (= main_~p5~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse5 (= main_~lk6~0 1)) (.cse10 (= main_~lk8~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse12 (= main_~p6~0 0)) (.cse0 (= main_~p8~0 0)) (.cse1 (= main_~p3~0 0)) (.cse4 (= main_~p7~0 0)) (.cse11 (= main_~lk5~0 1)) (.cse14 (= main_~p2~0 0)) (.cse7 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse3 .cse4 .cse5 .cse10 .cse11 .cse7) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse13) (and .cse9 .cse12 .cse0 .cse2 .cse3 .cse6 .cse7 .cse13) (and .cse12 .cse1 .cse3 .cse4 .cse10 .cse6 .cse11 .cse7) (and .cse8 .cse9 .cse0 .cse2 .cse5 .cse14 .cse7 .cse13) (and .cse8 .cse9 .cse12 .cse0 .cse3 .cse11 .cse7 .cse13) (and .cse8 .cse9 .cse0 .cse5 .cse11 .cse14 .cse7 .cse13) (and .cse9 .cse0 .cse2 .cse5 .cse6 .cse14 .cse7 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse14 .cse7) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse11 .cse14 .cse7) (and .cse8 .cse12 .cse0 .cse1 .cse11 .cse14 .cse7 .cse13) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse14 .cse7 .cse13) (and .cse8 .cse12 .cse1 .cse2 .cse3 .cse4 .cse10 .cse7) (and .cse8 .cse1 .cse3 .cse5 .cse10 .cse11 .cse7 .cse13) (and .cse9 .cse3 .cse4 .cse5 .cse10 .cse6 .cse11 .cse7) (and .cse8 .cse12 .cse0 .cse1 .cse3 .cse11 .cse7 .cse13) (and .cse8 .cse9 .cse2 .cse3 .cse5 .cse10 .cse7 .cse13) (and .cse8 .cse1 .cse5 .cse10 .cse11 .cse14 .cse7 .cse13) (and .cse8 .cse9 .cse0 .cse2 .cse3 .cse4 .cse5 .cse7) (and .cse8 .cse9 .cse2 .cse4 .cse5 .cse10 .cse14 .cse7) (and .cse8 .cse12 .cse0 .cse1 .cse2 .cse4 .cse14 .cse7) (and .cse8 .cse0 .cse1 .cse3 .cse4 .cse5 .cse11 .cse7) (and .cse8 .cse0 .cse1 .cse5 .cse11 .cse14 .cse7 .cse13) (and .cse8 .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse7) (and .cse8 .cse9 .cse0 .cse3 .cse5 .cse11 .cse7 .cse13) (and .cse9 .cse12 .cse0 .cse3 .cse4 .cse6 .cse11 .cse7) (and .cse12 .cse0 .cse1 .cse2 .cse6 .cse14 .cse7 .cse13) (and .cse9 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse13) (and .cse9 .cse12 .cse3 .cse4 .cse10 .cse6 .cse11 .cse7) (and .cse12 .cse0 .cse1 .cse2 .cse4 .cse6 .cse14 .cse7) (and .cse8 .cse9 .cse12 .cse0 .cse2 .cse4 .cse14 .cse7) (and .cse8 .cse9 .cse4 .cse5 .cse10 .cse11 .cse14 .cse7) (and .cse9 .cse12 .cse2 .cse10 .cse6 .cse14 .cse7 .cse13) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse5 .cse14 .cse7) (and .cse8 .cse12 .cse1 .cse3 .cse4 .cse10 .cse11 .cse7) (and .cse8 .cse9 .cse0 .cse4 .cse5 .cse11 .cse14 .cse7) (and .cse9 .cse3 .cse5 .cse10 .cse6 .cse11 .cse7 .cse13) (and .cse9 .cse5 .cse10 .cse6 .cse11 .cse14 .cse7 .cse13) (and .cse12 .cse1 .cse2 .cse4 .cse10 .cse6 .cse14 .cse7) (and .cse8 .cse12 .cse1 .cse2 .cse3 .cse10 .cse7 .cse13) (and .cse12 .cse1 .cse2 .cse3 .cse10 .cse6 .cse7 .cse13) (and .cse9 .cse12 .cse0 .cse6 .cse11 .cse14 .cse7 .cse13) (and .cse9 .cse12 .cse0 .cse4 .cse6 .cse11 .cse14 .cse7) (and .cse1 .cse3 .cse5 .cse10 .cse6 .cse11 .cse7 .cse13) (and .cse12 .cse1 .cse4 .cse10 .cse6 .cse11 .cse14 .cse7) (and .cse1 .cse4 .cse5 .cse10 .cse6 .cse11 .cse14 .cse7) (and .cse1 .cse2 .cse5 .cse10 .cse6 .cse14 .cse7 .cse13) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse11 .cse14 .cse7) (and .cse8 .cse1 .cse2 .cse5 .cse10 .cse14 .cse7 .cse13) (and .cse12 .cse1 .cse10 .cse6 .cse11 .cse14 .cse7 .cse13) (and .cse8 .cse9 .cse12 .cse2 .cse4 .cse10 .cse14 .cse7) (and .cse8 .cse9 .cse12 .cse0 .cse2 .cse3 .cse4 .cse7) (and .cse9 .cse12 .cse4 .cse10 .cse6 .cse11 .cse14 .cse7) (and .cse9 .cse0 .cse5 .cse6 .cse11 .cse14 .cse7 .cse13) (and .cse0 .cse1 .cse5 .cse6 .cse11 .cse14 .cse7 .cse13) (and .cse9 .cse12 .cse2 .cse3 .cse4 .cse10 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse11 .cse7) (and .cse9 .cse2 .cse3 .cse5 .cse10 .cse6 .cse7 .cse13) (and .cse1 .cse2 .cse4 .cse5 .cse10 .cse6 .cse14 .cse7) (and .cse9 .cse4 .cse5 .cse10 .cse6 .cse11 .cse14 .cse7) (and .cse8 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse7) (and .cse12 .cse0 .cse1 .cse3 .cse6 .cse11 .cse7 .cse13) (and .cse9 .cse0 .cse2 .cse4 .cse5 .cse6 .cse14 .cse7) (and .cse8 .cse9 .cse5 .cse10 .cse11 .cse14 .cse7 .cse13) (and .cse8 .cse1 .cse4 .cse5 .cse10 .cse11 .cse14 .cse7) (and .cse9 .cse12 .cse3 .cse10 .cse6 .cse11 .cse7 .cse13) (and .cse8 .cse12 .cse1 .cse3 .cse10 .cse11 .cse7 .cse13) (and .cse8 .cse1 .cse2 .cse3 .cse5 .cse10 .cse7 .cse13) (and .cse8 .cse9 .cse12 .cse0 .cse11 .cse14 .cse7 .cse13) (and .cse8 .cse9 .cse12 .cse10 .cse11 .cse14 .cse7 .cse13) (and .cse8 .cse12 .cse1 .cse10 .cse11 .cse14 .cse7 .cse13) (and .cse9 .cse12 .cse10 .cse6 .cse11 .cse14 .cse7 .cse13) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse13) (and .cse9 .cse12 .cse0 .cse2 .cse6 .cse14 .cse7 .cse13) (and .cse8 .cse1 .cse2 .cse4 .cse5 .cse10 .cse14 .cse7) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse14 .cse7 .cse13) (and .cse1 .cse5 .cse10 .cse6 .cse11 .cse14 .cse7 .cse13) (and .cse9 .cse2 .cse5 .cse10 .cse6 .cse14 .cse7 .cse13) (and .cse8 .cse9 .cse12 .cse0 .cse2 .cse14 .cse7 .cse13) (and .cse9 .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse13) (and .cse8 .cse12 .cse1 .cse2 .cse4 .cse10 .cse14 .cse7) (and .cse8 .cse12 .cse1 .cse2 .cse10 .cse14 .cse7 .cse13) (and .cse9 .cse0 .cse4 .cse5 .cse6 .cse11 .cse14 .cse7) (and .cse12 .cse1 .cse3 .cse10 .cse6 .cse11 .cse7 .cse13) (and .cse12 .cse1 .cse2 .cse3 .cse4 .cse10 .cse6 .cse7) (and .cse8 .cse9 .cse0 .cse2 .cse3 .cse5 .cse7 .cse13) (and .cse9 .cse0 .cse3 .cse5 .cse6 .cse11 .cse7 .cse13) (and .cse9 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse4 .cse5 .cse11 .cse14 .cse7) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse11 .cse7 .cse13) (and .cse9 .cse12 .cse2 .cse3 .cse10 .cse6 .cse7 .cse13) (and .cse8 .cse9 .cse12 .cse3 .cse10 .cse11 .cse7 .cse13) (and .cse12 .cse0 .cse1 .cse3 .cse4 .cse6 .cse11 .cse7) (and .cse8 .cse9 .cse3 .cse5 .cse10 .cse11 .cse7 .cse13) (and .cse9 .cse2 .cse4 .cse5 .cse10 .cse6 .cse14 .cse7) (and .cse8 .cse12 .cse1 .cse4 .cse10 .cse11 .cse14 .cse7) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7) (and .cse9 .cse12 .cse0 .cse3 .cse6 .cse11 .cse7 .cse13) (and .cse8 .cse9 .cse12 .cse2 .cse3 .cse10 .cse7 .cse13) (and .cse9 .cse12 .cse0 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse9 .cse12 .cse2 .cse4 .cse10 .cse6 .cse14 .cse7) (and .cse12 .cse0 .cse1 .cse6 .cse11 .cse14 .cse7 .cse13) (and .cse8 .cse0 .cse1 .cse3 .cse5 .cse11 .cse7 .cse13) (and .cse8 .cse9 .cse0 .cse3 .cse4 .cse5 .cse11 .cse7) (and .cse1 .cse2 .cse3 .cse5 .cse10 .cse6 .cse7 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse7) (and .cse8 .cse12 .cse0 .cse1 .cse2 .cse14 .cse7 .cse13) (and .cse8 .cse9 .cse2 .cse5 .cse10 .cse14 .cse7 .cse13) (and .cse8 .cse9 .cse12 .cse0 .cse3 .cse4 .cse11 .cse7) (and .cse8 .cse9 .cse12 .cse0 .cse2 .cse3 .cse7 .cse13) (and .cse8 .cse1 .cse3 .cse4 .cse5 .cse10 .cse11 .cse7) (and .cse8 .cse9 .cse12 .cse3 .cse4 .cse10 .cse11 .cse7) (and .cse8 .cse9 .cse12 .cse2 .cse10 .cse14 .cse7 .cse13) (and .cse8 .cse9 .cse12 .cse0 .cse4 .cse11 .cse14 .cse7) (and .cse8 .cse12 .cse0 .cse1 .cse3 .cse4 .cse11 .cse7) (and .cse8 .cse9 .cse0 .cse2 .cse4 .cse5 .cse14 .cse7) (and .cse8 .cse12 .cse0 .cse1 .cse2 .cse3 .cse7 .cse13) (and .cse12 .cse1 .cse2 .cse10 .cse6 .cse14 .cse7 .cse13) (and .cse9 .cse12 .cse0 .cse2 .cse4 .cse6 .cse14 .cse7) (and .cse8 .cse9 .cse12 .cse4 .cse10 .cse11 .cse14 .cse7) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse3 .cse4 .cse5 .cse10 .cse6 .cse11 .cse7) (and .cse8 .cse9 .cse12 .cse2 .cse3 .cse4 .cse10 .cse7) (and .cse9 .cse0 .cse3 .cse4 .cse5 .cse6 .cse11 .cse7) (and .cse8 .cse9 .cse2 .cse3 .cse4 .cse5 .cse10 .cse7) (and .cse8 .cse12 .cse0 .cse1 .cse4 .cse11 .cse14 .cse7))) [2020-09-04 22:01:14,131 INFO L271 CegarLoopResult]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2020-09-04 22:01:14,132 INFO L264 CegarLoopResult]: At program point L117(line 117) the Hoare annotation is: (let ((.cse1 (= main_~p7~0 0)) (.cse0 (= main_~p8~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse3 (= main_~lk8~0 1)) (.cse4 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse4) (and .cse2 .cse3 .cse4))) [2020-09-04 22:01:14,134 INFO L264 CegarLoopResult]: At program point L84-1(lines 33 130) the Hoare annotation is: (let ((.cse9 (= main_~lk2~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse8 (= main_~p5~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse13 (= main_~lk8~0 1)) (.cse10 (= main_~p4~0 0)) (.cse5 (= main_~p1~0 0)) (.cse15 (= main_~lk7~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse14 (= main_~p6~0 0)) (.cse2 (= main_~p8~0 0)) (.cse11 (= main_~p3~0 0)) (.cse3 (= main_~p7~0 0)) (.cse6 (= main_~lk5~0 1)) (.cse7 (= main_~p2~0 0)) (.cse12 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse8 .cse9 .cse3 .cse4 .cse10 .cse5) (and .cse2 .cse11 .cse8 .cse9 .cse3 .cse4 .cse10 .cse12) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse13 .cse6 .cse12) (and .cse14 .cse11 .cse13 .cse10 .cse5 .cse6 .cse7 .cse15) (and .cse0 .cse1 .cse8 .cse4 .cse13 .cse5 .cse7 .cse15) (and .cse1 .cse8 .cse4 .cse13 .cse10 .cse5 .cse7 .cse15) (and .cse0 .cse1 .cse14 .cse2 .cse9 .cse6 .cse12 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse12 .cse15) (and .cse1 .cse14 .cse2 .cse10 .cse5 .cse6 .cse7 .cse15) (and .cse1 .cse14 .cse2 .cse8 .cse10 .cse5 .cse7 .cse15) (and .cse0 .cse14 .cse2 .cse11 .cse8 .cse9 .cse5 .cse15) (and .cse2 .cse11 .cse8 .cse3 .cse4 .cse10 .cse7 .cse12) (and .cse2 .cse11 .cse3 .cse4 .cse10 .cse6 .cse7 .cse12) (and .cse1 .cse14 .cse8 .cse3 .cse13 .cse10 .cse5 .cse7) (and .cse0 .cse1 .cse14 .cse8 .cse9 .cse13 .cse5 .cse15) (and .cse0 .cse2 .cse11 .cse8 .cse4 .cse7 .cse12 .cse15) (and .cse0 .cse14 .cse11 .cse9 .cse3 .cse13 .cse5 .cse6) (and .cse0 .cse2 .cse11 .cse8 .cse3 .cse4 .cse5 .cse7) (and .cse0 .cse14 .cse2 .cse11 .cse9 .cse6 .cse12 .cse15) (and .cse0 .cse1 .cse8 .cse9 .cse4 .cse13 .cse12 .cse15) (and .cse11 .cse8 .cse9 .cse4 .cse13 .cse10 .cse5 .cse15) (and .cse0 .cse2 .cse11 .cse9 .cse4 .cse5 .cse6 .cse15) (and .cse0 .cse14 .cse2 .cse11 .cse8 .cse3 .cse7 .cse12) (and .cse0 .cse2 .cse11 .cse9 .cse3 .cse4 .cse6 .cse12) (and .cse2 .cse11 .cse9 .cse4 .cse10 .cse5 .cse6 .cse15) (and .cse0 .cse2 .cse11 .cse4 .cse6 .cse7 .cse12 .cse15) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse6 .cse12 .cse15) (and .cse1 .cse14 .cse8 .cse9 .cse13 .cse10 .cse5 .cse15) (and .cse1 .cse14 .cse2 .cse9 .cse3 .cse10 .cse6 .cse12) (and .cse1 .cse2 .cse8 .cse9 .cse3 .cse4 .cse10 .cse12) (and .cse2 .cse11 .cse8 .cse9 .cse4 .cse10 .cse12 .cse15) (and .cse0 .cse11 .cse8 .cse3 .cse4 .cse13 .cse5 .cse7) (and .cse0 .cse14 .cse2 .cse11 .cse9 .cse5 .cse6 .cse15) (and .cse2 .cse11 .cse8 .cse3 .cse4 .cse10 .cse5 .cse7) (and .cse14 .cse2 .cse11 .cse9 .cse3 .cse10 .cse5 .cse6) (and .cse0 .cse14 .cse11 .cse8 .cse9 .cse3 .cse13 .cse5) (and .cse14 .cse11 .cse8 .cse9 .cse13 .cse10 .cse5 .cse15) (and .cse1 .cse2 .cse4 .cse10 .cse5 .cse6 .cse7 .cse15) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse10 .cse5 .cse7) (and .cse14 .cse2 .cse11 .cse3 .cse10 .cse5 .cse6 .cse7) (and .cse1 .cse14 .cse8 .cse13 .cse10 .cse5 .cse7 .cse15) (and .cse0 .cse1 .cse3 .cse4 .cse13 .cse6 .cse7 .cse12) (and .cse0 .cse1 .cse4 .cse13 .cse5 .cse6 .cse7 .cse15) (and .cse2 .cse11 .cse8 .cse9 .cse3 .cse4 .cse10 .cse5) (and .cse0 .cse2 .cse11 .cse8 .cse3 .cse4 .cse7 .cse12) (and .cse0 .cse14 .cse11 .cse9 .cse3 .cse13 .cse6 .cse12) (and .cse0 .cse14 .cse11 .cse9 .cse13 .cse5 .cse6 .cse15) (and .cse1 .cse9 .cse4 .cse13 .cse10 .cse6 .cse12 .cse15) (and .cse11 .cse3 .cse4 .cse13 .cse10 .cse5 .cse6 .cse7) (and .cse0 .cse14 .cse11 .cse8 .cse13 .cse5 .cse7 .cse15) (and .cse14 .cse11 .cse8 .cse9 .cse13 .cse10 .cse12 .cse15) (and .cse1 .cse14 .cse2 .cse3 .cse10 .cse6 .cse7 .cse12) (and .cse1 .cse14 .cse2 .cse10 .cse6 .cse7 .cse12 .cse15) (and .cse11 .cse9 .cse4 .cse13 .cse10 .cse6 .cse12 .cse15) (and .cse1 .cse14 .cse9 .cse13 .cse10 .cse5 .cse6 .cse15) (and .cse14 .cse11 .cse3 .cse13 .cse10 .cse6 .cse7 .cse12) (and .cse11 .cse3 .cse4 .cse13 .cse10 .cse6 .cse7 .cse12) (and .cse11 .cse8 .cse4 .cse13 .cse10 .cse7 .cse12 .cse15) (and .cse14 .cse11 .cse9 .cse3 .cse13 .cse10 .cse5 .cse6) (and .cse14 .cse2 .cse11 .cse3 .cse10 .cse6 .cse7 .cse12) (and .cse0 .cse11 .cse8 .cse4 .cse13 .cse7 .cse12 .cse15) (and .cse0 .cse1 .cse14 .cse8 .cse3 .cse13 .cse7 .cse12) (and .cse0 .cse2 .cse11 .cse9 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse14 .cse2 .cse8 .cse9 .cse3 .cse12) (and .cse1 .cse14 .cse3 .cse13 .cse10 .cse6 .cse7 .cse12) (and .cse1 .cse4 .cse13 .cse10 .cse5 .cse6 .cse7 .cse15) (and .cse1 .cse2 .cse4 .cse10 .cse6 .cse7 .cse12 .cse15) (and .cse1 .cse14 .cse8 .cse9 .cse3 .cse13 .cse10 .cse12) (and .cse0 .cse11 .cse9 .cse3 .cse4 .cse13 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse13 .cse5 .cse6 .cse7) (and .cse1 .cse8 .cse9 .cse4 .cse13 .cse10 .cse12 .cse15) (and .cse1 .cse3 .cse4 .cse13 .cse10 .cse6 .cse7 .cse12) (and .cse0 .cse11 .cse8 .cse9 .cse3 .cse4 .cse13 .cse12) (and .cse1 .cse14 .cse2 .cse8 .cse9 .cse3 .cse10 .cse5) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse10 .cse7 .cse12) (and .cse1 .cse2 .cse9 .cse4 .cse10 .cse5 .cse6 .cse15) (and .cse0 .cse11 .cse3 .cse4 .cse13 .cse6 .cse7 .cse12) (and .cse0 .cse14 .cse11 .cse9 .cse13 .cse6 .cse12 .cse15) (and .cse0 .cse11 .cse8 .cse9 .cse4 .cse13 .cse12 .cse15) (and .cse0 .cse1 .cse14 .cse13 .cse6 .cse7 .cse12 .cse15) (and .cse1 .cse14 .cse8 .cse9 .cse3 .cse13 .cse10 .cse5) (and .cse2 .cse11 .cse8 .cse4 .cse10 .cse7 .cse12 .cse15) (and .cse2 .cse11 .cse4 .cse10 .cse5 .cse6 .cse7 .cse15) (and .cse0 .cse14 .cse11 .cse3 .cse13 .cse5 .cse6 .cse7) (and .cse1 .cse8 .cse4 .cse13 .cse10 .cse7 .cse12 .cse15) (and .cse14 .cse2 .cse11 .cse8 .cse3 .cse10 .cse5 .cse7) (and .cse1 .cse2 .cse8 .cse9 .cse4 .cse10 .cse12 .cse15) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse6) (and .cse14 .cse11 .cse8 .cse9 .cse3 .cse13 .cse10 .cse12) (and .cse14 .cse11 .cse9 .cse13 .cse10 .cse6 .cse12 .cse15) (and .cse0 .cse1 .cse2 .cse8 .cse9 .cse4 .cse12 .cse15) (and .cse1 .cse2 .cse9 .cse4 .cse10 .cse6 .cse12 .cse15) (and .cse0 .cse1 .cse14 .cse8 .cse13 .cse5 .cse7 .cse15) (and .cse2 .cse11 .cse9 .cse4 .cse10 .cse6 .cse12 .cse15) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse5 .cse6 .cse15) (and .cse1 .cse14 .cse8 .cse9 .cse13 .cse10 .cse12 .cse15) (and .cse0 .cse1 .cse14 .cse9 .cse13 .cse6 .cse12 .cse15) (and .cse2 .cse11 .cse3 .cse4 .cse10 .cse5 .cse6 .cse7) (and .cse14 .cse2 .cse11 .cse9 .cse3 .cse10 .cse6 .cse12) (and .cse0 .cse1 .cse9 .cse4 .cse13 .cse6 .cse12 .cse15) (and .cse11 .cse8 .cse3 .cse4 .cse13 .cse10 .cse5 .cse7) (and .cse0 .cse1 .cse14 .cse2 .cse8 .cse9 .cse5 .cse15) (and .cse1 .cse14 .cse2 .cse9 .cse10 .cse6 .cse12 .cse15) (and .cse0 .cse1 .cse14 .cse8 .cse3 .cse13 .cse5 .cse7) (and .cse0 .cse2 .cse11 .cse8 .cse9 .cse3 .cse4 .cse12) (and .cse1 .cse14 .cse8 .cse3 .cse13 .cse10 .cse7 .cse12) (and .cse0 .cse1 .cse8 .cse9 .cse4 .cse13 .cse5 .cse15) (and .cse14 .cse11 .cse9 .cse13 .cse10 .cse5 .cse6 .cse15) (and .cse0 .cse2 .cse11 .cse9 .cse4 .cse6 .cse12 .cse15) (and .cse0 .cse14 .cse2 .cse11 .cse8 .cse7 .cse12 .cse15) (and .cse0 .cse1 .cse14 .cse9 .cse3 .cse13 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse3 .cse4 .cse13 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse9 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse14 .cse8 .cse13 .cse7 .cse12 .cse15) (and .cse0 .cse1 .cse14 .cse2 .cse3 .cse6 .cse7 .cse12) (and .cse1 .cse8 .cse9 .cse3 .cse4 .cse13 .cse10 .cse5) (and .cse11 .cse8 .cse4 .cse13 .cse10 .cse5 .cse7 .cse15) (and .cse0 .cse1 .cse14 .cse2 .cse9 .cse5 .cse6 .cse15) (and .cse1 .cse9 .cse3 .cse4 .cse13 .cse10 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse4 .cse7 .cse12) (and .cse1 .cse14 .cse3 .cse13 .cse10 .cse5 .cse6 .cse7) (and .cse0 .cse14 .cse11 .cse8 .cse9 .cse13 .cse5 .cse15) (and .cse0 .cse14 .cse2 .cse11 .cse8 .cse9 .cse12 .cse15) (and .cse1 .cse14 .cse9 .cse3 .cse13 .cse10 .cse5 .cse6) (and .cse1 .cse14 .cse2 .cse8 .cse3 .cse10 .cse7 .cse12) (and .cse0 .cse1 .cse14 .cse3 .cse13 .cse6 .cse7 .cse12) (and .cse0 .cse1 .cse14 .cse2 .cse8 .cse5 .cse7 .cse15) (and .cse14 .cse2 .cse11 .cse8 .cse9 .cse3 .cse10 .cse12) (and .cse11 .cse9 .cse3 .cse4 .cse13 .cse10 .cse6 .cse12) (and .cse0 .cse14 .cse2 .cse11 .cse9 .cse3 .cse5 .cse6) (and .cse0 .cse11 .cse4 .cse13 .cse5 .cse6 .cse7 .cse15) (and .cse1 .cse2 .cse9 .cse3 .cse4 .cse10 .cse6 .cse12) (and .cse0 .cse1 .cse14 .cse8 .cse9 .cse3 .cse13 .cse12) (and .cse0 .cse1 .cse8 .cse9 .cse3 .cse4 .cse13 .cse12) (and .cse0 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse14 .cse11 .cse13 .cse5 .cse6 .cse7 .cse15) (and .cse0 .cse1 .cse14 .cse2 .cse9 .cse3 .cse5 .cse6) (and .cse14 .cse2 .cse11 .cse8 .cse9 .cse3 .cse10 .cse5) (and .cse11 .cse9 .cse3 .cse4 .cse13 .cse10 .cse5 .cse6) (and .cse0 .cse1 .cse14 .cse8 .cse9 .cse3 .cse13 .cse5) (and .cse0 .cse11 .cse8 .cse9 .cse4 .cse13 .cse5 .cse15) (and .cse0 .cse14 .cse2 .cse11 .cse3 .cse5 .cse6 .cse7) (and .cse14 .cse2 .cse11 .cse8 .cse9 .cse10 .cse12 .cse15) (and .cse1 .cse14 .cse2 .cse8 .cse9 .cse10 .cse12 .cse15) (and .cse0 .cse2 .cse11 .cse8 .cse9 .cse4 .cse5 .cse15) (and .cse0 .cse1 .cse2 .cse8 .cse4 .cse7 .cse12 .cse15) (and .cse14 .cse11 .cse9 .cse3 .cse13 .cse10 .cse6 .cse12) (and .cse1 .cse2 .cse8 .cse9 .cse4 .cse10 .cse5 .cse15) (and .cse1 .cse2 .cse8 .cse4 .cse10 .cse7 .cse12 .cse15) (and .cse0 .cse1 .cse14 .cse2 .cse5 .cse6 .cse7 .cse15) (and .cse2 .cse11 .cse8 .cse4 .cse10 .cse5 .cse7 .cse15) (and .cse0 .cse1 .cse2 .cse8 .cse9 .cse4 .cse5 .cse15) (and .cse0 .cse14 .cse2 .cse11 .cse6 .cse7 .cse12 .cse15) (and .cse0 .cse14 .cse11 .cse8 .cse9 .cse3 .cse13 .cse12) (and .cse2 .cse11 .cse9 .cse3 .cse4 .cse10 .cse5 .cse6) (and .cse0 .cse11 .cse9 .cse4 .cse13 .cse6 .cse12 .cse15) (and .cse1 .cse3 .cse4 .cse13 .cse10 .cse5 .cse6 .cse7) (and .cse1 .cse9 .cse3 .cse4 .cse13 .cse10 .cse6 .cse12) (and .cse0 .cse2 .cse11 .cse8 .cse4 .cse5 .cse7 .cse15) (and .cse0 .cse11 .cse4 .cse13 .cse6 .cse7 .cse12 .cse15) (and .cse0 .cse1 .cse2 .cse8 .cse9 .cse3 .cse4 .cse12) (and .cse14 .cse2 .cse11 .cse10 .cse5 .cse6 .cse7 .cse15) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse13 .cse7 .cse12) (and .cse1 .cse8 .cse9 .cse4 .cse13 .cse10 .cse5 .cse15) (and .cse0 .cse14 .cse2 .cse11 .cse8 .cse9 .cse3 .cse12) (and .cse14 .cse2 .cse11 .cse8 .cse10 .cse7 .cse12 .cse15) (and .cse1 .cse14 .cse13 .cse10 .cse5 .cse6 .cse7 .cse15) (and .cse1 .cse14 .cse9 .cse3 .cse13 .cse10 .cse6 .cse12) (and .cse0 .cse14 .cse2 .cse11 .cse8 .cse5 .cse7 .cse15) (and .cse14 .cse11 .cse8 .cse3 .cse13 .cse10 .cse5 .cse7) (and .cse14 .cse2 .cse11 .cse8 .cse3 .cse10 .cse7 .cse12) (and .cse0 .cse1 .cse14 .cse2 .cse8 .cse3 .cse7 .cse12) (and .cse14 .cse2 .cse11 .cse8 .cse9 .cse10 .cse5 .cse15) (and .cse0 .cse2 .cse11 .cse4 .cse5 .cse6 .cse7 .cse15) (and .cse1 .cse14 .cse8 .cse13 .cse10 .cse7 .cse12 .cse15) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse13 .cse5 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse12) (and .cse1 .cse4 .cse13 .cse10 .cse6 .cse7 .cse12 .cse15) (and .cse14 .cse11 .cse8 .cse3 .cse13 .cse10 .cse7 .cse12) (and .cse0 .cse14 .cse11 .cse8 .cse9 .cse13 .cse12 .cse15) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse4 .cse5 .cse7) (and .cse0 .cse1 .cse14 .cse2 .cse8 .cse9 .cse3 .cse5) (and .cse14 .cse11 .cse13 .cse10 .cse6 .cse7 .cse12 .cse15) (and .cse0 .cse1 .cse9 .cse4 .cse13 .cse5 .cse6 .cse15) (and .cse0 .cse1 .cse14 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse2 .cse11 .cse4 .cse10 .cse6 .cse7 .cse12 .cse15) (and .cse2 .cse11 .cse9 .cse3 .cse4 .cse10 .cse6 .cse12) (and .cse14 .cse11 .cse3 .cse13 .cse10 .cse5 .cse6 .cse7) (and .cse11 .cse8 .cse3 .cse4 .cse13 .cse10 .cse7 .cse12) (and .cse0 .cse11 .cse9 .cse4 .cse13 .cse5 .cse6 .cse15) (and .cse1 .cse14 .cse2 .cse3 .cse10 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse9 .cse3 .cse4 .cse10 .cse5 .cse6) (and .cse1 .cse14 .cse2 .cse8 .cse9 .cse10 .cse5 .cse15) (and .cse14 .cse2 .cse11 .cse9 .cse10 .cse6 .cse12 .cse15) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse13 .cse5 .cse6) (and .cse0 .cse1 .cse4 .cse13 .cse6 .cse7 .cse12 .cse15) (and .cse1 .cse14 .cse9 .cse13 .cse10 .cse6 .cse12 .cse15) (and .cse0 .cse1 .cse14 .cse2 .cse6 .cse7 .cse12 .cse15) (and .cse14 .cse2 .cse11 .cse9 .cse10 .cse5 .cse6 .cse15) (and .cse1 .cse14 .cse2 .cse9 .cse3 .cse10 .cse5 .cse6) (and .cse0 .cse14 .cse11 .cse13 .cse6 .cse7 .cse12 .cse15) (and .cse1 .cse14 .cse13 .cse10 .cse6 .cse7 .cse12 .cse15) (and .cse0 .cse2 .cse11 .cse8 .cse9 .cse4 .cse12 .cse15) (and .cse1 .cse8 .cse3 .cse4 .cse13 .cse10 .cse5 .cse7) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse15) (and .cse1 .cse14 .cse2 .cse8 .cse10 .cse7 .cse12 .cse15) (and .cse0 .cse11 .cse8 .cse3 .cse4 .cse13 .cse7 .cse12) (and .cse0 .cse14 .cse2 .cse11 .cse8 .cse3 .cse5 .cse7) (and .cse11 .cse4 .cse13 .cse10 .cse6 .cse7 .cse12 .cse15) (and .cse0 .cse1 .cse14 .cse2 .cse8 .cse7 .cse12 .cse15) (and .cse1 .cse14 .cse2 .cse8 .cse3 .cse10 .cse5 .cse7) (and .cse0 .cse14 .cse2 .cse11 .cse5 .cse6 .cse7 .cse15) (and .cse0 .cse14 .cse11 .cse8 .cse3 .cse13 .cse7 .cse12) (and .cse0 .cse14 .cse11 .cse8 .cse13 .cse7 .cse12 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse6 .cse7 .cse12) (and .cse1 .cse14 .cse2 .cse9 .cse10 .cse5 .cse6 .cse15) (and .cse1 .cse8 .cse9 .cse3 .cse4 .cse13 .cse10 .cse12) (and .cse14 .cse11 .cse8 .cse9 .cse3 .cse13 .cse10 .cse5) (and .cse0 .cse2 .cse11 .cse3 .cse4 .cse6 .cse7 .cse12) (and .cse1 .cse8 .cse3 .cse4 .cse13 .cse10 .cse7 .cse12) (and .cse0 .cse1 .cse2 .cse8 .cse4 .cse5 .cse7 .cse15) (and .cse0 .cse14 .cse11 .cse3 .cse13 .cse6 .cse7 .cse12) (and .cse0 .cse1 .cse14 .cse8 .cse9 .cse13 .cse12 .cse15) (and .cse1 .cse14 .cse2 .cse8 .cse9 .cse3 .cse10 .cse12) (and .cse14 .cse2 .cse11 .cse8 .cse10 .cse5 .cse7 .cse15) (and .cse14 .cse2 .cse11 .cse10 .cse6 .cse7 .cse12 .cse15) (and .cse0 .cse11 .cse3 .cse4 .cse13 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse6 .cse12) (and .cse11 .cse8 .cse9 .cse4 .cse13 .cse10 .cse12 .cse15) (and .cse11 .cse8 .cse9 .cse3 .cse4 .cse13 .cse10 .cse12) (and .cse0 .cse11 .cse8 .cse4 .cse13 .cse5 .cse7 .cse15) (and .cse2 .cse11 .cse8 .cse9 .cse4 .cse10 .cse5 .cse15) (and .cse0 .cse1 .cse8 .cse4 .cse13 .cse7 .cse12 .cse15) (and .cse0 .cse1 .cse14 .cse2 .cse9 .cse3 .cse6 .cse12) (and .cse0 .cse1 .cse14 .cse2 .cse8 .cse9 .cse12 .cse15) (and .cse0 .cse11 .cse9 .cse3 .cse4 .cse13 .cse6 .cse12) (and .cse0 .cse14 .cse2 .cse11 .cse8 .cse9 .cse3 .cse5) (and .cse0 .cse1 .cse14 .cse9 .cse3 .cse13 .cse6 .cse12) (and .cse0 .cse11 .cse8 .cse9 .cse3 .cse4 .cse13 .cse5) (and .cse0 .cse1 .cse14 .cse3 .cse13 .cse5 .cse6 .cse7) (and .cse11 .cse8 .cse9 .cse3 .cse4 .cse13 .cse10 .cse5) (and .cse0 .cse2 .cse11 .cse8 .cse9 .cse3 .cse4 .cse5) (and .cse0 .cse14 .cse2 .cse11 .cse9 .cse3 .cse6 .cse12) (and .cse0 .cse1 .cse14 .cse13 .cse5 .cse6 .cse7 .cse15) (and .cse0 .cse14 .cse11 .cse8 .cse3 .cse13 .cse5 .cse7) (and .cse1 .cse2 .cse8 .cse4 .cse10 .cse5 .cse7 .cse15) (and .cse14 .cse11 .cse8 .cse13 .cse10 .cse7 .cse12 .cse15) (and .cse14 .cse11 .cse8 .cse13 .cse10 .cse5 .cse7 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 .cse7) (and .cse11 .cse9 .cse4 .cse13 .cse10 .cse5 .cse6 .cse15) (and .cse1 .cse9 .cse4 .cse13 .cse10 .cse5 .cse6 .cse15) (and .cse0 .cse1 .cse14 .cse9 .cse13 .cse5 .cse6 .cse15) (and .cse0 .cse1 .cse14 .cse2 .cse8 .cse3 .cse5 .cse7) (and .cse11 .cse4 .cse13 .cse10 .cse5 .cse6 .cse7 .cse15) (and .cse0 .cse14 .cse2 .cse11 .cse3 .cse6 .cse7 .cse12))) [2020-09-04 22:01:14,134 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-09-04 22:01:14,134 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-09-04 22:01:14,134 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-09-04 22:01:14,135 INFO L264 CegarLoopResult]: At program point L76-1(lines 33 130) the Hoare annotation is: (let ((.cse6 (= main_~lk6~0 1)) (.cse11 (= main_~p1~0 0)) (.cse8 (= 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)) (.cse9 (= main_~p5~0 0)) (.cse10 (= 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 .cse8 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse8 .cse1 .cse10 .cse7 .cse11 .cse3) (and .cse0 .cse8 .cse1 .cse9 .cse11 .cse4) (and .cse0 .cse8 .cse9 .cse6 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse6 .cse11 .cse3 .cse4) (and .cse0 .cse2 .cse9 .cse6 .cse11 .cse4) (and .cse0 .cse8 .cse9 .cse6 .cse11 .cse4) (and .cse0 .cse8 .cse10 .cse6 .cse3 .cse5) (and .cse8 .cse9 .cse10 .cse6 .cse7 .cse11) (and .cse0 .cse2 .cse6 .cse11 .cse3 .cse4) (and .cse8 .cse1 .cse9 .cse10 .cse7 .cse5) (and .cse8 .cse9 .cse10 .cse6 .cse7 .cse5) (and .cse0 .cse8 .cse1 .cse10 .cse3 .cse5) (and .cse2 .cse9 .cse10 .cse6 .cse7 .cse11) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse10 .cse11) (and .cse8 .cse1 .cse10 .cse7 .cse3 .cse5) (and .cse2 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse10 .cse6 .cse5) (and .cse0 .cse8 .cse10 .cse6 .cse11 .cse3) (and .cse2 .cse6 .cse7 .cse11 .cse3 .cse4) (and .cse8 .cse10 .cse6 .cse7 .cse11 .cse3) (and .cse0 .cse2 .cse10 .cse6 .cse11 .cse3) (and .cse8 .cse9 .cse6 .cse7 .cse11 .cse4) (and .cse8 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse7 .cse4 .cse5) (and .cse2 .cse9 .cse6 .cse7 .cse11 .cse4) (and .cse8 .cse1 .cse9 .cse7 .cse11 .cse4) (and .cse0 .cse8 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse10 .cse5) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse3) (and .cse0 .cse2 .cse10 .cse6 .cse3 .cse5) (and .cse8 .cse1 .cse9 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse7 .cse11 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse9 .cse10 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse10 .cse11 .cse3) (and .cse8 .cse10 .cse6 .cse7 .cse3 .cse5) (and .cse1 .cse2 .cse10 .cse7 .cse11 .cse3) (and .cse0 .cse2 .cse9 .cse10 .cse6 .cse11) (and .cse0 .cse8 .cse1 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse10 .cse7 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse11 .cse4) (and .cse0 .cse8 .cse9 .cse10 .cse6 .cse11) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse1 .cse9 .cse10 .cse7 .cse11) (and .cse0 .cse2 .cse9 .cse10 .cse6 .cse5) (and .cse2 .cse9 .cse10 .cse6 .cse7 .cse5) (and .cse2 .cse10 .cse6 .cse7 .cse3 .cse5) (and .cse8 .cse1 .cse7 .cse11 .cse3 .cse4) (and .cse2 .cse10 .cse6 .cse7 .cse11 .cse3) (and .cse0 .cse8 .cse1 .cse11 .cse3 .cse4) (and .cse0 .cse2 .cse9 .cse6 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse10 .cse7 .cse11) (and .cse1 .cse2 .cse9 .cse7 .cse11 .cse4) (and .cse1 .cse2 .cse7 .cse11 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse4) (and .cse0 .cse8 .cse1 .cse9 .cse10 .cse11) (and .cse8 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse10 .cse7 .cse5))) [2020-09-04 22:01:14,135 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-09-04 22:01:14,135 INFO L264 CegarLoopResult]: At program point L134(line 134) the Hoare annotation is: false [2020-09-04 22:01:14,135 INFO L264 CegarLoopResult]: At program point L101(line 101) the Hoare annotation is: (let ((.cse10 (= main_~p7~0 0)) (.cse9 (= main_~p5~0 0)) (.cse3 (= main_~p4~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse7 (= main_~lk8~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse6 (= main_~p6~0 0)) (.cse1 (= main_~p8~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse5 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse7) (and .cse0 .cse6 .cse9 .cse10 .cse7 .cse3) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse5) (and .cse8 .cse0 .cse6 .cse10 .cse7 .cse4) (and .cse0 .cse10 .cse2 .cse7 .cse3 .cse4) (and .cse0 .cse6 .cse1 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse10 .cse3 .cse4) (and .cse0 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse9 .cse2 .cse7 .cse5) (and .cse0 .cse6 .cse9 .cse7 .cse3 .cse5) (and .cse0 .cse6 .cse10 .cse7 .cse3 .cse4) (and .cse0 .cse9 .cse10 .cse2 .cse7 .cse3) (and .cse0 .cse9 .cse2 .cse7 .cse3 .cse5) (and .cse8 .cse0 .cse6 .cse1 .cse10 .cse4) (and .cse8 .cse0 .cse6 .cse9 .cse10 .cse7) (and .cse8 .cse0 .cse1 .cse10 .cse2 .cse4) (and .cse8 .cse0 .cse10 .cse2 .cse7 .cse4) (and .cse8 .cse0 .cse6 .cse9 .cse7 .cse5) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse8 .cse0 .cse1 .cse9 .cse10 .cse2) (and .cse0 .cse6 .cse1 .cse9 .cse3 .cse5) (and .cse8 .cse0 .cse6 .cse1 .cse9 .cse10) (and .cse0 .cse6 .cse1 .cse9 .cse10 .cse3) (and .cse0 .cse1 .cse10 .cse2 .cse3 .cse4) (and .cse8 .cse0 .cse6 .cse1 .cse9 .cse5) (and .cse0 .cse1 .cse9 .cse10 .cse2 .cse3) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5) (and .cse8 .cse0 .cse2 .cse7 .cse4 .cse5) (and .cse8 .cse0 .cse6 .cse1 .cse4 .cse5))) [2020-09-04 22:01:14,135 INFO L271 CegarLoopResult]: At program point L35(lines 35 37) the Hoare annotation is: true [2020-09-04 22:01:14,136 INFO L264 CegarLoopResult]: At program point L68-1(lines 33 130) 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 .cse5 .cse2 .cse6 .cse7) (and .cse0 .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-09-04 22:01:14,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 10:01:14 BoogieIcfgContainer [2020-09-04 22:01:14,151 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 22:01:14,153 INFO L168 Benchmark]: Toolchain (without parser) took 62161.78 ms. Allocated memory was 139.5 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 102.2 MB in the beginning and 867.0 MB in the end (delta: -764.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2020-09-04 22:01:14,154 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 139.5 MB. Free memory was 120.7 MB in the beginning and 120.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-09-04 22:01:14,155 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.72 ms. Allocated memory is still 139.5 MB. Free memory was 102.0 MB in the beginning and 91.5 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2020-09-04 22:01:14,155 INFO L168 Benchmark]: Boogie Preprocessor took 127.85 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 91.5 MB in the beginning and 180.9 MB in the end (delta: -89.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2020-09-04 22:01:14,156 INFO L168 Benchmark]: RCFGBuilder took 487.64 ms. Allocated memory is still 203.4 MB. Free memory was 180.9 MB in the beginning and 159.5 MB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. [2020-09-04 22:01:14,156 INFO L168 Benchmark]: TraceAbstraction took 61240.83 ms. Allocated memory was 203.4 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 158.9 MB in the beginning and 867.0 MB in the end (delta: -708.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2020-09-04 22:01:14,159 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 139.5 MB. Free memory was 120.7 MB in the beginning and 120.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 299.72 ms. Allocated memory is still 139.5 MB. Free memory was 102.0 MB in the beginning and 91.5 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 127.85 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 91.5 MB in the beginning and 180.9 MB in the end (delta: -89.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 487.64 ms. Allocated memory is still 203.4 MB. Free memory was 180.9 MB in the beginning and 159.5 MB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 61240.83 ms. Allocated memory was 203.4 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 158.9 MB in the beginning and 867.0 MB in the end (delta: -708.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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: 33]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 4]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 98 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6.7s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 54.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2345 SDtfs, 845 SDslu, 1664 SDs, 0 SdLazy, 79 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5479occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 2257 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 98 LocationsWithAnnotation, 98 PreInvPairs, 10602 NumberOfFragments, 32360 HoareAnnotationTreeSize, 98 FomulaSimplifications, 323126 FormulaSimplificationTreeSizeReduction, 19.1s HoareSimplificationTime, 98 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 35.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1040 NumberOfCodeBlocks, 1040 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1024 ConstructedInterpolants, 0 QuantifiedInterpolants, 83040 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...