/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_7.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 16:34:13,609 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 16:34:13,613 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 16:34:13,662 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 16:34:13,662 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 16:34:13,673 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 16:34:13,677 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 16:34:13,680 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 16:34:13,682 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 16:34:13,686 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 16:34:13,687 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 16:34:13,690 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 16:34:13,691 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 16:34:13,694 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 16:34:13,697 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 16:34:13,698 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 16:34:13,700 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 16:34:13,701 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 16:34:13,704 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 16:34:13,712 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 16:34:13,715 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 16:34:13,716 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 16:34:13,718 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 16:34:13,718 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 16:34:13,722 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 16:34:13,723 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 16:34:13,723 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 16:34:13,729 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 16:34:13,729 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 16:34:13,730 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 16:34:13,731 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 16:34:13,732 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 16:34:13,732 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 16:34:13,733 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 16:34:13,735 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 16:34:13,735 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 16:34:13,736 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 16:34:13,736 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 16:34:13,736 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 16:34:13,738 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 16:34:13,740 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 16:34:13,741 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:13,760 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 16:34:13,761 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 16:34:13,762 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 16:34:13,763 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 16:34:13,763 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 16:34:13,763 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 16:34:13,763 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 16:34:13,764 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 16:34:13,764 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 16:34:13,764 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 16:34:13,764 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 16:34:13,765 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 16:34:13,765 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 16:34:13,765 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 16:34:13,765 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 16:34:13,766 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 16:34:13,766 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 16:34:13,766 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 16:34:13,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:34:13,766 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 16:34:13,767 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 16:34:13,767 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 16:34:13,767 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 16:34:14,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 16:34:14,215 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 16:34:14,219 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 16:34:14,221 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 16:34:14,221 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 16:34:14,222 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2020-09-04 16:34:14,303 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/09a2b48c1/ca19578ad1584391acb0f77b20f41030/FLAGaac85a8d7 [2020-09-04 16:34:14,889 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 16:34:14,890 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/locks/test_locks_7.c [2020-09-04 16:34:14,900 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/09a2b48c1/ca19578ad1584391acb0f77b20f41030/FLAGaac85a8d7 [2020-09-04 16:34:15,199 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/09a2b48c1/ca19578ad1584391acb0f77b20f41030 [2020-09-04 16:34:15,213 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 16:34:15,215 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 16:34:15,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 16:34:15,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 16:34:15,221 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 16:34:15,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:34:15" (1/1) ... [2020-09-04 16:34:15,227 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@790fb128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:34:15, skipping insertion in model container [2020-09-04 16:34:15,227 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:34:15" (1/1) ... [2020-09-04 16:34:15,237 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 16:34:15,276 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 16:34:15,554 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:34:15,563 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 16:34:15,621 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:34:15,644 INFO L208 MainTranslator]: Completed translation [2020-09-04 16:34:15,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:34:15 WrapperNode [2020-09-04 16:34:15,646 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 16:34:15,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 16:34:15,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 16:34:15,647 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 16:34:15,839 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:15" (1/1) ... [2020-09-04 16:34:15,840 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:15" (1/1) ... [2020-09-04 16:34:15,849 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:15" (1/1) ... [2020-09-04 16:34:15,850 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:15" (1/1) ... [2020-09-04 16:34:15,864 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:15" (1/1) ... [2020-09-04 16:34:15,878 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:15" (1/1) ... [2020-09-04 16:34:15,884 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:15" (1/1) ... [2020-09-04 16:34:15,889 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 16:34:15,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 16:34:15,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 16:34:15,890 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 16:34:15,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:34:15" (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:16,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 16:34:16,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 16:34:16,011 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 16:34:16,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 16:34:16,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 16:34:16,012 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 16:34:16,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 16:34:16,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 16:34:16,351 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 16:34:16,352 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-04 16:34:16,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:34:16 BoogieIcfgContainer [2020-09-04 16:34:16,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 16:34:16,361 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 16:34:16,361 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 16:34:16,366 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 16:34:16,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 04:34:15" (1/3) ... [2020-09-04 16:34:16,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2292372b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:34:16, skipping insertion in model container [2020-09-04 16:34:16,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:34:15" (2/3) ... [2020-09-04 16:34:16,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2292372b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:34:16, skipping insertion in model container [2020-09-04 16:34:16,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:34:16" (3/3) ... [2020-09-04 16:34:16,371 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2020-09-04 16:34:16,386 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 16:34:16,400 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 16:34:16,431 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 16:34:16,468 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 16:34:16,468 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 16:34:16,468 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 16:34:16,469 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 16:34:16,469 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 16:34:16,470 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 16:34:16,470 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 16:34:16,470 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 16:34:16,496 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2020-09-04 16:34:16,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-09-04 16:34:16,515 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:16,517 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:34:16,518 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:16,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:16,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1826051656, now seen corresponding path program 1 times [2020-09-04 16:34:16,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:16,549 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1580191424] [2020-09-04 16:34:16,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:16,635 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:16,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:16,852 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:16,857 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1580191424] [2020-09-04 16:34:16,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:16,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:16,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139876515] [2020-09-04 16:34:16,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:16,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:16,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:16,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:16,892 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 3 states. [2020-09-04 16:34:16,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:16,995 INFO L93 Difference]: Finished difference Result 191 states and 260 transitions. [2020-09-04 16:34:16,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:16,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-09-04 16:34:16,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:17,015 INFO L225 Difference]: With dead ends: 191 [2020-09-04 16:34:17,016 INFO L226 Difference]: Without dead ends: 128 [2020-09-04 16:34:17,022 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:17,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-09-04 16:34:17,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2020-09-04 16:34:17,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-09-04 16:34:17,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 164 transitions. [2020-09-04 16:34:17,098 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 164 transitions. Word has length 55 [2020-09-04 16:34:17,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:17,099 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 164 transitions. [2020-09-04 16:34:17,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:17,100 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 164 transitions. [2020-09-04 16:34:17,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-09-04 16:34:17,102 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:17,103 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] [2020-09-04 16:34:17,103 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 16:34:17,104 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:17,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:17,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1965492109, now seen corresponding path program 1 times [2020-09-04 16:34:17,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:17,105 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1824098156] [2020-09-04 16:34:17,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:17,108 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:17,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:17,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:17,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:17,226 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1824098156] [2020-09-04 16:34:17,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:17,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:17,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695577558] [2020-09-04 16:34:17,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:17,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:17,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:17,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:17,229 INFO L87 Difference]: Start difference. First operand 126 states and 164 transitions. Second operand 3 states. [2020-09-04 16:34:17,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:17,279 INFO L93 Difference]: Finished difference Result 154 states and 202 transitions. [2020-09-04 16:34:17,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:17,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-09-04 16:34:17,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:17,283 INFO L225 Difference]: With dead ends: 154 [2020-09-04 16:34:17,283 INFO L226 Difference]: Without dead ends: 152 [2020-09-04 16:34:17,285 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:17,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-09-04 16:34:17,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 126. [2020-09-04 16:34:17,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-09-04 16:34:17,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 163 transitions. [2020-09-04 16:34:17,315 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 163 transitions. Word has length 56 [2020-09-04 16:34:17,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:17,315 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 163 transitions. [2020-09-04 16:34:17,315 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:17,316 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 163 transitions. [2020-09-04 16:34:17,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-09-04 16:34:17,318 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:17,318 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] [2020-09-04 16:34:17,318 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 16:34:17,318 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:17,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:17,319 INFO L82 PathProgramCache]: Analyzing trace with hash 773271458, now seen corresponding path program 1 times [2020-09-04 16:34:17,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:17,320 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1799606859] [2020-09-04 16:34:17,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:17,322 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:17,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:17,380 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:17,381 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1799606859] [2020-09-04 16:34:17,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:17,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:17,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796657715] [2020-09-04 16:34:17,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:17,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:17,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:17,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:17,384 INFO L87 Difference]: Start difference. First operand 126 states and 163 transitions. Second operand 3 states. [2020-09-04 16:34:17,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:17,439 INFO L93 Difference]: Finished difference Result 306 states and 415 transitions. [2020-09-04 16:34:17,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:17,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-09-04 16:34:17,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:17,443 INFO L225 Difference]: With dead ends: 306 [2020-09-04 16:34:17,443 INFO L226 Difference]: Without dead ends: 213 [2020-09-04 16:34:17,445 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:17,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-09-04 16:34:17,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2020-09-04 16:34:17,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-09-04 16:34:17,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 280 transitions. [2020-09-04 16:34:17,484 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 280 transitions. Word has length 56 [2020-09-04 16:34:17,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:17,485 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 280 transitions. [2020-09-04 16:34:17,485 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:17,485 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 280 transitions. [2020-09-04 16:34:17,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-09-04 16:34:17,488 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:17,488 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] [2020-09-04 16:34:17,488 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 16:34:17,489 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:17,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:17,489 INFO L82 PathProgramCache]: Analyzing trace with hash -610540190, now seen corresponding path program 1 times [2020-09-04 16:34:17,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:17,490 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2133798543] [2020-09-04 16:34:17,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:17,492 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:17,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:17,610 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:17,611 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2133798543] [2020-09-04 16:34:17,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:17,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:17,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276816799] [2020-09-04 16:34:17,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:17,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:17,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:17,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:17,613 INFO L87 Difference]: Start difference. First operand 211 states and 280 transitions. Second operand 3 states. [2020-09-04 16:34:17,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:17,658 INFO L93 Difference]: Finished difference Result 259 states and 346 transitions. [2020-09-04 16:34:17,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:17,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-09-04 16:34:17,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:17,662 INFO L225 Difference]: With dead ends: 259 [2020-09-04 16:34:17,662 INFO L226 Difference]: Without dead ends: 257 [2020-09-04 16:34:17,663 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:17,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-09-04 16:34:17,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 211. [2020-09-04 16:34:17,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-09-04 16:34:17,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 278 transitions. [2020-09-04 16:34:17,696 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 278 transitions. Word has length 57 [2020-09-04 16:34:17,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:17,696 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 278 transitions. [2020-09-04 16:34:17,697 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:17,697 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 278 transitions. [2020-09-04 16:34:17,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-09-04 16:34:17,699 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:17,699 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] [2020-09-04 16:34:17,700 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 16:34:17,700 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:17,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:17,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1798143236, now seen corresponding path program 1 times [2020-09-04 16:34:17,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:17,701 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1509812998] [2020-09-04 16:34:17,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:17,703 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:17,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:17,745 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:17,746 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1509812998] [2020-09-04 16:34:17,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:17,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:17,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949148999] [2020-09-04 16:34:17,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:17,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:17,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:17,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:17,748 INFO L87 Difference]: Start difference. First operand 211 states and 278 transitions. Second operand 3 states. [2020-09-04 16:34:17,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:17,806 INFO L93 Difference]: Finished difference Result 555 states and 752 transitions. [2020-09-04 16:34:17,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:17,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-09-04 16:34:17,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:17,810 INFO L225 Difference]: With dead ends: 555 [2020-09-04 16:34:17,810 INFO L226 Difference]: Without dead ends: 377 [2020-09-04 16:34:17,812 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:17,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2020-09-04 16:34:17,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2020-09-04 16:34:17,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-09-04 16:34:17,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 498 transitions. [2020-09-04 16:34:17,872 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 498 transitions. Word has length 57 [2020-09-04 16:34:17,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:17,873 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 498 transitions. [2020-09-04 16:34:17,873 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:17,873 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 498 transitions. [2020-09-04 16:34:17,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-09-04 16:34:17,882 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:17,886 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] [2020-09-04 16:34:17,886 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 16:34:17,886 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:17,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:17,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1136837537, now seen corresponding path program 1 times [2020-09-04 16:34:17,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:17,889 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1905342169] [2020-09-04 16:34:17,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:17,892 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:17,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:17,964 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:17,965 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1905342169] [2020-09-04 16:34:17,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:17,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:17,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912797619] [2020-09-04 16:34:17,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:17,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:17,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:17,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:17,967 INFO L87 Difference]: Start difference. First operand 375 states and 498 transitions. Second operand 3 states. [2020-09-04 16:34:18,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:18,009 INFO L93 Difference]: Finished difference Result 459 states and 612 transitions. [2020-09-04 16:34:18,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:18,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2020-09-04 16:34:18,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:18,014 INFO L225 Difference]: With dead ends: 459 [2020-09-04 16:34:18,014 INFO L226 Difference]: Without dead ends: 457 [2020-09-04 16:34:18,015 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:18,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2020-09-04 16:34:18,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 375. [2020-09-04 16:34:18,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-09-04 16:34:18,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 494 transitions. [2020-09-04 16:34:18,047 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 494 transitions. Word has length 58 [2020-09-04 16:34:18,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:18,048 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 494 transitions. [2020-09-04 16:34:18,048 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:18,048 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 494 transitions. [2020-09-04 16:34:18,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-09-04 16:34:18,050 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:18,050 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] [2020-09-04 16:34:18,050 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 16:34:18,050 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:18,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:18,051 INFO L82 PathProgramCache]: Analyzing trace with hash 92380246, now seen corresponding path program 1 times [2020-09-04 16:34:18,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:18,051 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1278684999] [2020-09-04 16:34:18,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:18,053 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:18,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:18,090 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:18,090 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1278684999] [2020-09-04 16:34:18,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:18,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:18,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769334585] [2020-09-04 16:34:18,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:18,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:18,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:18,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:18,092 INFO L87 Difference]: Start difference. First operand 375 states and 494 transitions. Second operand 3 states. [2020-09-04 16:34:18,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:18,172 INFO L93 Difference]: Finished difference Result 1035 states and 1384 transitions. [2020-09-04 16:34:18,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:18,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2020-09-04 16:34:18,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:18,177 INFO L225 Difference]: With dead ends: 1035 [2020-09-04 16:34:18,178 INFO L226 Difference]: Without dead ends: 693 [2020-09-04 16:34:18,180 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:18,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2020-09-04 16:34:18,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 691. [2020-09-04 16:34:18,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2020-09-04 16:34:18,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 906 transitions. [2020-09-04 16:34:18,256 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 906 transitions. Word has length 58 [2020-09-04 16:34:18,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:18,257 INFO L479 AbstractCegarLoop]: Abstraction has 691 states and 906 transitions. [2020-09-04 16:34:18,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:18,257 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 906 transitions. [2020-09-04 16:34:18,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-09-04 16:34:18,259 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:18,259 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] [2020-09-04 16:34:18,259 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 16:34:18,259 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:18,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:18,260 INFO L82 PathProgramCache]: Analyzing trace with hash -529027402, now seen corresponding path program 1 times [2020-09-04 16:34:18,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:18,261 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1957668319] [2020-09-04 16:34:18,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:18,266 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:18,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:18,333 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:18,334 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1957668319] [2020-09-04 16:34:18,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:18,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:18,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142323527] [2020-09-04 16:34:18,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:18,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:18,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:18,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:18,336 INFO L87 Difference]: Start difference. First operand 691 states and 906 transitions. Second operand 3 states. [2020-09-04 16:34:18,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:18,408 INFO L93 Difference]: Finished difference Result 839 states and 1100 transitions. [2020-09-04 16:34:18,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:18,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-09-04 16:34:18,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:18,414 INFO L225 Difference]: With dead ends: 839 [2020-09-04 16:34:18,414 INFO L226 Difference]: Without dead ends: 837 [2020-09-04 16:34:18,415 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:18,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2020-09-04 16:34:18,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 691. [2020-09-04 16:34:18,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2020-09-04 16:34:18,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 898 transitions. [2020-09-04 16:34:18,468 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 898 transitions. Word has length 59 [2020-09-04 16:34:18,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:18,468 INFO L479 AbstractCegarLoop]: Abstraction has 691 states and 898 transitions. [2020-09-04 16:34:18,468 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:18,468 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 898 transitions. [2020-09-04 16:34:18,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-09-04 16:34:18,470 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:18,470 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] [2020-09-04 16:34:18,470 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 16:34:18,471 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:18,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:18,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1430933584, now seen corresponding path program 1 times [2020-09-04 16:34:18,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:18,472 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [489826264] [2020-09-04 16:34:18,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:18,473 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:18,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:18,503 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:18,504 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [489826264] [2020-09-04 16:34:18,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:18,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:18,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287114167] [2020-09-04 16:34:18,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:18,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:18,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:18,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:18,506 INFO L87 Difference]: Start difference. First operand 691 states and 898 transitions. Second operand 3 states. [2020-09-04 16:34:18,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:18,620 INFO L93 Difference]: Finished difference Result 1959 states and 2564 transitions. [2020-09-04 16:34:18,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:18,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-09-04 16:34:18,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:18,628 INFO L225 Difference]: With dead ends: 1959 [2020-09-04 16:34:18,628 INFO L226 Difference]: Without dead ends: 1301 [2020-09-04 16:34:18,630 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:18,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2020-09-04 16:34:18,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1299. [2020-09-04 16:34:18,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1299 states. [2020-09-04 16:34:18,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1666 transitions. [2020-09-04 16:34:18,752 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1666 transitions. Word has length 59 [2020-09-04 16:34:18,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:18,752 INFO L479 AbstractCegarLoop]: Abstraction has 1299 states and 1666 transitions. [2020-09-04 16:34:18,752 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:18,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1666 transitions. [2020-09-04 16:34:18,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-09-04 16:34:18,757 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:18,757 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] [2020-09-04 16:34:18,758 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 16:34:18,758 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:18,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:18,761 INFO L82 PathProgramCache]: Analyzing trace with hash -631232587, now seen corresponding path program 1 times [2020-09-04 16:34:18,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:18,762 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [83182695] [2020-09-04 16:34:18,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:18,764 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:18,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:18,797 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:18,798 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [83182695] [2020-09-04 16:34:18,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:18,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:18,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970015298] [2020-09-04 16:34:18,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:18,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:18,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:18,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:18,800 INFO L87 Difference]: Start difference. First operand 1299 states and 1666 transitions. Second operand 3 states. [2020-09-04 16:34:18,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:18,911 INFO L93 Difference]: Finished difference Result 1559 states and 1988 transitions. [2020-09-04 16:34:18,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:18,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-09-04 16:34:18,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:18,920 INFO L225 Difference]: With dead ends: 1559 [2020-09-04 16:34:18,920 INFO L226 Difference]: Without dead ends: 1557 [2020-09-04 16:34:18,922 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:18,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2020-09-04 16:34:19,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1299. [2020-09-04 16:34:19,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1299 states. [2020-09-04 16:34:19,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1650 transitions. [2020-09-04 16:34:19,057 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1650 transitions. Word has length 60 [2020-09-04 16:34:19,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:19,058 INFO L479 AbstractCegarLoop]: Abstraction has 1299 states and 1650 transitions. [2020-09-04 16:34:19,058 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:19,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1650 transitions. [2020-09-04 16:34:19,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-09-04 16:34:19,060 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:19,060 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] [2020-09-04 16:34:19,061 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 16:34:19,061 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:19,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:19,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1409021686, now seen corresponding path program 1 times [2020-09-04 16:34:19,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:19,062 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1985893613] [2020-09-04 16:34:19,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:19,064 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:19,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:19,114 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:19,114 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1985893613] [2020-09-04 16:34:19,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:19,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:19,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687034280] [2020-09-04 16:34:19,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:19,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:19,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:19,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:19,121 INFO L87 Difference]: Start difference. First operand 1299 states and 1650 transitions. Second operand 3 states. [2020-09-04 16:34:19,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:19,336 INFO L93 Difference]: Finished difference Result 3735 states and 4756 transitions. [2020-09-04 16:34:19,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:19,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-09-04 16:34:19,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:19,353 INFO L225 Difference]: With dead ends: 3735 [2020-09-04 16:34:19,354 INFO L226 Difference]: Without dead ends: 2469 [2020-09-04 16:34:19,358 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:19,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2469 states. [2020-09-04 16:34:19,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2469 to 2467. [2020-09-04 16:34:19,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2467 states. [2020-09-04 16:34:19,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 3074 transitions. [2020-09-04 16:34:19,574 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 3074 transitions. Word has length 60 [2020-09-04 16:34:19,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:19,575 INFO L479 AbstractCegarLoop]: Abstraction has 2467 states and 3074 transitions. [2020-09-04 16:34:19,575 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:19,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3074 transitions. [2020-09-04 16:34:19,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-09-04 16:34:19,578 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:19,578 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:19,578 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 16:34:19,579 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:19,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:19,579 INFO L82 PathProgramCache]: Analyzing trace with hash -729752476, now seen corresponding path program 1 times [2020-09-04 16:34:19,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:19,581 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1063579940] [2020-09-04 16:34:19,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:19,582 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:19,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:19,627 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:19,627 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1063579940] [2020-09-04 16:34:19,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:19,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:19,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669525171] [2020-09-04 16:34:19,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:19,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:19,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:19,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:19,629 INFO L87 Difference]: Start difference. First operand 2467 states and 3074 transitions. Second operand 3 states. [2020-09-04 16:34:19,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:19,955 INFO L93 Difference]: Finished difference Result 7143 states and 8900 transitions. [2020-09-04 16:34:19,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:19,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-09-04 16:34:19,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:19,974 INFO L225 Difference]: With dead ends: 7143 [2020-09-04 16:34:19,975 INFO L226 Difference]: Without dead ends: 3637 [2020-09-04 16:34:19,983 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:19,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3637 states. [2020-09-04 16:34:20,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3637 to 3635. [2020-09-04 16:34:20,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3635 states. [2020-09-04 16:34:20,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3635 states to 3635 states and 4370 transitions. [2020-09-04 16:34:20,266 INFO L78 Accepts]: Start accepts. Automaton has 3635 states and 4370 transitions. Word has length 61 [2020-09-04 16:34:20,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:20,267 INFO L479 AbstractCegarLoop]: Abstraction has 3635 states and 4370 transitions. [2020-09-04 16:34:20,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:20,267 INFO L276 IsEmpty]: Start isEmpty. Operand 3635 states and 4370 transitions. [2020-09-04 16:34:20,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-09-04 16:34:20,272 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:20,272 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:20,272 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 16:34:20,273 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:20,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:20,273 INFO L82 PathProgramCache]: Analyzing trace with hash 495374346, now seen corresponding path program 1 times [2020-09-04 16:34:20,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:20,274 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [618335304] [2020-09-04 16:34:20,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:20,275 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:20,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:20,308 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:20,309 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [618335304] [2020-09-04 16:34:20,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:20,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:20,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048478604] [2020-09-04 16:34:20,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:20,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:20,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:20,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:20,311 INFO L87 Difference]: Start difference. First operand 3635 states and 4370 transitions. Second operand 3 states. [2020-09-04 16:34:20,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:20,629 INFO L93 Difference]: Finished difference Result 4087 states and 4852 transitions. [2020-09-04 16:34:20,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:20,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-09-04 16:34:20,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:20,644 INFO L225 Difference]: With dead ends: 4087 [2020-09-04 16:34:20,645 INFO L226 Difference]: Without dead ends: 2917 [2020-09-04 16:34:20,649 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:20,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2020-09-04 16:34:20,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 2467. [2020-09-04 16:34:20,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2467 states. [2020-09-04 16:34:20,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 2914 transitions. [2020-09-04 16:34:20,815 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 2914 transitions. Word has length 61 [2020-09-04 16:34:20,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:20,815 INFO L479 AbstractCegarLoop]: Abstraction has 2467 states and 2914 transitions. [2020-09-04 16:34:20,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:20,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 2914 transitions. [2020-09-04 16:34:20,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-09-04 16:34:20,818 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:20,818 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:20,818 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 16:34:20,819 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:20,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:20,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1060451273, now seen corresponding path program 1 times [2020-09-04 16:34:20,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:20,820 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1473853058] [2020-09-04 16:34:20,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:20,821 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:20,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:20,848 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:20,849 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1473853058] [2020-09-04 16:34:20,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:20,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:20,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723706341] [2020-09-04 16:34:20,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:20,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:20,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:20,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:20,851 INFO L87 Difference]: Start difference. First operand 2467 states and 2914 transitions. Second operand 3 states. [2020-09-04 16:34:21,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:21,013 INFO L93 Difference]: Finished difference Result 2467 states and 2914 transitions. [2020-09-04 16:34:21,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:21,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-09-04 16:34:21,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:21,015 INFO L225 Difference]: With dead ends: 2467 [2020-09-04 16:34:21,015 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 16:34:21,023 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:21,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 16:34:21,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 16:34:21,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 16:34:21,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 16:34:21,024 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2020-09-04 16:34:21,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:21,024 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 16:34:21,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:21,025 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 16:34:21,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 16:34:21,025 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 16:34:21,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 16:34:21,375 WARN L193 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-09-04 16:34:21,562 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 57 [2020-09-04 16:34:21,858 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 35 [2020-09-04 16:34:22,123 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 275 DAG size of output: 3 [2020-09-04 16:34:22,481 WARN L193 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 340 DAG size of output: 7 [2020-09-04 16:34:22,593 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 15 [2020-09-04 16:34:22,815 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 57 [2020-09-04 16:34:22,953 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 23 [2020-09-04 16:34:23,400 WARN L193 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 91 [2020-09-04 16:34:23,736 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 35 [2020-09-04 16:34:23,895 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 23 [2020-09-04 16:34:24,036 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 11 [2020-09-04 16:34:24,252 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 55 [2020-09-04 16:34:24,664 WARN L193 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 91 [2020-09-04 16:34:25,029 WARN L193 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-09-04 16:34:25,862 WARN L193 SmtUtils]: Spent 737.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2020-09-04 16:34:26,075 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 55 [2020-09-04 16:34:26,311 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 11 [2020-09-04 16:34:26,538 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 15 [2020-09-04 16:34:26,743 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 275 DAG size of output: 3 [2020-09-04 16:34:26,870 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2020-09-04 16:34:27,163 WARN L193 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-09-04 16:34:28,254 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 91 [2020-09-04 16:34:28,718 WARN L193 SmtUtils]: Spent 462.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-09-04 16:34:28,963 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-09-04 16:34:29,557 WARN L193 SmtUtils]: Spent 502.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-09-04 16:34:30,751 WARN L193 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 91 [2020-09-04 16:34:30,950 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-09-04 16:34:31,130 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-09-04 16:34:31,607 WARN L193 SmtUtils]: Spent 403.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-09-04 16:34:32,752 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification that was a NOOP. DAG size: 91 [2020-09-04 16:34:34,026 WARN L193 SmtUtils]: Spent 1.25 s on a formula simplification that was a NOOP. DAG size: 93 [2020-09-04 16:34:34,217 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-09-04 16:34:37,372 WARN L193 SmtUtils]: Spent 3.15 s on a formula simplification that was a NOOP. DAG size: 159 [2020-09-04 16:34:37,782 WARN L193 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-09-04 16:34:38,127 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-09-04 16:34:38,542 WARN L193 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-09-04 16:34:39,787 WARN L193 SmtUtils]: Spent 1.24 s on a formula simplification that was a NOOP. DAG size: 93 [2020-09-04 16:34:39,798 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:34:39,798 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:34:39,799 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:34:39,799 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 16:34:39,799 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 16:34:39,799 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:34:39,800 INFO L264 CegarLoopResult]: At program point L93(line 93) the Hoare annotation is: (let ((.cse5 (= main_~p7~0 0)) (.cse8 (= main_~lk6~0 1)) (.cse7 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse2 (= main_~p6~0 0)) (.cse6 (= main_~p5~0 0)) (.cse4 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse3) (and .cse1 .cse2 .cse6 .cse7 .cse4) (and .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse1 .cse8 .cse7 .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse7 .cse3) (and .cse0 .cse1 .cse6 .cse5 .cse8) (and .cse1 .cse2 .cse6 .cse5 .cse7) (and .cse0 .cse1 .cse5 .cse8 .cse3) (and .cse0 .cse1 .cse6 .cse8 .cse4) (and .cse0 .cse1 .cse2 .cse6 .cse5) (and .cse0 .cse1 .cse8 .cse3 .cse4) (and .cse1 .cse6 .cse8 .cse7 .cse4) (and .cse1 .cse6 .cse5 .cse8 .cse7) (and .cse1 .cse5 .cse8 .cse7 .cse3) (and .cse0 .cse1 .cse2 .cse6 .cse4))) [2020-09-04 16:34:39,800 INFO L264 CegarLoopResult]: At program point L60(line 60) 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:34:39,800 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 4 121) the Hoare annotation is: true [2020-09-04 16:34:39,800 INFO L271 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: true [2020-09-04 16:34:39,800 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-09-04 16:34:39,801 INFO L264 CegarLoopResult]: At program point L102(line 102) the Hoare annotation is: (let ((.cse0 (= main_~p6~0 0)) (.cse4 (= main_~lk7~0 1)) (.cse1 (= main_~p7~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse2 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2 .cse4) (and .cse0 .cse2 .cse4) (and .cse1 .cse3 .cse2))) [2020-09-04 16:34:39,801 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-09-04 16:34:39,801 INFO L264 CegarLoopResult]: At program point L86-1(lines 30 116) the Hoare annotation is: (let ((.cse7 (= main_~lk6~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse9 (= main_~p5~0 0)) (.cse4 (= main_~lk7~0 1)) (.cse2 (= main_~p6~0 0)) (.cse6 (= main_~p3~0 0)) (.cse5 (= main_~p7~0 0)) (.cse8 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse3) (and .cse6 .cse5 .cse7 .cse8 .cse3) (and .cse2 .cse6 .cse9 .cse8 .cse4) (and .cse1 .cse2 .cse9 .cse5 .cse8) (and .cse6 .cse9 .cse5 .cse7 .cse8) (and .cse0 .cse1 .cse5 .cse7 .cse3) (and .cse0 .cse1 .cse9 .cse7 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse5) (and .cse0 .cse2 .cse6 .cse9 .cse4) (and .cse0 .cse6 .cse9 .cse7 .cse4) (and .cse0 .cse2 .cse6 .cse5 .cse3) (and .cse1 .cse9 .cse7 .cse8 .cse4) (and .cse0 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse2 .cse9 .cse8 .cse4) (and .cse6 .cse7 .cse8 .cse3 .cse4) (and .cse1 .cse2 .cse8 .cse3 .cse4) (and .cse1 .cse7 .cse8 .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse8 .cse3) (and .cse2 .cse6 .cse9 .cse5 .cse8) (and .cse0 .cse1 .cse9 .cse5 .cse7) (and .cse6 .cse9 .cse7 .cse8 .cse4) (and .cse0 .cse6 .cse5 .cse7 .cse3) (and .cse0 .cse6 .cse9 .cse5 .cse7) (and .cse2 .cse6 .cse8 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse9 .cse5) (and .cse0 .cse1 .cse7 .cse3 .cse4) (and .cse1 .cse9 .cse5 .cse7 .cse8) (and .cse0 .cse6 .cse7 .cse3 .cse4) (and .cse1 .cse5 .cse7 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse9 .cse4) (and .cse2 .cse6 .cse5 .cse8 .cse3))) [2020-09-04 16:34:39,801 INFO L271 CegarLoopResult]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2020-09-04 16:34:39,802 INFO L271 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: true [2020-09-04 16:34:39,802 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-09-04 16:34:39,802 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-09-04 16:34:39,802 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-09-04 16:34:39,802 INFO L264 CegarLoopResult]: At program point L103(line 103) the Hoare annotation is: (let ((.cse0 (= main_~p6~0 0)) (.cse4 (= main_~lk7~0 1)) (.cse1 (= main_~p7~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse2 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2 .cse4) (and .cse0 .cse2 .cse4) (and .cse1 .cse3 .cse2))) [2020-09-04 16:34:39,802 INFO L271 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: true [2020-09-04 16:34:39,802 INFO L264 CegarLoopResult]: At program point L120(line 120) the Hoare annotation is: false [2020-09-04 16:34:39,803 INFO L264 CegarLoopResult]: At program point L87(line 87) the Hoare annotation is: (let ((.cse8 (= main_~lk4~0 1)) (.cse1 (= main_~p3~0 0)) (.cse0 (= main_~p6~0 0)) (.cse3 (= main_~p7~0 0)) (.cse5 (= main_~lk5~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse9 (= main_~p5~0 0)) (.cse2 (= main_~lk2~0 1)) (.cse7 (= main_~lk6~0 1)) (.cse4 (= main_~p4~0 0)) (.cse10 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse3 .cse7) (and .cse8 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse6 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse3 .cse7 .cse5) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse7 .cse10) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse1 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse8 .cse1 .cse9 .cse2 .cse3 .cse7) (and .cse6 .cse0 .cse9 .cse2 .cse4 .cse10) (and .cse8 .cse1 .cse9 .cse2 .cse7 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse3) (and .cse6 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse10) (and .cse1 .cse9 .cse2 .cse7 .cse4 .cse10) (and .cse6 .cse0 .cse2 .cse4 .cse5 .cse10) (and .cse8 .cse1 .cse2 .cse7 .cse5 .cse10) (and .cse6 .cse0 .cse9 .cse2 .cse3 .cse4) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse3) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10) (and .cse1 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse6 .cse0 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse9 .cse2 .cse7 .cse4 .cse10))) [2020-09-04 16:34:39,803 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-09-04 16:34:39,803 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-09-04 16:34:39,803 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-09-04 16:34:39,803 INFO L264 CegarLoopResult]: At program point L112(line 112) the Hoare annotation is: (= main_~lk7~0 1) [2020-09-04 16:34:39,803 INFO L264 CegarLoopResult]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2020-09-04 16:34:39,803 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-09-04 16:34:39,803 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 4 121) the Hoare annotation is: true [2020-09-04 16:34:39,804 INFO L264 CegarLoopResult]: At program point L71-1(lines 30 116) 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 .cse1 .cse2 .cse10 .cse7 .cse3 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse11 .cse4) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse10 .cse6 .cse11) (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:34:39,804 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) the Hoare annotation is: false [2020-09-04 16:34:39,804 INFO L264 CegarLoopResult]: At program point L96-1(lines 30 116) the Hoare annotation is: (let ((.cse2 (= main_~lk5~0 1)) (.cse0 (= main_~p6~0 0)) (.cse5 (= main_~lk7~0 1)) (.cse3 (= main_~p5~0 0)) (.cse1 (= main_~p7~0 0)) (.cse4 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse0 .cse3 .cse1) (and .cse0 .cse2 .cse5) (and .cse4 .cse2 .cse5) (and .cse1 .cse4 .cse2) (and .cse0 .cse3 .cse5) (and .cse3 .cse1 .cse4))) [2020-09-04 16:34:39,804 INFO L264 CegarLoopResult]: At program point L63-1(lines 30 116) 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:34:39,805 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 121) the Hoare annotation is: true [2020-09-04 16:34:39,805 INFO L264 CegarLoopResult]: At program point L88(line 88) the Hoare annotation is: (let ((.cse8 (= main_~lk4~0 1)) (.cse1 (= main_~p3~0 0)) (.cse0 (= main_~p6~0 0)) (.cse3 (= main_~p7~0 0)) (.cse5 (= main_~lk5~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse9 (= main_~p5~0 0)) (.cse2 (= main_~lk2~0 1)) (.cse7 (= main_~lk6~0 1)) (.cse4 (= main_~p4~0 0)) (.cse10 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse3 .cse7) (and .cse8 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse6 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse3 .cse7 .cse5) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse5) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse7 .cse10) (and .cse1 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse8 .cse1 .cse9 .cse2 .cse3 .cse7) (and .cse6 .cse0 .cse9 .cse2 .cse4 .cse10) (and .cse8 .cse1 .cse9 .cse2 .cse7 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse3) (and .cse6 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse10) (and .cse1 .cse9 .cse2 .cse7 .cse4 .cse10) (and .cse6 .cse0 .cse2 .cse4 .cse5 .cse10) (and .cse6 .cse0 .cse9 .cse2 .cse3 .cse4) (and .cse8 .cse1 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse3) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10) (and .cse1 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse6 .cse0 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse9 .cse2 .cse7 .cse4 .cse10))) [2020-09-04 16:34:39,805 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-09-04 16:34:39,805 INFO L264 CegarLoopResult]: At program point L55-1(lines 30 116) 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:34:39,805 INFO L264 CegarLoopResult]: At program point L113(line 113) the Hoare annotation is: (= main_~lk7~0 1) [2020-09-04 16:34:39,805 INFO L271 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: true [2020-09-04 16:34:39,806 INFO L264 CegarLoopResult]: At program point L72(line 72) 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 .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 .cse7 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse2 .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:34:39,806 INFO L271 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: true [2020-09-04 16:34:39,806 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-09-04 16:34:39,806 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-09-04 16:34:39,806 INFO L264 CegarLoopResult]: At program point L97(line 97) the Hoare annotation is: (let ((.cse2 (= main_~p5~0 0)) (.cse3 (= main_~p7~0 0)) (.cse1 (= main_~p6~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~lk6~0 1)) (.cse6 (= main_~lk5~0 1)) (.cse5 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse5) (and .cse0 .cse2 .cse4 .cse5) (and .cse0 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse3 .cse6) (and .cse0 .cse1 .cse6 .cse5) (and .cse0 .cse4 .cse6 .cse5))) [2020-09-04 16:34:39,807 INFO L264 CegarLoopResult]: At program point L64(line 64) 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 .cse4 .cse5 .cse3) (and .cse0 .cse1 .cse5) (and .cse4 .cse3 .cse2) (and .cse4 .cse1 .cse5) (and .cse0 .cse5 .cse3))) [2020-09-04 16:34:39,807 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-09-04 16:34:39,807 INFO L271 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: true [2020-09-04 16:34:39,807 INFO L271 CegarLoopResult]: At program point L31-2(line 31) the Hoare annotation is: true [2020-09-04 16:34:39,807 INFO L264 CegarLoopResult]: At program point L56(line 56) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-09-04 16:34:39,808 INFO L264 CegarLoopResult]: At program point L81-1(lines 30 116) the Hoare annotation is: (let ((.cse5 (= main_~lk5~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse7 (= main_~p3~0 0)) (.cse6 (= main_~p6~0 0)) (.cse2 (= main_~p7~0 0)) (.cse11 (= main_~p2~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse9 (= main_~p5~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse3 (= main_~lk6~0 1)) (.cse4 (= main_~p4~0 0)) (.cse10 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse1 .cse2 .cse4 .cse5) (and .cse8 .cse0 .cse9 .cse1 .cse2 .cse3) (and .cse8 .cse7 .cse1 .cse2 .cse3 .cse5) (and .cse8 .cse0 .cse9 .cse1 .cse3 .cse10) (and .cse7 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse7 .cse9 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse4 .cse5 .cse11 .cse10) (and .cse7 .cse3 .cse4 .cse5 .cse11 .cse10) (and .cse8 .cse7 .cse9 .cse2 .cse3 .cse11) (and .cse8 .cse6 .cse7 .cse9 .cse1 .cse2) (and .cse8 .cse0 .cse6 .cse2 .cse5 .cse11) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse0 .cse6 .cse1 .cse5 .cse10) (and .cse8 .cse0 .cse6 .cse9 .cse11 .cse10) (and .cse8 .cse6 .cse7 .cse9 .cse11 .cse10) (and .cse7 .cse2 .cse3 .cse4 .cse5 .cse11) (and .cse0 .cse6 .cse1 .cse4 .cse5 .cse10) (and .cse8 .cse0 .cse6 .cse5 .cse11 .cse10) (and .cse8 .cse6 .cse7 .cse2 .cse5 .cse11) (and .cse8 .cse0 .cse2 .cse3 .cse5 .cse11) (and .cse6 .cse7 .cse9 .cse1 .cse4 .cse10) (and .cse6 .cse7 .cse1 .cse4 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse3 .cse5 .cse10) (and .cse8 .cse6 .cse7 .cse9 .cse1 .cse10) (and .cse8 .cse0 .cse3 .cse5 .cse11 .cse10) (and .cse7 .cse9 .cse2 .cse3 .cse4 .cse11) (and .cse7 .cse1 .cse3 .cse4 .cse5 .cse10) (and .cse8 .cse6 .cse7 .cse5 .cse11 .cse10) (and .cse0 .cse6 .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse4 .cse5 .cse11) (and .cse0 .cse9 .cse2 .cse3 .cse4 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse10) (and .cse8 .cse6 .cse7 .cse1 .cse5 .cse10) (and .cse0 .cse9 .cse3 .cse4 .cse11 .cse10) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse5) (and .cse8 .cse6 .cse7 .cse1 .cse2 .cse5) (and .cse6 .cse7 .cse2 .cse4 .cse5 .cse11) (and .cse8 .cse0 .cse9 .cse2 .cse3 .cse11) (and .cse8 .cse0 .cse6 .cse1 .cse2 .cse5) (and .cse8 .cse7 .cse2 .cse3 .cse5 .cse11) (and .cse6 .cse7 .cse9 .cse1 .cse2 .cse4) (and .cse8 .cse0 .cse9 .cse3 .cse11 .cse10) (and .cse0 .cse6 .cse9 .cse1 .cse4 .cse10) (and .cse8 .cse7 .cse9 .cse1 .cse2 .cse3) (and .cse8 .cse7 .cse9 .cse1 .cse3 .cse10) (and .cse8 .cse0 .cse6 .cse9 .cse2 .cse11) (and .cse6 .cse7 .cse9 .cse4 .cse11 .cse10) (and .cse0 .cse6 .cse4 .cse5 .cse11 .cse10) (and .cse8 .cse6 .cse7 .cse9 .cse2 .cse11) (and .cse8 .cse0 .cse6 .cse9 .cse1 .cse10) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse11) (and .cse0 .cse6 .cse9 .cse4 .cse11 .cse10) (and .cse7 .cse9 .cse1 .cse3 .cse4 .cse10) (and .cse7 .cse9 .cse3 .cse4 .cse11 .cse10) (and .cse0 .cse3 .cse4 .cse5 .cse11 .cse10) (and .cse8 .cse7 .cse1 .cse3 .cse5 .cse10) (and .cse0 .cse6 .cse9 .cse1 .cse2 .cse4) (and .cse8 .cse0 .cse6 .cse9 .cse1 .cse2) (and .cse8 .cse7 .cse3 .cse5 .cse11 .cse10) (and .cse8 .cse7 .cse9 .cse3 .cse11 .cse10) (and .cse6 .cse7 .cse9 .cse2 .cse4 .cse11) (and .cse0 .cse6 .cse9 .cse2 .cse4 .cse11) (and .cse0 .cse9 .cse1 .cse3 .cse4 .cse10))) [2020-09-04 16:34:39,808 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-09-04 16:34:39,808 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-09-04 16:34:39,808 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-09-04 16:34:39,808 INFO L264 CegarLoopResult]: At program point L106-1(lines 30 116) the Hoare annotation is: (or (= main_~p7~0 0) (= main_~lk7~0 1)) [2020-09-04 16:34:39,808 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-09-04 16:34:39,809 INFO L264 CegarLoopResult]: At program point L98(line 98) the Hoare annotation is: (let ((.cse2 (= main_~p5~0 0)) (.cse3 (= main_~p7~0 0)) (.cse1 (= main_~p6~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse5 (= main_~lk6~0 1)) (.cse6 (= main_~lk5~0 1)) (.cse4 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse4) (and .cse0 .cse2 .cse3 .cse5) (and .cse0 .cse2 .cse5 .cse4) (and .cse0 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse6) (and .cse0 .cse1 .cse6 .cse4) (and .cse0 .cse5 .cse6 .cse4))) [2020-09-04 16:34:39,809 INFO L271 CegarLoopResult]: At program point L32(lines 32 34) the Hoare annotation is: true [2020-09-04 16:34:39,809 INFO L271 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-09-04 16:34:39,809 INFO L271 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: true [2020-09-04 16:34:39,809 INFO L271 CegarLoopResult]: At program point L24-2(line 24) the Hoare annotation is: true [2020-09-04 16:34:39,810 INFO L264 CegarLoopResult]: At program point L82(line 82) the Hoare annotation is: (let ((.cse7 (= main_~lk4~0 1)) (.cse12 (= main_~p2~0 0)) (.cse1 (= main_~p6~0 0)) (.cse8 (= main_~p3~0 0)) (.cse2 (= main_~p5~0 0)) (.cse10 (= main_~p7~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse3 (= main_~lk2~0 1)) (.cse11 (= main_~lk6~0 1)) (.cse4 (= main_~p4~0 0)) (.cse9 (= main_~lk5~0 1)) (.cse5 (= main_~lk1~0 1)) (.cse6 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse9 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse11 .cse4 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse10 .cse12 .cse5) (and .cse8 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse11 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6) (and .cse1 .cse8 .cse2 .cse4 .cse12 .cse5 .cse6) (and .cse8 .cse3 .cse10 .cse11 .cse4 .cse9 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse10 .cse9 .cse5) (and .cse1 .cse8 .cse2 .cse10 .cse4 .cse12 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse8 .cse10 .cse11 .cse4 .cse9 .cse12 .cse5) (and .cse7 .cse0 .cse2 .cse3 .cse11 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse12 .cse5 .cse6) (and .cse7 .cse8 .cse3 .cse10 .cse11 .cse9 .cse5) (and .cse7 .cse8 .cse3 .cse11 .cse9 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse10 .cse11 .cse12 .cse5) (and .cse7 .cse0 .cse1 .cse10 .cse9 .cse12 .cse5) (and .cse7 .cse1 .cse8 .cse10 .cse9 .cse12 .cse5) (and .cse8 .cse3 .cse11 .cse4 .cse9 .cse5 .cse6) (and .cse0 .cse10 .cse11 .cse4 .cse9 .cse12 .cse5) (and .cse7 .cse8 .cse2 .cse3 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse11 .cse12 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse3 .cse10 .cse11 .cse5) (and .cse7 .cse0 .cse3 .cse11 .cse9 .cse5 .cse6) (and .cse0 .cse3 .cse10 .cse11 .cse4 .cse9 .cse5) (and .cse0 .cse1 .cse4 .cse9 .cse12 .cse5 .cse6) (and .cse1 .cse8 .cse4 .cse9 .cse12 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse0 .cse11 .cse9 .cse12 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse9 .cse12 .cse5 .cse6) (and .cse8 .cse2 .cse11 .cse4 .cse12 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse10 .cse11 .cse12 .cse5) (and .cse0 .cse1 .cse10 .cse4 .cse9 .cse12 .cse5) (and .cse7 .cse8 .cse10 .cse11 .cse9 .cse12 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse10 .cse12 .cse5) (and .cse8 .cse2 .cse3 .cse10 .cse11 .cse4 .cse5) (and .cse0 .cse11 .cse4 .cse9 .cse12 .cse5 .cse6) (and .cse8 .cse11 .cse4 .cse9 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5 .cse6) (and .cse1 .cse8 .cse3 .cse10 .cse4 .cse9 .cse5) (and .cse0 .cse2 .cse11 .cse4 .cse12 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse9 .cse12 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse10 .cse5) (and .cse7 .cse0 .cse3 .cse10 .cse11 .cse9 .cse5) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse12 .cse5) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse9 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse9 .cse5 .cse6) (and .cse8 .cse2 .cse10 .cse11 .cse4 .cse12 .cse5) (and .cse7 .cse0 .cse2 .cse11 .cse12 .cse5 .cse6) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse10 .cse11 .cse9 .cse12 .cse5) (and .cse0 .cse2 .cse10 .cse11 .cse4 .cse12 .cse5) (and .cse7 .cse8 .cse11 .cse9 .cse12 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse10 .cse9 .cse5) (and .cse1 .cse8 .cse10 .cse4 .cse9 .cse12 .cse5) (and .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse0 .cse3 .cse11 .cse4 .cse9 .cse5 .cse6))) [2020-09-04 16:34:39,810 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-09-04 16:34:39,810 INFO L264 CegarLoopResult]: At program point L107(line 107) the Hoare annotation is: (let ((.cse0 (= main_~lk6~0 1))) (or (and .cse0 (= main_~lk7~0 1)) (and (= main_~p7~0 0) .cse0))) [2020-09-04 16:34:39,810 INFO L271 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: true [2020-09-04 16:34:39,811 INFO L264 CegarLoopResult]: At program point L91-1(lines 30 116) the Hoare annotation is: (let ((.cse0 (= main_~p5~0 0)) (.cse2 (= main_~p4~0 0)) (.cse1 (= main_~lk6~0 1)) (.cse7 (= main_~p7~0 0)) (.cse5 (= main_~lk4~0 1)) (.cse6 (= main_~p6~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse3 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse4 .cse3) (and .cse5 .cse6 .cse0 .cse7) (and .cse5 .cse0 .cse1 .cse3) (and .cse5 .cse0 .cse7 .cse1) (and .cse5 .cse6 .cse0 .cse3) (and .cse5 .cse1 .cse4 .cse3) (and .cse7 .cse1 .cse2 .cse4) (and .cse6 .cse0 .cse2 .cse3) (and .cse6 .cse7 .cse2 .cse4) (and .cse6 .cse2 .cse4 .cse3) (and .cse6 .cse0 .cse7 .cse2) (and .cse0 .cse7 .cse1 .cse2) (and .cse5 .cse7 .cse1 .cse4) (and .cse5 .cse6 .cse7 .cse4) (and .cse5 .cse6 .cse4 .cse3))) [2020-09-04 16:34:39,811 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-09-04 16:34:39,812 INFO L264 CegarLoopResult]: At program point L83(line 83) the Hoare annotation is: (let ((.cse9 (= main_~lk4~0 1)) (.cse12 (= main_~p2~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse8 (= main_~lk6~0 1)) (.cse11 (= main_~lk5~0 1)) (.cse6 (= main_~lk7~0 1)) (.cse1 (= main_~p6~0 0)) (.cse10 (= main_~p3~0 0)) (.cse2 (= main_~p5~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse7 (= main_~p7~0 0)) (.cse4 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse7 .cse8 .cse4 .cse5) (and .cse9 .cse1 .cse10 .cse3 .cse11 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse2 .cse7 .cse12 .cse5) (and .cse10 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse1 .cse10 .cse3 .cse4 .cse11 .cse5 .cse6) (and .cse9 .cse0 .cse2 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse3 .cse7 .cse11 .cse5) (and .cse10 .cse3 .cse7 .cse8 .cse4 .cse11 .cse5) (and .cse1 .cse10 .cse2 .cse7 .cse4 .cse12 .cse5) (and .cse9 .cse1 .cse10 .cse2 .cse3 .cse5 .cse6) (and .cse10 .cse7 .cse8 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse0 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse9 .cse10 .cse3 .cse7 .cse8 .cse11 .cse5) (and .cse9 .cse1 .cse10 .cse2 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse3 .cse8 .cse11 .cse5 .cse6) (and .cse9 .cse0 .cse2 .cse7 .cse8 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse7 .cse11 .cse12 .cse5) (and .cse9 .cse1 .cse10 .cse7 .cse11 .cse12 .cse5) (and .cse10 .cse3 .cse8 .cse4 .cse11 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse10 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse8 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse3 .cse7 .cse8 .cse5) (and .cse9 .cse0 .cse3 .cse8 .cse11 .cse5 .cse6) (and .cse0 .cse3 .cse7 .cse8 .cse4 .cse11 .cse5) (and .cse0 .cse1 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse1 .cse10 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse2 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse8 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse9 .cse0 .cse1 .cse11 .cse12 .cse5 .cse6) (and .cse10 .cse2 .cse8 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse7 .cse8 .cse12 .cse5) (and .cse0 .cse1 .cse7 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse9 .cse0 .cse1 .cse2 .cse7 .cse12 .cse5) (and .cse9 .cse10 .cse7 .cse8 .cse11 .cse12 .cse5) (and .cse10 .cse2 .cse3 .cse7 .cse8 .cse4 .cse5) (and .cse10 .cse8 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse8 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse11 .cse5 .cse6) (and .cse1 .cse10 .cse3 .cse7 .cse4 .cse11 .cse5) (and .cse0 .cse2 .cse8 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse2 .cse3 .cse7 .cse5) (and .cse9 .cse0 .cse3 .cse7 .cse8 .cse11 .cse5) (and .cse0 .cse1 .cse2 .cse7 .cse4 .cse12 .cse5) (and .cse0 .cse1 .cse3 .cse7 .cse4 .cse11 .cse5) (and .cse9 .cse0 .cse1 .cse3 .cse11 .cse5 .cse6) (and .cse10 .cse2 .cse7 .cse8 .cse4 .cse12 .cse5) (and .cse9 .cse0 .cse2 .cse8 .cse12 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse0 .cse7 .cse8 .cse11 .cse12 .cse5) (and .cse0 .cse2 .cse7 .cse8 .cse4 .cse12 .cse5) (and .cse9 .cse10 .cse8 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse3 .cse7 .cse11 .cse5) (and .cse1 .cse10 .cse7 .cse4 .cse11 .cse12 .cse5) (and .cse0 .cse3 .cse8 .cse4 .cse11 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse3 .cse7 .cse4 .cse5))) [2020-09-04 16:34:39,812 INFO L264 CegarLoopResult]: At program point L108(line 108) the Hoare annotation is: (let ((.cse0 (= main_~lk6~0 1))) (or (and .cse0 (= main_~lk7~0 1)) (and (= main_~p7~0 0) .cse0))) [2020-09-04 16:34:39,813 INFO L264 CegarLoopResult]: At program point L75-1(lines 30 116) 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 .cse7 .cse1 .cse8 .cse10 .cse13 .cse9 .cse11) (and .cse8 .cse3 .cse10 .cse12 .cse4 .cse9 .cse5) (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 .cse7 .cse1 .cse8 .cse2 .cse10 .cse13 .cse11) (and .cse1 .cse8 .cse4 .cse9 .cse11 .cse5 .cse6) (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 .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 .cse3 .cse10 .cse12 .cse13 .cse9) (and .cse7 .cse0 .cse2 .cse12 .cse11 .cse5 .cse6) (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 .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 .cse7 .cse0 .cse2 .cse12 .cse13 .cse11 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse12 .cse4 .cse5) (and .cse7 .cse0 .cse3 .cse12 .cse13 .cse9 .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 .cse9 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse10 .cse13 .cse9) (and .cse1 .cse8 .cse2 .cse10 .cse4 .cse11 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse13 .cse11 .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 .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 .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 .cse10 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .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:34:39,813 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-09-04 16:34:39,813 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-09-04 16:34:39,814 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-09-04 16:34:39,814 INFO L264 CegarLoopResult]: At program point L67-1(lines 30 116) 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 .cse0 .cse5 .cse1 .cse2 .cse4) (and .cse7 .cse0 .cse9 .cse3 .cse6) (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:34:39,814 INFO L264 CegarLoopResult]: At program point L92(line 92) the Hoare annotation is: (let ((.cse3 (= main_~p7~0 0)) (.cse8 (= main_~lk6~0 1)) (.cse7 (= main_~p4~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse2 (= main_~p6~0 0)) (.cse6 (= main_~p5~0 0)) (.cse5 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse1 .cse2 .cse6 .cse7 .cse5) (and .cse1 .cse2 .cse7 .cse4 .cse5) (and .cse1 .cse2 .cse3 .cse7 .cse4) (and .cse1 .cse8 .cse7 .cse4 .cse5) (and .cse0 .cse1 .cse6 .cse3 .cse8) (and .cse1 .cse2 .cse6 .cse3 .cse7) (and .cse0 .cse1 .cse3 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse8 .cse5) (and .cse0 .cse1 .cse2 .cse6 .cse3) (and .cse0 .cse1 .cse8 .cse4 .cse5) (and .cse1 .cse6 .cse8 .cse7 .cse5) (and .cse1 .cse6 .cse3 .cse8 .cse7) (and .cse1 .cse3 .cse8 .cse7 .cse4) (and .cse0 .cse1 .cse2 .cse6 .cse5))) [2020-09-04 16:34:39,815 INFO L264 CegarLoopResult]: At program point L59-1(lines 30 116) 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:34:39,815 INFO L271 CegarLoopResult]: At program point L117(lines 5 121) the Hoare annotation is: true [2020-09-04 16:34:39,815 INFO L271 CegarLoopResult]: At program point L51(lines 51 53) the Hoare annotation is: true [2020-09-04 16:34:39,815 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-09-04 16:34:39,815 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-09-04 16:34:39,815 INFO L264 CegarLoopResult]: At program point L51-2(lines 30 116) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-09-04 16:34:39,815 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-09-04 16:34:39,816 INFO L264 CegarLoopResult]: At program point L76(line 76) the Hoare annotation is: (let ((.cse6 (= main_~lk6~0 1)) (.cse10 (= 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)) (.cse11 (= 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 .cse0 .cse8 .cse1 .cse9 .cse10 .cse4) (and .cse8 .cse1 .cse11 .cse7 .cse10 .cse3) (and .cse0 .cse8 .cse9 .cse6 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse6 .cse10 .cse3 .cse4) (and .cse0 .cse2 .cse9 .cse6 .cse10 .cse4) (and .cse0 .cse8 .cse9 .cse6 .cse10 .cse4) (and .cse0 .cse8 .cse11 .cse6 .cse3 .cse5) (and .cse8 .cse9 .cse11 .cse6 .cse7 .cse10) (and .cse0 .cse2 .cse6 .cse10 .cse3 .cse4) (and .cse8 .cse1 .cse9 .cse11 .cse7 .cse5) (and .cse8 .cse9 .cse11 .cse6 .cse7 .cse5) (and .cse2 .cse9 .cse11 .cse6 .cse7 .cse10) (and .cse0 .cse8 .cse1 .cse11 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse11 .cse10) (and .cse8 .cse1 .cse11 .cse7 .cse3 .cse5) (and .cse2 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse11 .cse6 .cse5) (and .cse0 .cse8 .cse11 .cse6 .cse10 .cse3) (and .cse2 .cse6 .cse7 .cse10 .cse3 .cse4) (and .cse8 .cse11 .cse6 .cse7 .cse10 .cse3) (and .cse0 .cse2 .cse11 .cse6 .cse10 .cse3) (and .cse8 .cse9 .cse6 .cse7 .cse10 .cse4) (and .cse1 .cse2 .cse9 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse2 .cse9 .cse6 .cse7 .cse10 .cse4) (and .cse8 .cse1 .cse9 .cse7 .cse10 .cse4) (and .cse0 .cse8 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse11 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse10 .cse3) (and .cse8 .cse1 .cse9 .cse7 .cse4 .cse5) (and .cse0 .cse2 .cse11 .cse6 .cse3 .cse5) (and .cse8 .cse6 .cse7 .cse10 .cse3 .cse4) (and .cse0 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse11 .cse5) (and .cse0 .cse8 .cse1 .cse11 .cse10 .cse3) (and .cse8 .cse11 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse2 .cse9 .cse11 .cse6 .cse10) (and .cse1 .cse2 .cse11 .cse7 .cse10 .cse3) (and .cse1 .cse2 .cse11 .cse7 .cse3 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse10 .cse4) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse8 .cse1 .cse9 .cse11 .cse7 .cse10) (and .cse0 .cse2 .cse9 .cse11 .cse6 .cse5) (and .cse2 .cse9 .cse11 .cse6 .cse7 .cse5) (and .cse2 .cse11 .cse6 .cse7 .cse3 .cse5) (and .cse2 .cse11 .cse6 .cse7 .cse10 .cse3) (and .cse8 .cse1 .cse7 .cse10 .cse3 .cse4) (and .cse0 .cse8 .cse1 .cse10 .cse3 .cse4) (and .cse0 .cse2 .cse9 .cse6 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse11 .cse7 .cse10) (and .cse1 .cse2 .cse7 .cse10 .cse3 .cse4) (and .cse1 .cse2 .cse9 .cse7 .cse10 .cse4) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse4) (and .cse0 .cse8 .cse1 .cse9 .cse11 .cse10) (and .cse8 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse11 .cse7 .cse5))) [2020-09-04 16:34:39,816 INFO L271 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: true [2020-09-04 16:34:39,816 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-09-04 16:34:39,817 INFO L264 CegarLoopResult]: At program point L68(line 68) the Hoare annotation is: (let ((.cse6 (= main_~p2~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p1~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse4 .cse5 .cse3 .cse6) (and .cse5 .cse2 .cse3 .cse6) (and .cse5 .cse1 .cse2 .cse7) (and .cse0 .cse2 .cse6 .cse7) (and .cse5 .cse2 .cse6 .cse7) (and .cse4 .cse0 .cse6 .cse7) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse0 .cse1 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7))) [2020-09-04 16:34:39,817 INFO L264 CegarLoopResult]: At program point L101-1(lines 30 116) the Hoare annotation is: (let ((.cse0 (= main_~lk6~0 1)) (.cse2 (= main_~p7~0 0)) (.cse3 (= main_~p6~0 0)) (.cse1 (= main_~lk7~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and .cse3 .cse2) (and .cse3 .cse1))) [2020-09-04 16:34:39,817 INFO L271 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: true [2020-09-04 16:34:39,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 04:34:39 BoogieIcfgContainer [2020-09-04 16:34:39,834 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 16:34:39,838 INFO L168 Benchmark]: Toolchain (without parser) took 24621.31 ms. Allocated memory was 144.7 MB in the beginning and 556.8 MB in the end (delta: 412.1 MB). Free memory was 103.7 MB in the beginning and 127.4 MB in the end (delta: -23.8 MB). Peak memory consumption was 423.2 MB. Max. memory is 7.1 GB. [2020-09-04 16:34:39,838 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 144.7 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-04 16:34:39,839 INFO L168 Benchmark]: CACSL2BoogieTranslator took 429.22 ms. Allocated memory is still 144.7 MB. Free memory was 103.5 MB in the beginning and 92.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2020-09-04 16:34:39,840 INFO L168 Benchmark]: Boogie Preprocessor took 242.55 ms. Allocated memory was 144.7 MB in the beginning and 208.7 MB in the end (delta: 64.0 MB). Free memory was 92.8 MB in the beginning and 186.5 MB in the end (delta: -93.7 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-09-04 16:34:39,841 INFO L168 Benchmark]: RCFGBuilder took 469.73 ms. Allocated memory is still 208.7 MB. Free memory was 186.5 MB in the beginning and 166.0 MB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2020-09-04 16:34:39,841 INFO L168 Benchmark]: TraceAbstraction took 23472.70 ms. Allocated memory was 208.7 MB in the beginning and 556.8 MB in the end (delta: 348.1 MB). Free memory was 166.0 MB in the beginning and 127.4 MB in the end (delta: 38.6 MB). Peak memory consumption was 421.6 MB. Max. memory is 7.1 GB. [2020-09-04 16:34:39,845 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.19 ms. Allocated memory is still 144.7 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 429.22 ms. Allocated memory is still 144.7 MB. Free memory was 103.5 MB in the beginning and 92.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 242.55 ms. Allocated memory was 144.7 MB in the beginning and 208.7 MB in the end (delta: 64.0 MB). Free memory was 92.8 MB in the beginning and 186.5 MB in the end (delta: -93.7 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 469.73 ms. Allocated memory is still 208.7 MB. Free memory was 186.5 MB in the beginning and 166.0 MB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23472.70 ms. Allocated memory was 208.7 MB in the beginning and 556.8 MB in the end (delta: 348.1 MB). Free memory was 166.0 MB in the beginning and 127.4 MB in the end (delta: 38.6 MB). Peak memory consumption was 421.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: 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: 30]: 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, 88 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.5s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 18.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1813 SDtfs, 648 SDslu, 1281 SDs, 0 SdLazy, 69 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3635occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 1022 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 88 LocationsWithAnnotation, 88 PreInvPairs, 4768 NumberOfFragments, 13918 HoareAnnotationTreeSize, 88 FomulaSimplifications, 98944 FormulaSimplificationTreeSizeReduction, 6.1s HoareSimplificationTime, 88 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 12.6s 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...