/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 -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 16:34:19,788 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 16:34:19,793 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 16:34:19,836 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 16:34:19,836 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 16:34:19,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 16:34:19,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 16:34:19,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 16:34:19,852 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 16:34:19,853 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 16:34:19,854 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 16:34:19,857 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 16:34:19,857 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 16:34:19,861 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 16:34:19,863 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 16:34:19,865 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 16:34:19,867 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 16:34:19,869 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 16:34:19,871 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 16:34:19,878 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 16:34:19,881 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 16:34:19,882 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 16:34:19,883 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 16:34:19,884 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 16:34:19,896 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 16:34:19,896 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 16:34:19,896 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 16:34:19,899 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 16:34:19,899 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 16:34:19,902 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 16:34:19,902 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 16:34:19,903 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 16:34:19,904 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 16:34:19,905 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 16:34:19,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 16:34:19,906 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 16:34:19,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 16:34:19,907 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 16:34:19,907 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 16:34:19,908 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 16:34:19,910 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 16:34:19,911 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 16:34:19,928 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 16:34:19,928 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 16:34:19,931 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 16:34:19,931 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 16:34:19,931 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 16:34:19,932 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 16:34:19,932 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 16:34:19,932 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 16:34:19,933 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 16:34:19,933 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 16:34:19,934 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 16:34:19,934 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 16:34:19,934 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 16:34:19,934 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 16:34:19,935 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 16:34:19,935 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 16:34:19,935 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 16:34:19,935 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 16:34:19,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:34:19,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 16:34:19,936 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 16:34:19,936 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 16:34:19,936 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 16:34:20,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 16:34:20,486 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 16:34:20,491 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 16:34:20,494 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 16:34:20,495 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 16:34:20,496 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 16:34:20,595 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5854dbfe0/5408a7c429e24c429b91ed447e22ddb5/FLAGfc02b2157 [2020-09-04 16:34:21,218 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 16:34:21,221 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/locks/test_locks_8.c [2020-09-04 16:34:21,232 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5854dbfe0/5408a7c429e24c429b91ed447e22ddb5/FLAGfc02b2157 [2020-09-04 16:34:21,551 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5854dbfe0/5408a7c429e24c429b91ed447e22ddb5 [2020-09-04 16:34:21,566 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 16:34:21,568 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 16:34:21,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 16:34:21,570 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 16:34:21,574 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 16:34:21,575 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:34:21" (1/1) ... [2020-09-04 16:34:21,580 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19617743 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:34:21, skipping insertion in model container [2020-09-04 16:34:21,580 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:34:21" (1/1) ... [2020-09-04 16:34:21,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 16:34:21,620 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 16:34:21,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:34:21,880 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 16:34:21,908 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:34:21,926 INFO L208 MainTranslator]: Completed translation [2020-09-04 16:34:21,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:34:21 WrapperNode [2020-09-04 16:34:21,927 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 16:34:21,928 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 16:34:21,928 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 16:34:21,928 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 16:34:22,033 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:34:21" (1/1) ... [2020-09-04 16:34:22,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:34:21" (1/1) ... [2020-09-04 16:34:22,047 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:34:21" (1/1) ... [2020-09-04 16:34:22,047 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:34:21" (1/1) ... [2020-09-04 16:34:22,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:34:21" (1/1) ... [2020-09-04 16:34:22,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:34:21" (1/1) ... [2020-09-04 16:34:22,083 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:34:21" (1/1) ... [2020-09-04 16:34:22,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 16:34:22,086 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 16:34:22,087 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 16:34:22,087 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 16:34:22,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:34:21" (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 16:34:22,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 16:34:22,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 16:34:22,181 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 16:34:22,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 16:34:22,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 16:34:22,181 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 16:34:22,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 16:34:22,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 16:34:22,547 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 16:34:22,547 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-04 16:34:22,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:34:22 BoogieIcfgContainer [2020-09-04 16:34:22,554 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 16:34:22,555 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 16:34:22,556 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 16:34:22,560 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 16:34:22,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 04:34:21" (1/3) ... [2020-09-04 16:34:22,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14609709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:34:22, skipping insertion in model container [2020-09-04 16:34:22,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:34:21" (2/3) ... [2020-09-04 16:34:22,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14609709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:34:22, skipping insertion in model container [2020-09-04 16:34:22,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:34:22" (3/3) ... [2020-09-04 16:34:22,565 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2020-09-04 16:34:22,578 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 16:34:22,589 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 16:34:22,615 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 16:34:22,648 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 16:34:22,648 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 16:34:22,649 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 16:34:22,649 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 16:34:22,649 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 16:34:22,649 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 16:34:22,649 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 16:34:22,650 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 16:34:22,673 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2020-09-04 16:34:22,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-09-04 16:34:22,689 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:22,691 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 16:34:22,692 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:22,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:22,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1717644884, now seen corresponding path program 1 times [2020-09-04 16:34:22,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:22,713 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1057056281] [2020-09-04 16:34:22,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:22,789 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:22,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:23,008 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 16:34:23,012 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1057056281] [2020-09-04 16:34:23,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:23,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:23,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707080397] [2020-09-04 16:34:23,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:23,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:23,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:23,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:23,048 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 3 states. [2020-09-04 16:34:23,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:23,182 INFO L93 Difference]: Finished difference Result 213 states and 291 transitions. [2020-09-04 16:34:23,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:23,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-09-04 16:34:23,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:23,215 INFO L225 Difference]: With dead ends: 213 [2020-09-04 16:34:23,216 INFO L226 Difference]: Without dead ends: 144 [2020-09-04 16:34:23,225 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 16:34:23,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-09-04 16:34:23,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2020-09-04 16:34:23,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-09-04 16:34:23,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 186 transitions. [2020-09-04 16:34:23,297 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 186 transitions. Word has length 61 [2020-09-04 16:34:23,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:23,298 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 186 transitions. [2020-09-04 16:34:23,298 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:23,299 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 186 transitions. [2020-09-04 16:34:23,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-09-04 16:34:23,301 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:23,302 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 16:34:23,302 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 16:34:23,303 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:23,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:23,303 INFO L82 PathProgramCache]: Analyzing trace with hash 16380224, now seen corresponding path program 1 times [2020-09-04 16:34:23,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:23,304 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [24659484] [2020-09-04 16:34:23,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:23,307 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:23,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:23,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:23,399 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 16:34:23,400 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [24659484] [2020-09-04 16:34:23,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:23,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:23,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163214715] [2020-09-04 16:34:23,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:23,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:23,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:23,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:23,403 INFO L87 Difference]: Start difference. First operand 142 states and 186 transitions. Second operand 3 states. [2020-09-04 16:34:23,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:23,454 INFO L93 Difference]: Finished difference Result 173 states and 229 transitions. [2020-09-04 16:34:23,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:23,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-09-04 16:34:23,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:23,458 INFO L225 Difference]: With dead ends: 173 [2020-09-04 16:34:23,459 INFO L226 Difference]: Without dead ends: 171 [2020-09-04 16:34:23,461 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 16:34:23,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-09-04 16:34:23,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 142. [2020-09-04 16:34:23,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-09-04 16:34:23,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 185 transitions. [2020-09-04 16:34:23,488 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 185 transitions. Word has length 62 [2020-09-04 16:34:23,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:23,488 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 185 transitions. [2020-09-04 16:34:23,488 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:23,489 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 185 transitions. [2020-09-04 16:34:23,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-09-04 16:34:23,491 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:23,491 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 16:34:23,491 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 16:34:23,492 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:23,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:23,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1707628474, now seen corresponding path program 1 times [2020-09-04 16:34:23,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:23,493 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1147359508] [2020-09-04 16:34:23,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:23,496 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:23,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:23,599 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 16:34:23,600 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1147359508] [2020-09-04 16:34:23,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:23,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:23,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222083596] [2020-09-04 16:34:23,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:23,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:23,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:23,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:23,603 INFO L87 Difference]: Start difference. First operand 142 states and 185 transitions. Second operand 3 states. [2020-09-04 16:34:23,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:23,667 INFO L93 Difference]: Finished difference Result 346 states and 473 transitions. [2020-09-04 16:34:23,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:23,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-09-04 16:34:23,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:23,671 INFO L225 Difference]: With dead ends: 346 [2020-09-04 16:34:23,671 INFO L226 Difference]: Without dead ends: 241 [2020-09-04 16:34:23,673 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 16:34:23,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2020-09-04 16:34:23,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 239. [2020-09-04 16:34:23,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2020-09-04 16:34:23,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 320 transitions. [2020-09-04 16:34:23,715 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 320 transitions. Word has length 62 [2020-09-04 16:34:23,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:23,716 INFO L479 AbstractCegarLoop]: Abstraction has 239 states and 320 transitions. [2020-09-04 16:34:23,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:23,716 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 320 transitions. [2020-09-04 16:34:23,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-09-04 16:34:23,719 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:23,719 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 16:34:23,720 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 16:34:23,720 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:23,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:23,720 INFO L82 PathProgramCache]: Analyzing trace with hash -298745719, now seen corresponding path program 1 times [2020-09-04 16:34:23,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:23,721 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [894315320] [2020-09-04 16:34:23,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:23,724 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:23,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:23,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:23,810 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 16:34:23,811 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [894315320] [2020-09-04 16:34:23,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:23,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:23,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824039286] [2020-09-04 16:34:23,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:23,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:23,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:23,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:23,814 INFO L87 Difference]: Start difference. First operand 239 states and 320 transitions. Second operand 3 states. [2020-09-04 16:34:23,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:23,879 INFO L93 Difference]: Finished difference Result 293 states and 396 transitions. [2020-09-04 16:34:23,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:23,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-09-04 16:34:23,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:23,883 INFO L225 Difference]: With dead ends: 293 [2020-09-04 16:34:23,883 INFO L226 Difference]: Without dead ends: 291 [2020-09-04 16:34:23,884 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 16:34:23,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-09-04 16:34:23,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 239. [2020-09-04 16:34:23,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2020-09-04 16:34:23,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 318 transitions. [2020-09-04 16:34:23,919 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 318 transitions. Word has length 63 [2020-09-04 16:34:23,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:23,920 INFO L479 AbstractCegarLoop]: Abstraction has 239 states and 318 transitions. [2020-09-04 16:34:23,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:23,920 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 318 transitions. [2020-09-04 16:34:23,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-09-04 16:34:23,923 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:23,923 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 16:34:23,924 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 16:34:23,924 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:23,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:23,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1397120136, now seen corresponding path program 1 times [2020-09-04 16:34:23,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:23,925 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [985968883] [2020-09-04 16:34:23,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:23,928 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:24,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:24,019 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 16:34:24,020 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [985968883] [2020-09-04 16:34:24,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:24,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:24,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746500869] [2020-09-04 16:34:24,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:24,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:24,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:24,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:24,025 INFO L87 Difference]: Start difference. First operand 239 states and 318 transitions. Second operand 3 states. [2020-09-04 16:34:24,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:24,087 INFO L93 Difference]: Finished difference Result 631 states and 864 transitions. [2020-09-04 16:34:24,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:24,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-09-04 16:34:24,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:24,094 INFO L225 Difference]: With dead ends: 631 [2020-09-04 16:34:24,095 INFO L226 Difference]: Without dead ends: 429 [2020-09-04 16:34:24,097 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 16:34:24,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2020-09-04 16:34:24,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 427. [2020-09-04 16:34:24,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2020-09-04 16:34:24,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 574 transitions. [2020-09-04 16:34:24,143 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 574 transitions. Word has length 63 [2020-09-04 16:34:24,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:24,143 INFO L479 AbstractCegarLoop]: Abstraction has 427 states and 574 transitions. [2020-09-04 16:34:24,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:24,144 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 574 transitions. [2020-09-04 16:34:24,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-09-04 16:34:24,147 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:24,147 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 16:34:24,148 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 16:34:24,148 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:24,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:24,148 INFO L82 PathProgramCache]: Analyzing trace with hash 361296622, now seen corresponding path program 1 times [2020-09-04 16:34:24,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:24,149 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1499078658] [2020-09-04 16:34:24,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:24,151 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:24,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:24,225 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 16:34:24,226 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1499078658] [2020-09-04 16:34:24,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:24,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:24,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021402967] [2020-09-04 16:34:24,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:24,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:24,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:24,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:24,232 INFO L87 Difference]: Start difference. First operand 427 states and 574 transitions. Second operand 3 states. [2020-09-04 16:34:24,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:24,319 INFO L93 Difference]: Finished difference Result 1183 states and 1616 transitions. [2020-09-04 16:34:24,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:24,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-09-04 16:34:24,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:24,326 INFO L225 Difference]: With dead ends: 1183 [2020-09-04 16:34:24,326 INFO L226 Difference]: Without dead ends: 793 [2020-09-04 16:34:24,329 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 16:34:24,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2020-09-04 16:34:24,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 791. [2020-09-04 16:34:24,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-09-04 16:34:24,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1062 transitions. [2020-09-04 16:34:24,408 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1062 transitions. Word has length 64 [2020-09-04 16:34:24,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:24,409 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 1062 transitions. [2020-09-04 16:34:24,409 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:24,410 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1062 transitions. [2020-09-04 16:34:24,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-09-04 16:34:24,413 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:24,413 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 16:34:24,413 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 16:34:24,414 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:24,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:24,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1477714988, now seen corresponding path program 1 times [2020-09-04 16:34:24,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:24,415 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [347259641] [2020-09-04 16:34:24,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:24,417 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:24,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:24,518 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 16:34:24,519 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [347259641] [2020-09-04 16:34:24,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:24,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:24,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028011185] [2020-09-04 16:34:24,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:24,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:24,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:24,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:24,523 INFO L87 Difference]: Start difference. First operand 791 states and 1062 transitions. Second operand 3 states. [2020-09-04 16:34:24,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:24,641 INFO L93 Difference]: Finished difference Result 971 states and 1312 transitions. [2020-09-04 16:34:24,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:24,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-09-04 16:34:24,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:24,648 INFO L225 Difference]: With dead ends: 971 [2020-09-04 16:34:24,649 INFO L226 Difference]: Without dead ends: 969 [2020-09-04 16:34:24,650 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 16:34:24,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2020-09-04 16:34:24,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 791. [2020-09-04 16:34:24,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-09-04 16:34:24,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1054 transitions. [2020-09-04 16:34:24,731 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1054 transitions. Word has length 64 [2020-09-04 16:34:24,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:24,732 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 1054 transitions. [2020-09-04 16:34:24,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:24,733 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1054 transitions. [2020-09-04 16:34:24,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-09-04 16:34:24,736 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:24,736 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:34:24,736 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 16:34:24,737 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:24,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:24,737 INFO L82 PathProgramCache]: Analyzing trace with hash 628943709, now seen corresponding path program 1 times [2020-09-04 16:34:24,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:24,738 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1620413636] [2020-09-04 16:34:24,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:24,742 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:24,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:24,819 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 16:34:24,819 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1620413636] [2020-09-04 16:34:24,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:24,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:24,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101094943] [2020-09-04 16:34:24,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:24,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:24,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:24,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:24,824 INFO L87 Difference]: Start difference. First operand 791 states and 1054 transitions. Second operand 3 states. [2020-09-04 16:34:24,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:24,907 INFO L93 Difference]: Finished difference Result 963 states and 1288 transitions. [2020-09-04 16:34:24,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:24,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-09-04 16:34:24,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:24,914 INFO L225 Difference]: With dead ends: 963 [2020-09-04 16:34:24,914 INFO L226 Difference]: Without dead ends: 961 [2020-09-04 16:34:24,915 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 16:34:24,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2020-09-04 16:34:24,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 791. [2020-09-04 16:34:24,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-09-04 16:34:24,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1046 transitions. [2020-09-04 16:34:24,988 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1046 transitions. Word has length 65 [2020-09-04 16:34:24,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:24,988 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 1046 transitions. [2020-09-04 16:34:24,988 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:24,989 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1046 transitions. [2020-09-04 16:34:24,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-09-04 16:34:24,991 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:24,992 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 16:34:24,992 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 16:34:24,993 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:24,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:24,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1684460868, now seen corresponding path program 1 times [2020-09-04 16:34:24,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:24,994 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1662638041] [2020-09-04 16:34:24,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:24,999 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:25,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:25,041 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 16:34:25,042 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1662638041] [2020-09-04 16:34:25,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:25,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:25,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755655210] [2020-09-04 16:34:25,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:25,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:25,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:25,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:25,049 INFO L87 Difference]: Start difference. First operand 791 states and 1046 transitions. Second operand 3 states. [2020-09-04 16:34:25,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:25,210 INFO L93 Difference]: Finished difference Result 2251 states and 3000 transitions. [2020-09-04 16:34:25,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:25,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-09-04 16:34:25,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:25,219 INFO L225 Difference]: With dead ends: 2251 [2020-09-04 16:34:25,219 INFO L226 Difference]: Without dead ends: 1497 [2020-09-04 16:34:25,221 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 16:34:25,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2020-09-04 16:34:25,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1495. [2020-09-04 16:34:25,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1495 states. [2020-09-04 16:34:25,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1958 transitions. [2020-09-04 16:34:25,339 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 1958 transitions. Word has length 65 [2020-09-04 16:34:25,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:25,339 INFO L479 AbstractCegarLoop]: Abstraction has 1495 states and 1958 transitions. [2020-09-04 16:34:25,339 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:25,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1958 transitions. [2020-09-04 16:34:25,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-09-04 16:34:25,344 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:25,344 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 16:34:25,345 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 16:34:25,345 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:25,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:25,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1510854248, now seen corresponding path program 1 times [2020-09-04 16:34:25,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:25,349 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [501324214] [2020-09-04 16:34:25,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:25,352 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:25,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:25,395 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 16:34:25,396 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [501324214] [2020-09-04 16:34:25,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:25,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:25,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080340468] [2020-09-04 16:34:25,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:25,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:25,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:25,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:25,398 INFO L87 Difference]: Start difference. First operand 1495 states and 1958 transitions. Second operand 3 states. [2020-09-04 16:34:25,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:25,533 INFO L93 Difference]: Finished difference Result 1803 states and 2360 transitions. [2020-09-04 16:34:25,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:25,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-09-04 16:34:25,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:25,544 INFO L225 Difference]: With dead ends: 1803 [2020-09-04 16:34:25,545 INFO L226 Difference]: Without dead ends: 1801 [2020-09-04 16:34:25,547 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 16:34:25,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2020-09-04 16:34:25,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1495. [2020-09-04 16:34:25,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1495 states. [2020-09-04 16:34:25,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1942 transitions. [2020-09-04 16:34:25,688 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 1942 transitions. Word has length 66 [2020-09-04 16:34:25,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:25,688 INFO L479 AbstractCegarLoop]: Abstraction has 1495 states and 1942 transitions. [2020-09-04 16:34:25,688 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:25,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1942 transitions. [2020-09-04 16:34:25,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-09-04 16:34:25,691 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:25,691 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 16:34:25,692 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 16:34:25,692 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:25,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:25,692 INFO L82 PathProgramCache]: Analyzing trace with hash -678433246, now seen corresponding path program 1 times [2020-09-04 16:34:25,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:25,693 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1323314662] [2020-09-04 16:34:25,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:25,696 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:25,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:25,740 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 16:34:25,740 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1323314662] [2020-09-04 16:34:25,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:25,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:25,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429748059] [2020-09-04 16:34:25,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:25,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:25,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:25,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:25,744 INFO L87 Difference]: Start difference. First operand 1495 states and 1942 transitions. Second operand 3 states. [2020-09-04 16:34:25,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:25,951 INFO L93 Difference]: Finished difference Result 4315 states and 5624 transitions. [2020-09-04 16:34:25,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:25,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-09-04 16:34:25,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:25,968 INFO L225 Difference]: With dead ends: 4315 [2020-09-04 16:34:25,969 INFO L226 Difference]: Without dead ends: 2857 [2020-09-04 16:34:25,975 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 16:34:25,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2020-09-04 16:34:26,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 2855. [2020-09-04 16:34:26,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2855 states. [2020-09-04 16:34:26,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2855 states to 2855 states and 3654 transitions. [2020-09-04 16:34:26,244 INFO L78 Accepts]: Start accepts. Automaton has 2855 states and 3654 transitions. Word has length 66 [2020-09-04 16:34:26,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:26,245 INFO L479 AbstractCegarLoop]: Abstraction has 2855 states and 3654 transitions. [2020-09-04 16:34:26,245 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:26,245 INFO L276 IsEmpty]: Start isEmpty. Operand 2855 states and 3654 transitions. [2020-09-04 16:34:26,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-09-04 16:34:26,248 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:26,249 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 16:34:26,249 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 16:34:26,249 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:26,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:26,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1214689743, now seen corresponding path program 1 times [2020-09-04 16:34:26,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:26,251 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [461650113] [2020-09-04 16:34:26,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:26,253 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:26,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:26,298 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 16:34:26,299 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [461650113] [2020-09-04 16:34:26,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:26,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:26,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221043509] [2020-09-04 16:34:26,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:26,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:26,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:26,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:26,302 INFO L87 Difference]: Start difference. First operand 2855 states and 3654 transitions. Second operand 3 states. [2020-09-04 16:34:26,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:26,500 INFO L93 Difference]: Finished difference Result 3403 states and 4328 transitions. [2020-09-04 16:34:26,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:26,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2020-09-04 16:34:26,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:26,519 INFO L225 Difference]: With dead ends: 3403 [2020-09-04 16:34:26,519 INFO L226 Difference]: Without dead ends: 3401 [2020-09-04 16:34:26,522 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 16:34:26,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3401 states. [2020-09-04 16:34:26,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3401 to 2855. [2020-09-04 16:34:26,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2855 states. [2020-09-04 16:34:26,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2855 states to 2855 states and 3622 transitions. [2020-09-04 16:34:26,830 INFO L78 Accepts]: Start accepts. Automaton has 2855 states and 3622 transitions. Word has length 67 [2020-09-04 16:34:26,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:26,830 INFO L479 AbstractCegarLoop]: Abstraction has 2855 states and 3622 transitions. [2020-09-04 16:34:26,831 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:26,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2855 states and 3622 transitions. [2020-09-04 16:34:26,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-09-04 16:34:26,836 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:26,836 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 16:34:26,836 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 16:34:26,837 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:26,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:26,837 INFO L82 PathProgramCache]: Analyzing trace with hash 443652336, now seen corresponding path program 1 times [2020-09-04 16:34:26,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:26,838 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [582276508] [2020-09-04 16:34:26,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:26,840 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:26,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:26,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:26,879 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 16:34:26,880 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [582276508] [2020-09-04 16:34:26,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:26,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:26,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702492415] [2020-09-04 16:34:26,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:26,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:26,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:26,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:26,882 INFO L87 Difference]: Start difference. First operand 2855 states and 3622 transitions. Second operand 3 states. [2020-09-04 16:34:27,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:27,353 INFO L93 Difference]: Finished difference Result 8299 states and 10536 transitions. [2020-09-04 16:34:27,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:27,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2020-09-04 16:34:27,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:27,389 INFO L225 Difference]: With dead ends: 8299 [2020-09-04 16:34:27,390 INFO L226 Difference]: Without dead ends: 5481 [2020-09-04 16:34:27,403 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 16:34:27,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5481 states. [2020-09-04 16:34:27,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5481 to 5479. [2020-09-04 16:34:27,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5479 states. [2020-09-04 16:34:27,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5479 states to 5479 states and 6822 transitions. [2020-09-04 16:34:27,879 INFO L78 Accepts]: Start accepts. Automaton has 5479 states and 6822 transitions. Word has length 67 [2020-09-04 16:34:27,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:27,880 INFO L479 AbstractCegarLoop]: Abstraction has 5479 states and 6822 transitions. [2020-09-04 16:34:27,880 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:27,880 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 6822 transitions. [2020-09-04 16:34:27,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-09-04 16:34:27,885 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:27,885 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 16:34:27,886 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 16:34:27,886 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:27,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:27,886 INFO L82 PathProgramCache]: Analyzing trace with hash 192792828, now seen corresponding path program 1 times [2020-09-04 16:34:27,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:27,887 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1797624284] [2020-09-04 16:34:27,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:27,888 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:27,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:27,918 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 16:34:27,918 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1797624284] [2020-09-04 16:34:27,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:27,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:27,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443212088] [2020-09-04 16:34:27,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:27,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:27,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:27,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:27,920 INFO L87 Difference]: Start difference. First operand 5479 states and 6822 transitions. Second operand 3 states. [2020-09-04 16:34:28,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:28,271 INFO L93 Difference]: Finished difference Result 6443 states and 7912 transitions. [2020-09-04 16:34:28,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:28,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2020-09-04 16:34:28,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:28,304 INFO L225 Difference]: With dead ends: 6443 [2020-09-04 16:34:28,304 INFO L226 Difference]: Without dead ends: 6441 [2020-09-04 16:34:28,309 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 16:34:28,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6441 states. [2020-09-04 16:34:28,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6441 to 5479. [2020-09-04 16:34:28,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5479 states. [2020-09-04 16:34:28,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5479 states to 5479 states and 6758 transitions. [2020-09-04 16:34:28,720 INFO L78 Accepts]: Start accepts. Automaton has 5479 states and 6758 transitions. Word has length 68 [2020-09-04 16:34:28,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:28,720 INFO L479 AbstractCegarLoop]: Abstraction has 5479 states and 6758 transitions. [2020-09-04 16:34:28,720 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:28,720 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 6758 transitions. [2020-09-04 16:34:28,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-09-04 16:34:28,725 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:28,725 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 16:34:28,726 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 16:34:28,726 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:28,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:28,726 INFO L82 PathProgramCache]: Analyzing trace with hash 868567382, now seen corresponding path program 1 times [2020-09-04 16:34:28,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:28,727 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2056114987] [2020-09-04 16:34:28,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:28,729 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:28,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:28,805 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 16:34:28,805 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2056114987] [2020-09-04 16:34:28,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:28,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:28,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855405613] [2020-09-04 16:34:28,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:28,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:28,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:28,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:28,807 INFO L87 Difference]: Start difference. First operand 5479 states and 6758 transitions. Second operand 3 states. [2020-09-04 16:34:29,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:29,341 INFO L93 Difference]: Finished difference Result 15977 states and 19687 transitions. [2020-09-04 16:34:29,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:29,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2020-09-04 16:34:29,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:29,364 INFO L225 Difference]: With dead ends: 15977 [2020-09-04 16:34:29,365 INFO L226 Difference]: Without dead ends: 5479 [2020-09-04 16:34:29,384 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 16:34:29,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2020-09-04 16:34:29,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5479. [2020-09-04 16:34:29,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5479 states. [2020-09-04 16:34:29,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5479 states to 5479 states and 6502 transitions. [2020-09-04 16:34:29,672 INFO L78 Accepts]: Start accepts. Automaton has 5479 states and 6502 transitions. Word has length 68 [2020-09-04 16:34:29,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:29,672 INFO L479 AbstractCegarLoop]: Abstraction has 5479 states and 6502 transitions. [2020-09-04 16:34:29,673 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:29,673 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 6502 transitions. [2020-09-04 16:34:29,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-09-04 16:34:29,677 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:29,677 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 16:34:29,678 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 16:34:29,678 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:29,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:29,678 INFO L82 PathProgramCache]: Analyzing trace with hash 875079941, now seen corresponding path program 1 times [2020-09-04 16:34:29,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:29,679 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1914215086] [2020-09-04 16:34:29,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:29,680 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:29,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:29,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:29,712 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 16:34:29,713 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1914215086] [2020-09-04 16:34:29,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:29,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:29,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525528412] [2020-09-04 16:34:29,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:29,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:29,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:29,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:29,715 INFO L87 Difference]: Start difference. First operand 5479 states and 6502 transitions. Second operand 3 states. [2020-09-04 16:34:29,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:29,934 INFO L93 Difference]: Finished difference Result 5479 states and 6502 transitions. [2020-09-04 16:34:29,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:29,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2020-09-04 16:34:29,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:29,935 INFO L225 Difference]: With dead ends: 5479 [2020-09-04 16:34:29,935 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 16:34:29,949 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 16:34:29,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 16:34:29,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 16:34:29,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 16:34:29,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 16:34:29,950 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2020-09-04 16:34:29,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:29,950 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 16:34:29,951 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:29,951 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 16:34:29,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 16:34:29,951 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 16:34:29,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 16:34:31,602 WARN L193 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 289 DAG size of output: 159 [2020-09-04 16:34:31,743 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 23 [2020-09-04 16:34:32,742 WARN L193 SmtUtils]: Spent 995.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2020-09-04 16:34:32,997 WARN L193 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 57 [2020-09-04 16:34:33,215 WARN L193 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 55 [2020-09-04 16:34:33,734 WARN L193 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 387 DAG size of output: 23 [2020-09-04 16:34:34,224 WARN L193 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 352 DAG size of output: 11 [2020-09-04 16:34:35,071 WARN L193 SmtUtils]: Spent 841.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2020-09-04 16:34:35,539 WARN L193 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 93 [2020-09-04 16:34:35,710 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 37 [2020-09-04 16:34:35,975 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 279 DAG size of output: 15 [2020-09-04 16:34:36,571 WARN L193 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 482 DAG size of output: 15 [2020-09-04 16:34:36,995 WARN L193 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 542 DAG size of output: 3 [2020-09-04 16:34:37,338 WARN L193 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 283 DAG size of output: 35 [2020-09-04 16:34:38,564 WARN L193 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 293 DAG size of output: 159 [2020-09-04 16:34:38,808 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 57 [2020-09-04 16:34:38,980 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 25 [2020-09-04 16:34:39,635 WARN L193 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 91 [2020-09-04 16:34:40,878 WARN L193 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 671 DAG size of output: 7 [2020-09-04 16:34:43,280 WARN L193 SmtUtils]: Spent 2.40 s on a formula simplification that was a NOOP. DAG size: 291 [2020-09-04 16:34:43,928 WARN L193 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 91 [2020-09-04 16:34:44,051 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 35 [2020-09-04 16:34:44,212 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 37 [2020-09-04 16:34:44,438 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 17 [2020-09-04 16:34:44,811 WARN L193 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 91 [2020-09-04 16:34:45,665 WARN L193 SmtUtils]: Spent 851.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2020-09-04 16:34:45,914 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 275 DAG size of output: 7 [2020-09-04 16:34:46,382 WARN L193 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 321 DAG size of output: 55 [2020-09-04 16:34:46,552 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 25 [2020-09-04 16:34:46,941 WARN L193 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 352 DAG size of output: 11 [2020-09-04 16:34:47,231 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 281 DAG size of output: 23 [2020-09-04 16:34:47,682 WARN L193 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 93 [2020-09-04 16:34:48,149 WARN L193 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 285 DAG size of output: 55 [2020-09-04 16:34:48,642 WARN L193 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 340 DAG size of output: 35 [2020-09-04 16:34:48,871 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 17 [2020-09-04 16:34:49,285 WARN L193 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 542 DAG size of output: 3 [2020-09-04 16:34:52,412 WARN L193 SmtUtils]: Spent 3.12 s on a formula simplification that was a NOOP. DAG size: 159 [2020-09-04 16:34:55,991 WARN L193 SmtUtils]: Spent 3.49 s on a formula simplification that was a NOOP. DAG size: 161 [2020-09-04 16:34:56,478 WARN L193 SmtUtils]: Spent 483.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-09-04 16:34:56,867 WARN L193 SmtUtils]: Spent 384.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-09-04 16:35:00,173 WARN L193 SmtUtils]: Spent 3.22 s on a formula simplification that was a NOOP. DAG size: 159 [2020-09-04 16:35:01,436 WARN L193 SmtUtils]: Spent 1.26 s on a formula simplification that was a NOOP. DAG size: 93 [2020-09-04 16:35:01,634 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-09-04 16:35:01,870 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-09-04 16:35:05,061 WARN L193 SmtUtils]: Spent 3.19 s on a formula simplification that was a NOOP. DAG size: 159 [2020-09-04 16:35:05,571 WARN L193 SmtUtils]: Spent 505.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-09-04 16:35:06,716 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 91 [2020-09-04 16:35:16,467 WARN L193 SmtUtils]: Spent 9.70 s on a formula simplification that was a NOOP. DAG size: 291 [2020-09-04 16:35:17,542 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 91 [2020-09-04 16:35:17,699 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-09-04 16:35:17,892 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-09-04 16:35:19,031 WARN L193 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 91 [2020-09-04 16:35:22,476 WARN L193 SmtUtils]: Spent 3.44 s on a formula simplification that was a NOOP. DAG size: 161 [2020-09-04 16:35:22,889 WARN L193 SmtUtils]: Spent 400.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-09-04 16:35:24,283 WARN L193 SmtUtils]: Spent 1.23 s on a formula simplification that was a NOOP. DAG size: 93 [2020-09-04 16:35:24,644 WARN L193 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-09-04 16:35:24,809 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-09-04 16:35:24,856 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:35:24,856 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:35:24,856 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:35:24,857 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 16:35:24,857 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 16:35:24,857 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:35:24,857 INFO L264 CegarLoopResult]: At program point L126(line 126) the Hoare annotation is: (= main_~lk8~0 1) [2020-09-04 16:35:24,857 INFO L264 CegarLoopResult]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2020-09-04 16:35:24,857 INFO L271 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-09-04 16:35:24,857 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 16:35:24,858 INFO L271 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: true [2020-09-04 16:35:24,858 INFO L271 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: true [2020-09-04 16:35:24,858 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 4 135) the Hoare annotation is: true [2020-09-04 16:35:24,860 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 16:35:24,860 INFO L271 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: true [2020-09-04 16:35:24,860 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-09-04 16:35:24,861 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 16:35:24,861 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 16:35:24,861 INFO L271 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: true [2020-09-04 16:35:24,862 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 16:35:24,862 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 16:35:24,863 INFO L264 CegarLoopResult]: At program point L127(line 127) the Hoare annotation is: (= main_~lk8~0 1) [2020-09-04 16:35:24,863 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 16:35:24,863 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-09-04 16:35:24,863 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 16:35:24,863 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-09-04 16:35:24,864 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-09-04 16:35:24,864 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-09-04 16:35:24,864 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 16:35:24,865 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 16:35:24,865 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-09-04 16:35:24,865 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-09-04 16:35:24,865 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-09-04 16:35:24,865 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 16:35:24,865 INFO L271 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: true [2020-09-04 16:35:24,866 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-09-04 16:35:24,866 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 4 135) the Hoare annotation is: true [2020-09-04 16:35:24,866 INFO L271 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: true [2020-09-04 16:35:24,867 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 16:35:24,867 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) the Hoare annotation is: false [2020-09-04 16:35:24,867 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 135) the Hoare annotation is: true [2020-09-04 16:35:24,867 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 16:35:24,867 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-09-04 16:35:24,868 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 16:35:24,869 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 16:35:24,869 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 16:35:24,869 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-09-04 16:35:24,869 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-09-04 16:35:24,870 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 16:35:24,870 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-09-04 16:35:24,870 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 16:35:24,871 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 16:35:24,871 INFO L271 CegarLoopResult]: At program point L56(lines 56 58) the Hoare annotation is: true [2020-09-04 16:35:24,871 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 16:35:24,872 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 16:35:24,872 INFO L271 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: true [2020-09-04 16:35:24,872 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-09-04 16:35:24,872 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-09-04 16:35:24,872 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-09-04 16:35:24,872 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 16:35:24,873 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 16:35:24,873 INFO L271 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: true [2020-09-04 16:35:24,873 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-09-04 16:35:24,873 INFO L271 CegarLoopResult]: At program point L131(lines 5 135) the Hoare annotation is: true [2020-09-04 16:35:24,873 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 16:35:24,873 INFO L271 CegarLoopResult]: At program point L57(line 57) the Hoare annotation is: true [2020-09-04 16:35:24,874 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 16:35:24,875 INFO L271 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-09-04 16:35:24,875 INFO L271 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: true [2020-09-04 16:35:24,875 INFO L271 CegarLoopResult]: At program point L24-2(line 24) the Hoare annotation is: true [2020-09-04 16:35:24,875 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 16:35:24,875 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-09-04 16:35:24,876 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 16:35:24,877 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 16:35:24,877 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-09-04 16:35:24,877 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 16:35:24,877 INFO L271 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: true [2020-09-04 16:35:24,878 INFO L271 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-09-04 16:35:24,878 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-09-04 16:35:24,878 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-09-04 16:35:24,878 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-09-04 16:35:24,878 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 16:35:24,878 INFO L271 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: true [2020-09-04 16:35:24,878 INFO L271 CegarLoopResult]: At program point L34-1(line 34) the Hoare annotation is: true [2020-09-04 16:35:24,879 INFO L271 CegarLoopResult]: At program point L34-2(line 34) the Hoare annotation is: true [2020-09-04 16:35:24,880 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 16:35:24,880 INFO L271 CegarLoopResult]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2020-09-04 16:35:24,880 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 16:35:24,883 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 16:35:24,883 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-09-04 16:35:24,883 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-09-04 16:35:24,883 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-09-04 16:35:24,884 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 16:35:24,884 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-09-04 16:35:24,884 INFO L264 CegarLoopResult]: At program point L134(line 134) the Hoare annotation is: false [2020-09-04 16:35:24,885 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 16:35:24,885 INFO L271 CegarLoopResult]: At program point L35(lines 35 37) the Hoare annotation is: true [2020-09-04 16:35:24,885 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 16:35:24,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 04:35:24 BoogieIcfgContainer [2020-09-04 16:35:24,901 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 16:35:24,903 INFO L168 Benchmark]: Toolchain (without parser) took 63335.00 ms. Allocated memory was 137.9 MB in the beginning and 1.1 GB in the end (delta: 961.0 MB). Free memory was 102.1 MB in the beginning and 94.8 MB in the end (delta: 7.3 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2020-09-04 16:35:24,903 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 137.9 MB. Free memory was 120.5 MB in the beginning and 120.2 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 16:35:24,904 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.23 ms. Allocated memory is still 137.9 MB. Free memory was 101.9 MB in the beginning and 91.4 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2020-09-04 16:35:24,904 INFO L168 Benchmark]: Boogie Preprocessor took 157.68 ms. Allocated memory was 137.9 MB in the beginning and 199.8 MB in the end (delta: 61.9 MB). Free memory was 91.4 MB in the beginning and 177.7 MB in the end (delta: -86.4 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2020-09-04 16:35:24,905 INFO L168 Benchmark]: RCFGBuilder took 467.93 ms. Allocated memory is still 199.8 MB. Free memory was 177.7 MB in the beginning and 155.4 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2020-09-04 16:35:24,905 INFO L168 Benchmark]: TraceAbstraction took 62345.50 ms. Allocated memory was 199.8 MB in the beginning and 1.1 GB in the end (delta: 899.2 MB). Free memory was 154.7 MB in the beginning and 94.8 MB in the end (delta: 59.9 MB). Peak memory consumption was 998.5 MB. Max. memory is 7.1 GB. [2020-09-04 16:35:24,908 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.39 ms. Allocated memory is still 137.9 MB. Free memory was 120.5 MB in the beginning and 120.2 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 358.23 ms. Allocated memory is still 137.9 MB. Free memory was 101.9 MB in the beginning and 91.4 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 157.68 ms. Allocated memory was 137.9 MB in the beginning and 199.8 MB in the end (delta: 61.9 MB). Free memory was 91.4 MB in the beginning and 177.7 MB in the end (delta: -86.4 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 467.93 ms. Allocated memory is still 199.8 MB. Free memory was 177.7 MB in the beginning and 155.4 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 62345.50 ms. Allocated memory was 199.8 MB in the beginning and 1.1 GB in the end (delta: 899.2 MB). Free memory was 154.7 MB in the beginning and 94.8 MB in the end (delta: 59.9 MB). Peak memory consumption was 998.5 MB. 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: 7.3s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 54.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2345 SDtfs, 845 SDslu, 1664 SDs, 0 SdLazy, 79 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s 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.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 2257 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 98 LocationsWithAnnotation, 98 PreInvPairs, 10602 NumberOfFragments, 32360 HoareAnnotationTreeSize, 98 FomulaSimplifications, 323126 FormulaSimplificationTreeSizeReduction, 19.3s HoareSimplificationTime, 98 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 35.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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...