/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-86f66a4 [2020-07-07 13:22:10,140 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-07 13:22:10,143 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-07 13:22:10,164 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-07 13:22:10,165 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-07 13:22:10,167 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-07 13:22:10,169 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-07 13:22:10,181 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-07 13:22:10,185 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-07 13:22:10,188 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-07 13:22:10,190 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-07 13:22:10,193 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-07 13:22:10,193 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-07 13:22:10,195 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-07 13:22:10,198 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-07 13:22:10,200 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-07 13:22:10,202 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-07 13:22:10,203 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-07 13:22:10,205 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-07 13:22:10,210 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-07 13:22:10,216 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-07 13:22:10,220 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-07 13:22:10,221 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-07 13:22:10,222 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-07 13:22:10,225 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-07 13:22:10,226 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-07 13:22:10,226 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-07 13:22:10,229 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-07 13:22:10,230 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-07 13:22:10,231 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-07 13:22:10,231 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-07 13:22:10,232 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-07 13:22:10,233 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-07 13:22:10,234 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-07 13:22:10,235 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-07 13:22:10,235 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-07 13:22:10,236 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-07 13:22:10,236 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-07 13:22:10,237 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-07 13:22:10,237 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-07 13:22:10,239 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-07 13:22:10,239 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-07 13:22:10,271 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-07 13:22:10,271 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-07 13:22:10,274 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-07 13:22:10,274 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-07 13:22:10,274 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-07 13:22:10,275 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-07 13:22:10,275 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-07 13:22:10,275 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-07 13:22:10,275 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-07 13:22:10,275 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-07 13:22:10,275 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-07 13:22:10,276 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-07 13:22:10,276 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-07 13:22:10,276 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-07 13:22:10,280 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-07 13:22:10,280 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-07 13:22:10,280 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-07 13:22:10,280 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-07 13:22:10,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 13:22:10,281 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-07 13:22:10,281 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-07 13:22:10,281 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-07 13:22:10,281 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-07 13:22:10,613 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-07 13:22:10,627 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-07 13:22:10,631 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-07 13:22:10,632 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-07 13:22:10,633 INFO L275 PluginConnector]: CDTParser initialized [2020-07-07 13:22:10,633 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2020-07-07 13:22:10,700 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cc3e18c4/619729d237f0464ba62b806a8de58440/FLAG73f139169 [2020-07-07 13:22:11,183 INFO L306 CDTParser]: Found 1 translation units. [2020-07-07 13:22:11,183 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2020-07-07 13:22:11,199 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cc3e18c4/619729d237f0464ba62b806a8de58440/FLAG73f139169 [2020-07-07 13:22:11,498 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cc3e18c4/619729d237f0464ba62b806a8de58440 [2020-07-07 13:22:11,509 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-07 13:22:11,511 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-07 13:22:11,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-07 13:22:11,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-07 13:22:11,517 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-07 13:22:11,519 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 01:22:11" (1/1) ... [2020-07-07 13:22:11,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@791d2189 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:22:11, skipping insertion in model container [2020-07-07 13:22:11,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 01:22:11" (1/1) ... [2020-07-07 13:22:11,531 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-07 13:22:11,553 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-07 13:22:11,830 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 13:22:11,839 INFO L203 MainTranslator]: Completed pre-run [2020-07-07 13:22:11,886 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 13:22:11,903 INFO L208 MainTranslator]: Completed translation [2020-07-07 13:22:11,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:22:11 WrapperNode [2020-07-07 13:22:11,903 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-07 13:22:11,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-07 13:22:11,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-07 13:22:11,905 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-07 13:22:12,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:22:11" (1/1) ... [2020-07-07 13:22:12,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:22:11" (1/1) ... [2020-07-07 13:22:12,024 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:22:11" (1/1) ... [2020-07-07 13:22:12,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:22:11" (1/1) ... [2020-07-07 13:22:12,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:22:11" (1/1) ... [2020-07-07 13:22:12,036 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:22:11" (1/1) ... [2020-07-07 13:22:12,038 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:22:11" (1/1) ... [2020-07-07 13:22:12,040 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-07 13:22:12,041 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-07 13:22:12,041 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-07 13:22:12,041 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-07 13:22:12,042 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:22:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 13:22:12,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-07 13:22:12,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-07 13:22:12,102 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-07 13:22:12,102 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-07 13:22:12,102 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-07 13:22:12,102 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-07 13:22:12,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-07 13:22:12,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-07 13:22:12,429 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-07 13:22:12,429 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-07 13:22:12,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 01:22:12 BoogieIcfgContainer [2020-07-07 13:22:12,444 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-07 13:22:12,445 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-07 13:22:12,446 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-07 13:22:12,449 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-07 13:22:12,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.07 01:22:11" (1/3) ... [2020-07-07 13:22:12,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a1206a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 01:22:12, skipping insertion in model container [2020-07-07 13:22:12,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:22:11" (2/3) ... [2020-07-07 13:22:12,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a1206a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 01:22:12, skipping insertion in model container [2020-07-07 13:22:12,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 01:22:12" (3/3) ... [2020-07-07 13:22:12,453 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2020-07-07 13:22:12,466 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-07 13:22:12,475 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-07 13:22:12,491 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-07 13:22:12,531 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-07 13:22:12,532 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-07 13:22:12,532 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-07 13:22:12,532 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-07 13:22:12,532 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-07 13:22:12,533 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-07 13:22:12,533 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-07 13:22:12,534 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-07 13:22:12,555 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2020-07-07 13:22:12,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-07 13:22:12,567 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:12,568 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:22:12,569 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:12,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:12,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1826051656, now seen corresponding path program 1 times [2020-07-07 13:22:12,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:12,583 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1178778543] [2020-07-07 13:22:12,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:12,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:12,843 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:12,849 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1178778543] [2020-07-07 13:22:12,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:12,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:12,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639777644] [2020-07-07 13:22:12,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:12,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:12,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:12,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:12,883 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 3 states. [2020-07-07 13:22:12,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:12,972 INFO L93 Difference]: Finished difference Result 191 states and 260 transitions. [2020-07-07 13:22:12,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:12,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-07-07 13:22:12,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:12,991 INFO L225 Difference]: With dead ends: 191 [2020-07-07 13:22:12,992 INFO L226 Difference]: Without dead ends: 128 [2020-07-07 13:22:12,997 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-07-07 13:22:13,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-07-07 13:22:13,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2020-07-07 13:22:13,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-07-07 13:22:13,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 164 transitions. [2020-07-07 13:22:13,079 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 164 transitions. Word has length 55 [2020-07-07 13:22:13,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:13,081 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 164 transitions. [2020-07-07 13:22:13,081 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:13,081 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 164 transitions. [2020-07-07 13:22:13,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-07 13:22:13,084 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:13,084 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-07-07 13:22:13,085 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-07 13:22:13,085 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:13,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:13,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1965492109, now seen corresponding path program 1 times [2020-07-07 13:22:13,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:13,086 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [65849109] [2020-07-07 13:22:13,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:13,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:13,187 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:13,187 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [65849109] [2020-07-07 13:22:13,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:13,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:13,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460519661] [2020-07-07 13:22:13,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:13,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:13,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:13,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:13,191 INFO L87 Difference]: Start difference. First operand 126 states and 164 transitions. Second operand 3 states. [2020-07-07 13:22:13,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:13,236 INFO L93 Difference]: Finished difference Result 154 states and 202 transitions. [2020-07-07 13:22:13,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:13,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-07-07 13:22:13,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:13,241 INFO L225 Difference]: With dead ends: 154 [2020-07-07 13:22:13,241 INFO L226 Difference]: Without dead ends: 152 [2020-07-07 13:22:13,243 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-07-07 13:22:13,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-07-07 13:22:13,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 126. [2020-07-07 13:22:13,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-07-07 13:22:13,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 163 transitions. [2020-07-07 13:22:13,295 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 163 transitions. Word has length 56 [2020-07-07 13:22:13,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:13,297 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 163 transitions. [2020-07-07 13:22:13,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:13,297 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 163 transitions. [2020-07-07 13:22:13,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-07 13:22:13,300 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:13,300 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-07-07 13:22:13,301 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-07 13:22:13,301 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:13,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:13,303 INFO L82 PathProgramCache]: Analyzing trace with hash 773271458, now seen corresponding path program 1 times [2020-07-07 13:22:13,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:13,304 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1196301065] [2020-07-07 13:22:13,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:13,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:13,382 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:13,382 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1196301065] [2020-07-07 13:22:13,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:13,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:13,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763559089] [2020-07-07 13:22:13,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:13,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:13,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:13,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:13,385 INFO L87 Difference]: Start difference. First operand 126 states and 163 transitions. Second operand 3 states. [2020-07-07 13:22:13,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:13,440 INFO L93 Difference]: Finished difference Result 306 states and 415 transitions. [2020-07-07 13:22:13,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:13,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-07-07 13:22:13,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:13,444 INFO L225 Difference]: With dead ends: 306 [2020-07-07 13:22:13,445 INFO L226 Difference]: Without dead ends: 213 [2020-07-07 13:22:13,446 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-07-07 13:22:13,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-07-07 13:22:13,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2020-07-07 13:22:13,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-07-07 13:22:13,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 280 transitions. [2020-07-07 13:22:13,500 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 280 transitions. Word has length 56 [2020-07-07 13:22:13,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:13,501 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 280 transitions. [2020-07-07 13:22:13,501 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:13,501 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 280 transitions. [2020-07-07 13:22:13,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-07 13:22:13,504 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:13,504 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-07-07 13:22:13,504 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-07 13:22:13,505 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:13,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:13,505 INFO L82 PathProgramCache]: Analyzing trace with hash -610540190, now seen corresponding path program 1 times [2020-07-07 13:22:13,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:13,506 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [168508984] [2020-07-07 13:22:13,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:13,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:13,577 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:13,577 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [168508984] [2020-07-07 13:22:13,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:13,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:13,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235614460] [2020-07-07 13:22:13,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:13,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:13,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:13,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:13,580 INFO L87 Difference]: Start difference. First operand 211 states and 280 transitions. Second operand 3 states. [2020-07-07 13:22:13,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:13,614 INFO L93 Difference]: Finished difference Result 259 states and 346 transitions. [2020-07-07 13:22:13,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:13,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-07-07 13:22:13,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:13,617 INFO L225 Difference]: With dead ends: 259 [2020-07-07 13:22:13,618 INFO L226 Difference]: Without dead ends: 257 [2020-07-07 13:22:13,619 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-07-07 13:22:13,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-07-07 13:22:13,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 211. [2020-07-07 13:22:13,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-07-07 13:22:13,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 278 transitions. [2020-07-07 13:22:13,643 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 278 transitions. Word has length 57 [2020-07-07 13:22:13,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:13,644 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 278 transitions. [2020-07-07 13:22:13,644 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:13,644 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 278 transitions. [2020-07-07 13:22:13,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-07 13:22:13,647 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:13,647 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-07-07 13:22:13,647 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-07 13:22:13,647 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:13,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:13,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1798143236, now seen corresponding path program 1 times [2020-07-07 13:22:13,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:13,648 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [519729409] [2020-07-07 13:22:13,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:13,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:13,689 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:13,690 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [519729409] [2020-07-07 13:22:13,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:13,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:13,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117382432] [2020-07-07 13:22:13,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:13,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:13,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:13,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:13,692 INFO L87 Difference]: Start difference. First operand 211 states and 278 transitions. Second operand 3 states. [2020-07-07 13:22:13,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:13,736 INFO L93 Difference]: Finished difference Result 555 states and 752 transitions. [2020-07-07 13:22:13,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:13,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-07-07 13:22:13,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:13,739 INFO L225 Difference]: With dead ends: 555 [2020-07-07 13:22:13,740 INFO L226 Difference]: Without dead ends: 377 [2020-07-07 13:22:13,741 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-07-07 13:22:13,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2020-07-07 13:22:13,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2020-07-07 13:22:13,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-07-07 13:22:13,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 498 transitions. [2020-07-07 13:22:13,775 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 498 transitions. Word has length 57 [2020-07-07 13:22:13,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:13,775 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 498 transitions. [2020-07-07 13:22:13,776 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:13,776 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 498 transitions. [2020-07-07 13:22:13,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-07 13:22:13,778 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:13,779 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-07-07 13:22:13,779 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-07 13:22:13,779 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:13,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:13,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1136837537, now seen corresponding path program 1 times [2020-07-07 13:22:13,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:13,780 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [591396771] [2020-07-07 13:22:13,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:13,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-07-07 13:22:13,852 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:13,853 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [591396771] [2020-07-07 13:22:13,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:13,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:13,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379390988] [2020-07-07 13:22:13,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:13,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:13,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:13,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:13,856 INFO L87 Difference]: Start difference. First operand 375 states and 498 transitions. Second operand 3 states. [2020-07-07 13:22:13,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:13,908 INFO L93 Difference]: Finished difference Result 459 states and 612 transitions. [2020-07-07 13:22:13,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:13,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2020-07-07 13:22:13,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:13,912 INFO L225 Difference]: With dead ends: 459 [2020-07-07 13:22:13,913 INFO L226 Difference]: Without dead ends: 457 [2020-07-07 13:22:13,913 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-07-07 13:22:13,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2020-07-07 13:22:13,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 375. [2020-07-07 13:22:13,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-07-07 13:22:13,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 494 transitions. [2020-07-07 13:22:13,943 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 494 transitions. Word has length 58 [2020-07-07 13:22:13,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:13,943 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 494 transitions. [2020-07-07 13:22:13,943 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:13,943 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 494 transitions. [2020-07-07 13:22:13,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-07 13:22:13,945 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:13,945 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-07-07 13:22:13,946 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-07 13:22:13,946 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:13,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:13,946 INFO L82 PathProgramCache]: Analyzing trace with hash 92380246, now seen corresponding path program 1 times [2020-07-07 13:22:13,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:13,947 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1128838706] [2020-07-07 13:22:13,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:13,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:13,995 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:13,995 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1128838706] [2020-07-07 13:22:13,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:13,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:13,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671112042] [2020-07-07 13:22:13,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:13,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:13,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:13,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:13,998 INFO L87 Difference]: Start difference. First operand 375 states and 494 transitions. Second operand 3 states. [2020-07-07 13:22:14,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:14,066 INFO L93 Difference]: Finished difference Result 1035 states and 1384 transitions. [2020-07-07 13:22:14,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:14,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2020-07-07 13:22:14,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:14,071 INFO L225 Difference]: With dead ends: 1035 [2020-07-07 13:22:14,071 INFO L226 Difference]: Without dead ends: 693 [2020-07-07 13:22:14,073 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-07-07 13:22:14,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2020-07-07 13:22:14,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 691. [2020-07-07 13:22:14,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2020-07-07 13:22:14,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 906 transitions. [2020-07-07 13:22:14,133 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 906 transitions. Word has length 58 [2020-07-07 13:22:14,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:14,134 INFO L479 AbstractCegarLoop]: Abstraction has 691 states and 906 transitions. [2020-07-07 13:22:14,134 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:14,134 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 906 transitions. [2020-07-07 13:22:14,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-07-07 13:22:14,136 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:14,136 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-07-07 13:22:14,137 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-07 13:22:14,137 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:14,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:14,137 INFO L82 PathProgramCache]: Analyzing trace with hash -529027402, now seen corresponding path program 1 times [2020-07-07 13:22:14,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:14,138 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [410164001] [2020-07-07 13:22:14,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:14,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:14,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:14,175 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:14,175 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [410164001] [2020-07-07 13:22:14,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:14,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:14,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284333749] [2020-07-07 13:22:14,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:14,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:14,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:14,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:14,188 INFO L87 Difference]: Start difference. First operand 691 states and 906 transitions. Second operand 3 states. [2020-07-07 13:22:14,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:14,254 INFO L93 Difference]: Finished difference Result 839 states and 1100 transitions. [2020-07-07 13:22:14,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:14,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-07-07 13:22:14,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:14,259 INFO L225 Difference]: With dead ends: 839 [2020-07-07 13:22:14,259 INFO L226 Difference]: Without dead ends: 837 [2020-07-07 13:22:14,260 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-07-07 13:22:14,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2020-07-07 13:22:14,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 691. [2020-07-07 13:22:14,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2020-07-07 13:22:14,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 898 transitions. [2020-07-07 13:22:14,312 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 898 transitions. Word has length 59 [2020-07-07 13:22:14,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:14,312 INFO L479 AbstractCegarLoop]: Abstraction has 691 states and 898 transitions. [2020-07-07 13:22:14,313 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:14,313 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 898 transitions. [2020-07-07 13:22:14,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-07-07 13:22:14,314 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:14,314 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-07-07 13:22:14,315 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-07 13:22:14,315 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:14,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:14,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1430933584, now seen corresponding path program 1 times [2020-07-07 13:22:14,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:14,316 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1685059225] [2020-07-07 13:22:14,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:14,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:14,348 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:14,348 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1685059225] [2020-07-07 13:22:14,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:14,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:14,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575265838] [2020-07-07 13:22:14,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:14,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:14,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:14,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:14,350 INFO L87 Difference]: Start difference. First operand 691 states and 898 transitions. Second operand 3 states. [2020-07-07 13:22:14,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:14,458 INFO L93 Difference]: Finished difference Result 1959 states and 2564 transitions. [2020-07-07 13:22:14,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:14,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-07-07 13:22:14,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:14,465 INFO L225 Difference]: With dead ends: 1959 [2020-07-07 13:22:14,465 INFO L226 Difference]: Without dead ends: 1301 [2020-07-07 13:22:14,467 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-07-07 13:22:14,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2020-07-07 13:22:14,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1299. [2020-07-07 13:22:14,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1299 states. [2020-07-07 13:22:14,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1666 transitions. [2020-07-07 13:22:14,579 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1666 transitions. Word has length 59 [2020-07-07 13:22:14,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:14,579 INFO L479 AbstractCegarLoop]: Abstraction has 1299 states and 1666 transitions. [2020-07-07 13:22:14,580 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:14,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1666 transitions. [2020-07-07 13:22:14,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-07-07 13:22:14,581 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:14,582 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:22:14,582 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-07 13:22:14,582 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:14,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:14,583 INFO L82 PathProgramCache]: Analyzing trace with hash -631232587, now seen corresponding path program 1 times [2020-07-07 13:22:14,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:14,583 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1667211657] [2020-07-07 13:22:14,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:14,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:14,610 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:14,610 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1667211657] [2020-07-07 13:22:14,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:14,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:14,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232533269] [2020-07-07 13:22:14,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:14,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:14,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:14,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:14,612 INFO L87 Difference]: Start difference. First operand 1299 states and 1666 transitions. Second operand 3 states. [2020-07-07 13:22:14,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:14,720 INFO L93 Difference]: Finished difference Result 1559 states and 1988 transitions. [2020-07-07 13:22:14,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:14,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-07-07 13:22:14,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:14,729 INFO L225 Difference]: With dead ends: 1559 [2020-07-07 13:22:14,729 INFO L226 Difference]: Without dead ends: 1557 [2020-07-07 13:22:14,730 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-07-07 13:22:14,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2020-07-07 13:22:14,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1299. [2020-07-07 13:22:14,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1299 states. [2020-07-07 13:22:14,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1650 transitions. [2020-07-07 13:22:14,843 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1650 transitions. Word has length 60 [2020-07-07 13:22:14,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:14,843 INFO L479 AbstractCegarLoop]: Abstraction has 1299 states and 1650 transitions. [2020-07-07 13:22:14,843 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:14,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1650 transitions. [2020-07-07 13:22:14,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-07-07 13:22:14,845 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:14,846 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-07-07 13:22:14,846 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-07 13:22:14,846 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:14,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:14,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1409021686, now seen corresponding path program 1 times [2020-07-07 13:22:14,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:14,848 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [362890969] [2020-07-07 13:22:14,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:14,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:14,873 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:14,874 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [362890969] [2020-07-07 13:22:14,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:14,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:14,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609593482] [2020-07-07 13:22:14,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:14,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:14,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:14,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:14,876 INFO L87 Difference]: Start difference. First operand 1299 states and 1650 transitions. Second operand 3 states. [2020-07-07 13:22:15,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:15,079 INFO L93 Difference]: Finished difference Result 3735 states and 4756 transitions. [2020-07-07 13:22:15,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:15,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-07-07 13:22:15,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:15,091 INFO L225 Difference]: With dead ends: 3735 [2020-07-07 13:22:15,092 INFO L226 Difference]: Without dead ends: 2469 [2020-07-07 13:22:15,096 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-07-07 13:22:15,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2469 states. [2020-07-07 13:22:15,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2469 to 2467. [2020-07-07 13:22:15,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2467 states. [2020-07-07 13:22:15,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 3074 transitions. [2020-07-07 13:22:15,264 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 3074 transitions. Word has length 60 [2020-07-07 13:22:15,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:15,264 INFO L479 AbstractCegarLoop]: Abstraction has 2467 states and 3074 transitions. [2020-07-07 13:22:15,265 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:15,265 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3074 transitions. [2020-07-07 13:22:15,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-07 13:22:15,267 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:15,267 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-07-07 13:22:15,268 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-07 13:22:15,268 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:15,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:15,268 INFO L82 PathProgramCache]: Analyzing trace with hash -729752476, now seen corresponding path program 1 times [2020-07-07 13:22:15,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:15,269 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [762743125] [2020-07-07 13:22:15,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:15,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:15,295 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:15,296 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [762743125] [2020-07-07 13:22:15,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:15,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:15,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490750175] [2020-07-07 13:22:15,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:15,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:15,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:15,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:15,298 INFO L87 Difference]: Start difference. First operand 2467 states and 3074 transitions. Second operand 3 states. [2020-07-07 13:22:15,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:15,645 INFO L93 Difference]: Finished difference Result 7143 states and 8900 transitions. [2020-07-07 13:22:15,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:15,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-07-07 13:22:15,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:15,663 INFO L225 Difference]: With dead ends: 7143 [2020-07-07 13:22:15,664 INFO L226 Difference]: Without dead ends: 3637 [2020-07-07 13:22:15,671 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-07-07 13:22:15,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3637 states. [2020-07-07 13:22:15,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3637 to 3635. [2020-07-07 13:22:15,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3635 states. [2020-07-07 13:22:15,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3635 states to 3635 states and 4370 transitions. [2020-07-07 13:22:15,966 INFO L78 Accepts]: Start accepts. Automaton has 3635 states and 4370 transitions. Word has length 61 [2020-07-07 13:22:15,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:15,967 INFO L479 AbstractCegarLoop]: Abstraction has 3635 states and 4370 transitions. [2020-07-07 13:22:15,967 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:15,967 INFO L276 IsEmpty]: Start isEmpty. Operand 3635 states and 4370 transitions. [2020-07-07 13:22:15,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-07 13:22:15,970 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:15,970 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-07-07 13:22:15,971 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-07 13:22:15,971 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:15,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:15,971 INFO L82 PathProgramCache]: Analyzing trace with hash 495374346, now seen corresponding path program 1 times [2020-07-07 13:22:15,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:15,972 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1270596126] [2020-07-07 13:22:15,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:16,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:16,012 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:16,013 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1270596126] [2020-07-07 13:22:16,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:16,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:16,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538484071] [2020-07-07 13:22:16,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:16,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:16,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:16,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:16,020 INFO L87 Difference]: Start difference. First operand 3635 states and 4370 transitions. Second operand 3 states. [2020-07-07 13:22:16,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:16,276 INFO L93 Difference]: Finished difference Result 4087 states and 4852 transitions. [2020-07-07 13:22:16,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:16,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-07-07 13:22:16,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:16,291 INFO L225 Difference]: With dead ends: 4087 [2020-07-07 13:22:16,291 INFO L226 Difference]: Without dead ends: 2917 [2020-07-07 13:22:16,297 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-07-07 13:22:16,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2020-07-07 13:22:16,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 2467. [2020-07-07 13:22:16,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2467 states. [2020-07-07 13:22:16,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 2914 transitions. [2020-07-07 13:22:16,500 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 2914 transitions. Word has length 61 [2020-07-07 13:22:16,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:16,501 INFO L479 AbstractCegarLoop]: Abstraction has 2467 states and 2914 transitions. [2020-07-07 13:22:16,501 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:16,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 2914 transitions. [2020-07-07 13:22:16,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-07 13:22:16,503 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:16,503 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-07-07 13:22:16,504 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-07 13:22:16,504 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:16,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:16,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1060451273, now seen corresponding path program 1 times [2020-07-07 13:22:16,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:16,505 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1156585628] [2020-07-07 13:22:16,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:16,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:16,529 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:16,530 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1156585628] [2020-07-07 13:22:16,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:16,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:16,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839966119] [2020-07-07 13:22:16,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:16,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:16,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:16,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:16,531 INFO L87 Difference]: Start difference. First operand 2467 states and 2914 transitions. Second operand 3 states. [2020-07-07 13:22:16,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:16,665 INFO L93 Difference]: Finished difference Result 2467 states and 2914 transitions. [2020-07-07 13:22:16,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:16,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-07-07 13:22:16,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:16,666 INFO L225 Difference]: With dead ends: 2467 [2020-07-07 13:22:16,666 INFO L226 Difference]: Without dead ends: 0 [2020-07-07 13:22:16,671 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-07-07 13:22:16,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-07 13:22:16,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-07 13:22:16,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-07 13:22:16,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-07 13:22:16,673 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2020-07-07 13:22:16,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:16,673 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-07 13:22:16,673 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:16,673 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-07 13:22:16,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-07 13:22:16,674 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-07 13:22:16,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-07 13:22:16,814 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-07 13:22:17,102 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 35 [2020-07-07 13:22:17,269 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 275 DAG size of output: 3 [2020-07-07 13:22:17,459 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 340 DAG size of output: 7 [2020-07-07 13:22:17,805 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 91 [2020-07-07 13:22:18,039 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 35 [2020-07-07 13:22:18,241 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 23 [2020-07-07 13:22:18,361 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 11 [2020-07-07 13:22:18,597 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 91 [2020-07-07 13:22:18,994 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2020-07-07 13:22:19,289 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 15 [2020-07-07 13:22:20,623 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification that was a NOOP. DAG size: 91 [2020-07-07 13:22:21,124 WARN L193 SmtUtils]: Spent 499.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-07 13:22:21,396 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-07 13:22:21,941 WARN L193 SmtUtils]: Spent 457.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-07 13:22:23,064 WARN L193 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 91 [2020-07-07 13:22:23,244 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-07 13:22:23,418 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-07 13:22:23,893 WARN L193 SmtUtils]: Spent 398.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-07 13:22:24,925 WARN L193 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 91 [2020-07-07 13:22:26,124 WARN L193 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 93 [2020-07-07 13:22:26,323 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-07 13:22:29,274 WARN L193 SmtUtils]: Spent 2.94 s on a formula simplification that was a NOOP. DAG size: 159 [2020-07-07 13:22:29,656 WARN L193 SmtUtils]: Spent 380.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-07 13:22:29,987 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-07 13:22:30,365 WARN L193 SmtUtils]: Spent 372.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-07 13:22:31,517 WARN L193 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 93 [2020-07-07 13:22:31,528 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-07 13:22:31,529 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-07 13:22:31,529 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-07 13:22:31,529 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-07 13:22:31,529 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-07 13:22:31,529 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-07 13:22:31,530 INFO L264 CegarLoopResult]: At program point L93(line 93) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk7~0)) (.cse1 (= 0 main_~p4~0)) (.cse3 (= 0 main_~p5~0)) (.cse4 (= 0 main_~p6~0)) (.cse5 (= 1 main_~lk6~0)) (.cse6 (= 0 main_~p7~0)) (.cse2 (= 1 main_~lk3~0)) (.cse7 (= 1 main_~lk5~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse1 .cse2 .cse7) (and .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse2 .cse4 .cse7 .cse8) (and .cse5 .cse0 .cse2 .cse7 .cse8) (and .cse5 .cse6 .cse2 .cse3 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse2 .cse3) (and .cse6 .cse1 .cse2 .cse4 .cse7) (and .cse5 .cse6 .cse1 .cse2 .cse3) (and .cse5 .cse0 .cse2 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse7) (and .cse0 .cse2 .cse4 .cse7 .cse8) (and .cse5 .cse0 .cse1 .cse2 .cse7) (and .cse6 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse6 .cse2 .cse7 .cse8))) [2020-07-07 13:22:31,530 INFO L264 CegarLoopResult]: At program point L60(line 60) the Hoare annotation is: (let ((.cse0 (= 0 main_~p2~0)) (.cse1 (= 0 main_~p1~0)) (.cse3 (= 1 main_~lk2~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse3 .cse1) (and .cse3 .cse2))) [2020-07-07 13:22:31,530 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 4 121) the Hoare annotation is: true [2020-07-07 13:22:31,531 INFO L271 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: true [2020-07-07 13:22:31,531 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-07 13:22:31,531 INFO L264 CegarLoopResult]: At program point L102(line 102) the Hoare annotation is: (let ((.cse3 (= 1 main_~lk6~0)) (.cse0 (= 0 main_~p7~0)) (.cse4 (= 1 main_~lk7~0)) (.cse1 (= 0 main_~p6~0)) (.cse2 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse3 .cse0 .cse2) (and .cse4 .cse1 .cse2))) [2020-07-07 13:22:31,531 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-07-07 13:22:31,532 INFO L264 CegarLoopResult]: At program point L86-1(lines 30 116) the Hoare annotation is: (let ((.cse5 (= 1 main_~lk7~0)) (.cse1 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p4~0)) (.cse9 (= 1 main_~lk6~0)) (.cse7 (= 1 main_~lk5~0)) (.cse0 (= 0 main_~p7~0)) (.cse6 (= 1 main_~lk3~0)) (.cse3 (= 0 main_~p5~0)) (.cse4 (= 0 main_~p6~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse2 .cse6 .cse3 .cse4) (and .cse0 .cse6 .cse4 .cse7 .cse8) (and .cse5 .cse6 .cse3 .cse4 .cse8) (and .cse9 .cse5 .cse2 .cse6 .cse3) (and .cse9 .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse6 .cse4 .cse7) (and .cse9 .cse5 .cse6 .cse3 .cse8) (and .cse1 .cse5 .cse4 .cse7 .cse8) (and .cse5 .cse2 .cse6 .cse4 .cse7) (and .cse9 .cse0 .cse1 .cse3 .cse8) (and .cse1 .cse5 .cse2 .cse4 .cse7) (and .cse9 .cse1 .cse5 .cse2 .cse7) (and .cse9 .cse5 .cse2 .cse6 .cse7) (and .cse0 .cse1 .cse4 .cse7 .cse8) (and .cse1 .cse5 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4 .cse8) (and .cse9 .cse1 .cse5 .cse7 .cse8) (and .cse0 .cse2 .cse6 .cse3 .cse4) (and .cse9 .cse0 .cse2 .cse6 .cse7) (and .cse9 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse1 .cse5 .cse2 .cse3) (and .cse9 .cse0 .cse6 .cse3 .cse8) (and .cse9 .cse0 .cse1 .cse2 .cse7) (and .cse9 .cse1 .cse5 .cse3 .cse8) (and .cse1 .cse5 .cse3 .cse4 .cse8) (and .cse9 .cse0 .cse2 .cse6 .cse3) (and .cse9 .cse0 .cse1 .cse7 .cse8) (and .cse5 .cse6 .cse4 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse7) (and .cse9 .cse0 .cse6 .cse7 .cse8) (and .cse0 .cse6 .cse3 .cse4 .cse8))) [2020-07-07 13:22:31,532 INFO L271 CegarLoopResult]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2020-07-07 13:22:31,532 INFO L271 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: true [2020-07-07 13:22:31,532 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-07 13:22:31,532 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-07-07 13:22:31,532 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-07-07 13:22:31,532 INFO L264 CegarLoopResult]: At program point L103(line 103) the Hoare annotation is: (let ((.cse3 (= 1 main_~lk6~0)) (.cse0 (= 0 main_~p7~0)) (.cse4 (= 1 main_~lk7~0)) (.cse1 (= 0 main_~p6~0)) (.cse2 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse3 .cse0 .cse2) (and .cse4 .cse1 .cse2))) [2020-07-07 13:22:31,533 INFO L271 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: true [2020-07-07 13:22:31,533 INFO L264 CegarLoopResult]: At program point L120(line 120) the Hoare annotation is: false [2020-07-07 13:22:31,533 INFO L264 CegarLoopResult]: At program point L87(line 87) the Hoare annotation is: (let ((.cse3 (= 1 main_~lk7~0)) (.cse0 (= 1 main_~lk6~0)) (.cse6 (= 0 main_~p4~0)) (.cse9 (= 1 main_~lk3~0)) (.cse7 (= 1 main_~lk5~0)) (.cse8 (= 0 main_~p7~0)) (.cse1 (= 0 main_~p3~0)) (.cse2 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p5~0)) (.cse10 (= 0 main_~p6~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse5) (and .cse2 .cse3 .cse6 .cse9 .cse10 .cse7) (and .cse0 .cse2 .cse3 .cse9 .cse7 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse4) (and .cse8 .cse2 .cse9 .cse4 .cse10 .cse5) (and .cse8 .cse2 .cse6 .cse9 .cse4 .cse10) (and .cse0 .cse8 .cse2 .cse9 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse2 .cse7 .cse5) (and .cse8 .cse2 .cse6 .cse9 .cse10 .cse7) (and .cse2 .cse3 .cse9 .cse10 .cse7 .cse5) (and .cse2 .cse3 .cse6 .cse9 .cse4 .cse10) (and .cse2 .cse3 .cse9 .cse4 .cse10 .cse5) (and .cse1 .cse2 .cse3 .cse6 .cse4 .cse10) (and .cse8 .cse1 .cse2 .cse6 .cse10 .cse7) (and .cse1 .cse2 .cse3 .cse6 .cse10 .cse7) (and .cse1 .cse2 .cse3 .cse10 .cse7 .cse5) (and .cse0 .cse8 .cse1 .cse2 .cse6 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse0 .cse8 .cse2 .cse6 .cse9 .cse4) (and .cse8 .cse1 .cse2 .cse6 .cse4 .cse10) (and .cse8 .cse2 .cse9 .cse10 .cse7 .cse5) (and .cse0 .cse8 .cse2 .cse9 .cse7 .cse5) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse5) (and .cse0 .cse2 .cse3 .cse6 .cse9 .cse7) (and .cse0 .cse2 .cse3 .cse6 .cse9 .cse4) (and .cse0 .cse2 .cse3 .cse9 .cse4 .cse5) (and .cse8 .cse1 .cse2 .cse10 .cse7 .cse5) (and .cse0 .cse8 .cse1 .cse2 .cse6 .cse7) (and .cse0 .cse8 .cse2 .cse6 .cse9 .cse7) (and .cse8 .cse1 .cse2 .cse4 .cse10 .cse5))) [2020-07-07 13:22:31,533 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-07-07 13:22:31,533 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-07-07 13:22:31,534 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-07-07 13:22:31,534 INFO L264 CegarLoopResult]: At program point L112(line 112) the Hoare annotation is: (= 1 main_~lk7~0) [2020-07-07 13:22:31,534 INFO L264 CegarLoopResult]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2020-07-07 13:22:31,534 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-07-07 13:22:31,534 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 4 121) the Hoare annotation is: true [2020-07-07 13:22:31,535 INFO L264 CegarLoopResult]: At program point L71-1(lines 30 116) the Hoare annotation is: (let ((.cse6 (= 0 main_~p2~0)) (.cse10 (= 1 main_~lk3~0)) (.cse11 (= 1 main_~lk6~0)) (.cse2 (= 0 main_~p5~0)) (.cse9 (= 0 main_~p4~0)) (.cse8 (= 1 main_~lk1~0)) (.cse0 (= 0 main_~p3~0)) (.cse1 (= 1 main_~lk2~0)) (.cse3 (= 0 main_~p6~0)) (.cse4 (= 0 main_~p1~0)) (.cse7 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse9 .cse6 .cse3 .cse4 .cse7) (and .cse9 .cse6 .cse10 .cse2 .cse3 .cse8) (and .cse11 .cse0 .cse1 .cse4 .cse7 .cse5) (and .cse6 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse4 .cse7) (and .cse11 .cse0 .cse9 .cse6 .cse2 .cse4) (and .cse6 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse4) (and .cse11 .cse0 .cse6 .cse2 .cse4 .cse5) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse4) (and .cse11 .cse1 .cse9 .cse10 .cse7 .cse8) (and .cse11 .cse1 .cse10 .cse2 .cse4 .cse5) (and .cse11 .cse0 .cse6 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse6 .cse7 .cse8 .cse5) (and .cse1 .cse9 .cse10 .cse3 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse6 .cse10 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse7 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse6 .cse2 .cse8 .cse5) (and .cse6 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse0 .cse9 .cse6 .cse3 .cse7 .cse8) (and .cse11 .cse0 .cse9 .cse6 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse4) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse4) (and .cse11 .cse6 .cse10 .cse2 .cse4 .cse5) (and .cse9 .cse6 .cse10 .cse3 .cse4 .cse7) (and .cse11 .cse1 .cse10 .cse4 .cse7 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse11 .cse6 .cse10 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse2 .cse8) (and .cse9 .cse6 .cse10 .cse3 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse7 .cse8) (and .cse11 .cse1 .cse10 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse9 .cse4 .cse7) (and .cse11 .cse1 .cse10 .cse2 .cse8 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse4 .cse7) (and .cse11 .cse9 .cse6 .cse10 .cse4 .cse7) (and .cse11 .cse9 .cse6 .cse10 .cse7 .cse8) (and .cse11 .cse6 .cse10 .cse2 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse8) (and .cse6 .cse10 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse8) (and .cse0 .cse6 .cse3 .cse4 .cse7 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse8) (and .cse0 .cse1 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse9 .cse6 .cse10 .cse2 .cse4) (and .cse11 .cse9 .cse6 .cse10 .cse2 .cse8) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse7) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse11 .cse0 .cse1 .cse2 .cse8 .cse5) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse8) (and .cse1 .cse10 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse6 .cse10 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse1 .cse9 .cse3 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse7 .cse5))) [2020-07-07 13:22:31,535 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) the Hoare annotation is: false [2020-07-07 13:22:31,535 INFO L264 CegarLoopResult]: At program point L96-1(lines 30 116) the Hoare annotation is: (let ((.cse4 (= 0 main_~p5~0)) (.cse3 (= 1 main_~lk6~0)) (.cse0 (= 0 main_~p7~0)) (.cse5 (= 1 main_~lk7~0)) (.cse1 (= 0 main_~p6~0)) (.cse2 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse4) (and .cse0 .cse4 .cse1) (and .cse5 .cse4 .cse1) (and .cse3 .cse5 .cse2) (and .cse3 .cse5 .cse4) (and .cse3 .cse0 .cse2) (and .cse5 .cse1 .cse2))) [2020-07-07 13:22:31,536 INFO L264 CegarLoopResult]: At program point L63-1(lines 30 116) the Hoare annotation is: (let ((.cse7 (= 0 main_~p2~0)) (.cse4 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p1~0)) (.cse5 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse6 (= 1 main_~lk1~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6) (and .cse7 .cse1 .cse6 .cse3) (and .cse5 .cse7 .cse1 .cse6) (and .cse4 .cse0 .cse6 .cse3) (and .cse4 .cse7 .cse6 .cse3) (and .cse7 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse7 .cse6) (and .cse5 .cse7 .cse1 .cse2) (and .cse4 .cse0 .cse5 .cse2) (and .cse4 .cse5 .cse7 .cse2) (and .cse4 .cse7 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2) (and .cse0 .cse5 .cse1 .cse6) (and .cse0 .cse1 .cse6 .cse3))) [2020-07-07 13:22:31,536 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 121) the Hoare annotation is: true [2020-07-07 13:22:31,536 INFO L264 CegarLoopResult]: At program point L88(line 88) the Hoare annotation is: (let ((.cse3 (= 1 main_~lk7~0)) (.cse0 (= 1 main_~lk6~0)) (.cse6 (= 0 main_~p4~0)) (.cse9 (= 1 main_~lk3~0)) (.cse7 (= 1 main_~lk5~0)) (.cse8 (= 0 main_~p7~0)) (.cse1 (= 0 main_~p3~0)) (.cse2 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p5~0)) (.cse10 (= 0 main_~p6~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse5) (and .cse2 .cse3 .cse6 .cse9 .cse10 .cse7) (and .cse0 .cse2 .cse3 .cse9 .cse7 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse4) (and .cse8 .cse2 .cse9 .cse4 .cse10 .cse5) (and .cse8 .cse2 .cse6 .cse9 .cse4 .cse10) (and .cse0 .cse8 .cse2 .cse9 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse2 .cse7 .cse5) (and .cse8 .cse2 .cse6 .cse9 .cse10 .cse7) (and .cse2 .cse3 .cse9 .cse10 .cse7 .cse5) (and .cse2 .cse3 .cse6 .cse9 .cse4 .cse10) (and .cse2 .cse3 .cse9 .cse4 .cse10 .cse5) (and .cse1 .cse2 .cse3 .cse6 .cse4 .cse10) (and .cse8 .cse1 .cse2 .cse6 .cse10 .cse7) (and .cse1 .cse2 .cse3 .cse6 .cse10 .cse7) (and .cse1 .cse2 .cse3 .cse10 .cse7 .cse5) (and .cse0 .cse8 .cse1 .cse2 .cse6 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse0 .cse8 .cse2 .cse6 .cse9 .cse4) (and .cse8 .cse1 .cse2 .cse6 .cse4 .cse10) (and .cse8 .cse2 .cse9 .cse10 .cse7 .cse5) (and .cse0 .cse8 .cse2 .cse9 .cse7 .cse5) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse5) (and .cse0 .cse2 .cse3 .cse6 .cse9 .cse7) (and .cse0 .cse2 .cse3 .cse6 .cse9 .cse4) (and .cse0 .cse2 .cse3 .cse9 .cse4 .cse5) (and .cse8 .cse1 .cse2 .cse10 .cse7 .cse5) (and .cse0 .cse8 .cse1 .cse2 .cse6 .cse7) (and .cse0 .cse8 .cse2 .cse6 .cse9 .cse7) (and .cse8 .cse1 .cse2 .cse4 .cse10 .cse5))) [2020-07-07 13:22:31,536 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-07 13:22:31,536 INFO L264 CegarLoopResult]: At program point L55-1(lines 30 116) the Hoare annotation is: (let ((.cse0 (= 0 main_~p2~0)) (.cse1 (= 0 main_~p1~0)) (.cse3 (= 1 main_~lk2~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse3 .cse1) (and .cse3 .cse2))) [2020-07-07 13:22:31,536 INFO L264 CegarLoopResult]: At program point L113(line 113) the Hoare annotation is: (= 1 main_~lk7~0) [2020-07-07 13:22:31,537 INFO L271 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: true [2020-07-07 13:22:31,537 INFO L264 CegarLoopResult]: At program point L72(line 72) the Hoare annotation is: (let ((.cse1 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p3~0)) (.cse9 (= 0 main_~p1~0)) (.cse7 (= 0 main_~p2~0)) (.cse2 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk1~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse4) (and .cse5 .cse7 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse5 .cse7 .cse9 .cse3 .cse8) (and .cse1 .cse7 .cse2 .cse6 .cse4) (and .cse7 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse9 .cse3) (and .cse0 .cse2 .cse6 .cse4 .cse8) (and .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse9 .cse3 .cse8) (and .cse5 .cse7 .cse6 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse6 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse8) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse9 .cse3) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse6 .cse4 .cse8) (and .cse7 .cse2 .cse6 .cse9 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse9 .cse3) (and .cse5 .cse0 .cse6 .cse9 .cse8) (and .cse0 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse9) (and .cse5 .cse0 .cse3 .cse4 .cse8) (and .cse5 .cse7 .cse6 .cse9 .cse8) (and .cse7 .cse2 .cse6 .cse4 .cse8))) [2020-07-07 13:22:31,537 INFO L271 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: true [2020-07-07 13:22:31,537 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-07 13:22:31,537 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-07 13:22:31,537 INFO L264 CegarLoopResult]: At program point L97(line 97) the Hoare annotation is: (let ((.cse5 (= 0 main_~p6~0)) (.cse2 (= 1 main_~lk5~0)) (.cse6 (= 1 main_~lk7~0)) (.cse0 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p7~0)) (.cse4 (= 0 main_~p5~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse4 .cse5 .cse3) (and .cse0 .cse6 .cse2 .cse3) (and .cse6 .cse4 .cse5 .cse3) (and .cse6 .cse5 .cse2 .cse3) (and .cse1 .cse5 .cse2 .cse3) (and .cse0 .cse6 .cse4 .cse3) (and .cse0 .cse1 .cse4 .cse3))) [2020-07-07 13:22:31,538 INFO L264 CegarLoopResult]: At program point L64(line 64) the Hoare annotation is: (let ((.cse5 (= 0 main_~p1~0)) (.cse3 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse4 .cse1 .cse5) (and .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse5) (and .cse3 .cse0 .cse5) (and .cse3 .cse0 .cse2) (and .cse4 .cse1 .cse2))) [2020-07-07 13:22:31,538 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-07-07 13:22:31,538 INFO L271 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: true [2020-07-07 13:22:31,538 INFO L271 CegarLoopResult]: At program point L31-2(line 31) the Hoare annotation is: true [2020-07-07 13:22:31,538 INFO L264 CegarLoopResult]: At program point L56(line 56) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-07 13:22:31,538 INFO L264 CegarLoopResult]: At program point L81-1(lines 30 116) the Hoare annotation is: (let ((.cse4 (= 0 main_~p5~0)) (.cse5 (= 1 main_~lk4~0)) (.cse8 (= 1 main_~lk3~0)) (.cse0 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p7~0)) (.cse3 (= 1 main_~lk2~0)) (.cse2 (= 0 main_~p3~0)) (.cse6 (= 1 main_~lk7~0)) (.cse7 (= 0 main_~p4~0)) (.cse11 (= 0 main_~p2~0)) (.cse9 (= 0 main_~p6~0)) (.cse10 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse3 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse3 .cse6 .cse8 .cse10 .cse5) (and .cse0 .cse2 .cse6 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse7 .cse11 .cse9 .cse10) (and .cse1 .cse3 .cse8 .cse4 .cse9 .cse5) (and .cse1 .cse3 .cse7 .cse8 .cse4 .cse9) (and .cse0 .cse1 .cse11 .cse8 .cse4 .cse5) (and .cse3 .cse6 .cse8 .cse9 .cse10 .cse5) (and .cse3 .cse6 .cse7 .cse8 .cse4 .cse9) (and .cse0 .cse2 .cse6 .cse11 .cse10 .cse5) (and .cse3 .cse6 .cse8 .cse4 .cse9 .cse5) (and .cse2 .cse3 .cse6 .cse7 .cse4 .cse9) (and .cse1 .cse2 .cse3 .cse7 .cse9 .cse10) (and .cse1 .cse2 .cse7 .cse11 .cse4 .cse9) (and .cse2 .cse3 .cse6 .cse9 .cse10 .cse5) (and .cse2 .cse6 .cse7 .cse11 .cse4 .cse9) (and .cse2 .cse3 .cse6 .cse7 .cse9 .cse10) (and .cse0 .cse2 .cse6 .cse7 .cse11 .cse4) (and .cse1 .cse7 .cse11 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse3 .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse7 .cse11 .cse8 .cse10) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse9) (and .cse2 .cse6 .cse11 .cse4 .cse9 .cse5) (and .cse0 .cse1 .cse2 .cse7 .cse11 .cse10) (and .cse0 .cse1 .cse11 .cse8 .cse10 .cse5) (and .cse0 .cse3 .cse6 .cse7 .cse8 .cse10) (and .cse6 .cse7 .cse11 .cse8 .cse9 .cse10) (and .cse0 .cse6 .cse7 .cse11 .cse8 .cse4) (and .cse0 .cse6 .cse7 .cse11 .cse8 .cse10) (and .cse0 .cse3 .cse6 .cse8 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse9 .cse10 .cse5) (and .cse1 .cse2 .cse3 .cse9 .cse10 .cse5) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse5) (and .cse0 .cse2 .cse3 .cse6 .cse4 .cse5) (and .cse0 .cse6 .cse11 .cse8 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse6 .cse7 .cse10) (and .cse0 .cse2 .cse6 .cse7 .cse11 .cse10) (and .cse0 .cse1 .cse2 .cse11 .cse10 .cse5) (and .cse2 .cse6 .cse11 .cse9 .cse10 .cse5) (and .cse1 .cse11 .cse8 .cse4 .cse9 .cse5) (and .cse0 .cse2 .cse3 .cse6 .cse7 .cse4) (and .cse1 .cse2 .cse11 .cse4 .cse9 .cse5) (and .cse1 .cse7 .cse11 .cse8 .cse4 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse0 .cse1 .cse3 .cse8 .cse4 .cse5) (and .cse1 .cse3 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse7 .cse11 .cse8 .cse4) (and .cse1 .cse11 .cse8 .cse9 .cse10 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse5) (and .cse1 .cse3 .cse8 .cse9 .cse10 .cse5) (and .cse0 .cse1 .cse3 .cse8 .cse10 .cse5) (and .cse6 .cse7 .cse11 .cse8 .cse4 .cse9) (and .cse6 .cse11 .cse8 .cse4 .cse9 .cse5) (and .cse2 .cse3 .cse6 .cse4 .cse9 .cse5) (and .cse0 .cse3 .cse6 .cse7 .cse8 .cse4) (and .cse0 .cse6 .cse11 .cse8 .cse10 .cse5) (and .cse6 .cse11 .cse8 .cse9 .cse10 .cse5) (and .cse0 .cse1 .cse2 .cse7 .cse11 .cse4) (and .cse0 .cse1 .cse2 .cse11 .cse4 .cse5) (and .cse0 .cse1 .cse3 .cse7 .cse8 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse10) (and .cse2 .cse6 .cse7 .cse11 .cse9 .cse10))) [2020-07-07 13:22:31,539 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-07 13:22:31,539 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-07-07 13:22:31,539 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-07-07 13:22:31,539 INFO L264 CegarLoopResult]: At program point L106-1(lines 30 116) the Hoare annotation is: (or (= 0 main_~p7~0) (= 1 main_~lk7~0)) [2020-07-07 13:22:31,539 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-07-07 13:22:31,539 INFO L264 CegarLoopResult]: At program point L98(line 98) the Hoare annotation is: (let ((.cse5 (= 0 main_~p6~0)) (.cse2 (= 1 main_~lk5~0)) (.cse6 (= 1 main_~lk7~0)) (.cse0 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p7~0)) (.cse4 (= 0 main_~p5~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse4 .cse5 .cse3) (and .cse0 .cse6 .cse2 .cse3) (and .cse6 .cse4 .cse5 .cse3) (and .cse1 .cse5 .cse2 .cse3) (and .cse6 .cse5 .cse2 .cse3) (and .cse0 .cse6 .cse4 .cse3) (and .cse0 .cse1 .cse4 .cse3))) [2020-07-07 13:22:31,539 INFO L271 CegarLoopResult]: At program point L32(lines 32 34) the Hoare annotation is: true [2020-07-07 13:22:31,539 INFO L271 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-07-07 13:22:31,539 INFO L271 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: true [2020-07-07 13:22:31,540 INFO L271 CegarLoopResult]: At program point L24-2(line 24) the Hoare annotation is: true [2020-07-07 13:22:31,540 INFO L264 CegarLoopResult]: At program point L82(line 82) the Hoare annotation is: (let ((.cse2 (= 0 main_~p2~0)) (.cse8 (= 0 main_~p3~0)) (.cse9 (= main_~lk7~0 1)) (.cse7 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p4~0)) (.cse10 (= 1 main_~lk5~0)) (.cse0 (= 0 main_~p7~0)) (.cse11 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk3~0)) (.cse4 (= 0 main_~p5~0)) (.cse5 (= 0 main_~p6~0)) (.cse6 (= 1 main_~lk1~0)) (.cse12 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse1 .cse2 .cse10 .cse6) (and .cse11 .cse9 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse11 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse10 .cse6 .cse12) (and .cse7 .cse11 .cse9 .cse3 .cse4 .cse6 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse5 .cse10 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse9 .cse2 .cse3 .cse4 .cse6 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse9 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse9 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse8 .cse11 .cse9 .cse5 .cse10 .cse6 .cse12) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse1 .cse10 .cse6) (and .cse0 .cse11 .cse1 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse4 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse11 .cse1 .cse4 .cse6) (and .cse7 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse0 .cse8 .cse11 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse11 .cse4 .cse6 .cse12) (and .cse11 .cse9 .cse1 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse1 .cse4 .cse6) (and .cse7 .cse0 .cse8 .cse2 .cse4 .cse6 .cse12) (and .cse7 .cse0 .cse2 .cse3 .cse4 .cse6 .cse12) (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse2 .cse10 .cse6 .cse12) (and .cse9 .cse2 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse7 .cse9 .cse2 .cse3 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse1 .cse2 .cse4 .cse6) (and .cse11 .cse9 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse11 .cse3 .cse10 .cse6 .cse12) (and .cse8 .cse9 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse11 .cse1 .cse10 .cse6) (and .cse7 .cse8 .cse9 .cse2 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse11 .cse1 .cse3 .cse10 .cse6) (and .cse0 .cse8 .cse11 .cse1 .cse5 .cse10 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse3 .cse10 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse8 .cse9 .cse1 .cse2 .cse5 .cse10 .cse6) (and .cse11 .cse9 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse1 .cse2 .cse4 .cse6) (and .cse9 .cse1 .cse2 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse6 .cse12) (and .cse0 .cse8 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse11 .cse9 .cse3 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse1 .cse2 .cse10 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse0 .cse11 .cse3 .cse4 .cse6 .cse12) (and .cse0 .cse8 .cse2 .cse5 .cse10 .cse6 .cse12) (and .cse8 .cse11 .cse9 .cse1 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse2 .cse4 .cse6 .cse12) (and .cse0 .cse8 .cse11 .cse5 .cse10 .cse6 .cse12) (and .cse0 .cse8 .cse11 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse8 .cse11 .cse1 .cse4 .cse5 .cse6) (and .cse8 .cse9 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse8 .cse11 .cse9 .cse1 .cse5 .cse10 .cse6) (and .cse8 .cse9 .cse2 .cse5 .cse10 .cse6 .cse12) (and .cse8 .cse11 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse11 .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse11 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse0 .cse11 .cse3 .cse4 .cse5 .cse6 .cse12))) [2020-07-07 13:22:31,541 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-07 13:22:31,541 INFO L264 CegarLoopResult]: At program point L107(line 107) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk6~0))) (or (and .cse0 (= 1 main_~lk7~0)) (and .cse0 (= 0 main_~p7~0)))) [2020-07-07 13:22:31,541 INFO L271 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: true [2020-07-07 13:22:31,541 INFO L264 CegarLoopResult]: At program point L91-1(lines 30 116) the Hoare annotation is: (let ((.cse3 (= 1 main_~lk4~0)) (.cse0 (= 0 main_~p7~0)) (.cse7 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk6~0)) (.cse6 (= 1 main_~lk7~0)) (.cse4 (= 0 main_~p4~0)) (.cse1 (= 0 main_~p5~0)) (.cse2 (= 0 main_~p6~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse2) (and .cse5 .cse6 .cse7 .cse3) (and .cse6 .cse2 .cse7 .cse3) (and .cse5 .cse0 .cse1 .cse3) (and .cse6 .cse4 .cse2 .cse7) (and .cse5 .cse0 .cse7 .cse3) (and .cse6 .cse1 .cse2 .cse3) (and .cse5 .cse6 .cse4 .cse7) (and .cse5 .cse0 .cse4 .cse1) (and .cse5 .cse0 .cse4 .cse7) (and .cse5 .cse6 .cse1 .cse3) (and .cse0 .cse2 .cse7 .cse3) (and .cse0 .cse4 .cse2 .cse7) (and .cse5 .cse6 .cse4 .cse1) (and .cse6 .cse4 .cse1 .cse2))) [2020-07-07 13:22:31,541 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-07-07 13:22:31,542 INFO L264 CegarLoopResult]: At program point L83(line 83) the Hoare annotation is: (let ((.cse2 (= 0 main_~p2~0)) (.cse8 (= 0 main_~p3~0)) (.cse9 (= main_~lk7~0 1)) (.cse7 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p4~0)) (.cse10 (= 1 main_~lk5~0)) (.cse0 (= 0 main_~p7~0)) (.cse11 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk3~0)) (.cse4 (= 0 main_~p5~0)) (.cse5 (= 0 main_~p6~0)) (.cse6 (= 1 main_~lk1~0)) (.cse12 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse1 .cse2 .cse10 .cse6) (and .cse11 .cse9 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse11 .cse9 .cse10 .cse6 .cse12) (and .cse7 .cse11 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse7 .cse11 .cse9 .cse3 .cse4 .cse6 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse5 .cse10 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse9 .cse2 .cse3 .cse4 .cse6 .cse12) (and .cse9 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse9 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse8 .cse11 .cse9 .cse5 .cse10 .cse6 .cse12) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse1 .cse10 .cse6) (and .cse0 .cse11 .cse1 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse4 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse11 .cse1 .cse4 .cse6) (and .cse7 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse0 .cse8 .cse11 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse11 .cse4 .cse6 .cse12) (and .cse11 .cse9 .cse1 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse1 .cse4 .cse6) (and .cse7 .cse0 .cse8 .cse2 .cse4 .cse6 .cse12) (and .cse7 .cse0 .cse2 .cse3 .cse4 .cse6 .cse12) (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse2 .cse10 .cse6 .cse12) (and .cse7 .cse9 .cse2 .cse3 .cse10 .cse6 .cse12) (and .cse9 .cse2 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse1 .cse2 .cse4 .cse6) (and .cse11 .cse9 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse11 .cse3 .cse10 .cse6 .cse12) (and .cse8 .cse9 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse11 .cse1 .cse10 .cse6) (and .cse7 .cse0 .cse11 .cse1 .cse3 .cse10 .cse6) (and .cse7 .cse8 .cse9 .cse2 .cse10 .cse6 .cse12) (and .cse0 .cse8 .cse11 .cse1 .cse5 .cse10 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse3 .cse10 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse8 .cse9 .cse1 .cse2 .cse5 .cse10 .cse6) (and .cse11 .cse9 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse1 .cse2 .cse4 .cse6) (and .cse9 .cse1 .cse2 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse6 .cse12) (and .cse0 .cse8 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse11 .cse9 .cse3 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse1 .cse2 .cse10 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse0 .cse11 .cse3 .cse4 .cse6 .cse12) (and .cse0 .cse8 .cse2 .cse5 .cse10 .cse6 .cse12) (and .cse8 .cse11 .cse9 .cse1 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse2 .cse4 .cse6 .cse12) (and .cse0 .cse8 .cse11 .cse5 .cse10 .cse6 .cse12) (and .cse0 .cse8 .cse11 .cse4 .cse5 .cse6 .cse12) (and .cse8 .cse9 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse8 .cse11 .cse1 .cse4 .cse5 .cse6) (and .cse8 .cse11 .cse9 .cse1 .cse5 .cse10 .cse6) (and .cse8 .cse9 .cse2 .cse5 .cse10 .cse6 .cse12) (and .cse8 .cse11 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse11 .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse11 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse0 .cse11 .cse3 .cse4 .cse5 .cse6 .cse12))) [2020-07-07 13:22:31,542 INFO L264 CegarLoopResult]: At program point L108(line 108) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk6~0))) (or (and .cse0 (= 1 main_~lk7~0)) (and .cse0 (= 0 main_~p7~0)))) [2020-07-07 13:22:31,543 INFO L264 CegarLoopResult]: At program point L75-1(lines 30 116) the Hoare annotation is: (let ((.cse7 (= 1 main_~lk6~0)) (.cse6 (= 1 main_~lk5~0)) (.cse8 (= 0 main_~p3~0)) (.cse0 (= main_~lk7~0 1)) (.cse1 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p2~0)) (.cse5 (= 0 main_~p1~0)) (.cse13 (= 0 main_~p7~0)) (.cse9 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk3~0)) (.cse10 (= 0 main_~p5~0)) (.cse4 (= 0 main_~p6~0)) (.cse11 (= 1 main_~lk1~0)) (.cse12 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse0 .cse1 .cse10 .cse5) (and .cse9 .cse0 .cse3 .cse10 .cse4 .cse11 .cse12) (and .cse7 .cse9 .cse0 .cse1 .cse3 .cse10 .cse11) (and .cse13 .cse8 .cse1 .cse2 .cse4 .cse6 .cse11) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse10 .cse4 .cse11 .cse12) (and .cse8 .cse9 .cse0 .cse1 .cse10 .cse4 .cse5) (and .cse13 .cse8 .cse1 .cse2 .cse10 .cse4 .cse11) (and .cse13 .cse9 .cse1 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse9 .cse0 .cse3 .cse10 .cse5 .cse12) (and .cse7 .cse13 .cse8 .cse9 .cse1 .cse10 .cse11) (and .cse13 .cse8 .cse9 .cse1 .cse10 .cse4 .cse5) (and .cse13 .cse9 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse13 .cse8 .cse2 .cse10 .cse5 .cse12) (and .cse9 .cse0 .cse1 .cse3 .cse4 .cse6 .cse11) (and .cse7 .cse8 .cse9 .cse0 .cse1 .cse10 .cse11) (and .cse7 .cse13 .cse8 .cse2 .cse10 .cse11 .cse12) (and .cse13 .cse8 .cse9 .cse10 .cse4 .cse5 .cse12) (and .cse7 .cse8 .cse9 .cse0 .cse10 .cse5 .cse12) (and .cse7 .cse13 .cse8 .cse2 .cse6 .cse11 .cse12) (and .cse7 .cse13 .cse8 .cse2 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse2 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse0 .cse2 .cse5 .cse6 .cse12) (and .cse7 .cse13 .cse9 .cse1 .cse3 .cse5 .cse6) (and .cse13 .cse8 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse0 .cse2 .cse10 .cse5 .cse12) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse5 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse13 .cse9 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse13 .cse8 .cse9 .cse1 .cse10 .cse5) (and .cse7 .cse8 .cse0 .cse2 .cse6 .cse11 .cse12) (and .cse9 .cse0 .cse3 .cse10 .cse4 .cse5 .cse12) (and .cse7 .cse9 .cse0 .cse1 .cse3 .cse6 .cse11) (and .cse7 .cse13 .cse8 .cse9 .cse1 .cse5 .cse6) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse6 .cse11) (and .cse9 .cse0 .cse1 .cse3 .cse10 .cse4 .cse11) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse10 .cse11) (and .cse9 .cse0 .cse1 .cse3 .cse10 .cse4 .cse5) (and .cse9 .cse0 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse13 .cse8 .cse1 .cse2 .cse10 .cse4 .cse5) (and .cse7 .cse13 .cse2 .cse3 .cse6 .cse11 .cse12) (and .cse7 .cse13 .cse9 .cse3 .cse10 .cse5 .cse12) (and .cse7 .cse9 .cse0 .cse3 .cse6 .cse11 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse6 .cse11) (and .cse7 .cse13 .cse8 .cse1 .cse2 .cse6 .cse11) (and .cse7 .cse13 .cse9 .cse3 .cse10 .cse11 .cse12) (and .cse7 .cse9 .cse0 .cse1 .cse3 .cse10 .cse5) (and .cse8 .cse9 .cse0 .cse1 .cse10 .cse4 .cse11) (and .cse13 .cse8 .cse2 .cse10 .cse4 .cse5 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse8 .cse0 .cse2 .cse10 .cse11 .cse12) (and .cse13 .cse2 .cse3 .cse10 .cse4 .cse5 .cse12) (and .cse13 .cse8 .cse9 .cse4 .cse6 .cse11 .cse12) (and .cse13 .cse8 .cse9 .cse1 .cse10 .cse4 .cse11) (and .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse8 .cse0 .cse2 .cse4 .cse6 .cse11 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse8 .cse9 .cse0 .cse10 .cse4 .cse11 .cse12) (and .cse7 .cse13 .cse8 .cse1 .cse2 .cse10 .cse5) (and .cse13 .cse8 .cse9 .cse1 .cse4 .cse5 .cse6) (and .cse13 .cse9 .cse3 .cse4 .cse6 .cse11 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse10 .cse4 .cse11) (and .cse13 .cse8 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse8 .cse0 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse6 .cse11) (and .cse0 .cse2 .cse3 .cse10 .cse4 .cse5 .cse12) (and .cse7 .cse8 .cse9 .cse0 .cse6 .cse11 .cse12) (and .cse7 .cse9 .cse0 .cse3 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse13 .cse1 .cse2 .cse3 .cse10 .cse11) (and .cse9 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse6 .cse11) (and .cse8 .cse9 .cse0 .cse4 .cse6 .cse11 .cse12) (and .cse13 .cse9 .cse1 .cse3 .cse10 .cse4 .cse11) (and .cse7 .cse8 .cse9 .cse0 .cse1 .cse6 .cse11) (and .cse13 .cse9 .cse1 .cse3 .cse4 .cse6 .cse11) (and .cse7 .cse8 .cse9 .cse0 .cse10 .cse11 .cse12) (and .cse13 .cse9 .cse3 .cse10 .cse4 .cse5 .cse12) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse11) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse7 .cse13 .cse8 .cse9 .cse6 .cse11 .cse12) (and .cse7 .cse13 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse7 .cse13 .cse8 .cse1 .cse2 .cse5 .cse6) (and .cse7 .cse13 .cse2 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse13 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse8 .cse9 .cse0 .cse1 .cse4 .cse5 .cse6) (and .cse8 .cse0 .cse2 .cse10 .cse4 .cse5 .cse12) (and .cse7 .cse13 .cse2 .cse3 .cse10 .cse11 .cse12) (and .cse13 .cse2 .cse3 .cse4 .cse6 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse11 .cse12) (and .cse7 .cse0 .cse2 .cse3 .cse6 .cse11 .cse12) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse10 .cse5) (and .cse7 .cse13 .cse8 .cse1 .cse2 .cse10 .cse11) (and .cse7 .cse9 .cse0 .cse1 .cse3 .cse5 .cse6) (and .cse9 .cse0 .cse3 .cse4 .cse6 .cse11 .cse12) (and .cse7 .cse13 .cse9 .cse3 .cse6 .cse11 .cse12) (and .cse13 .cse8 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse8 .cse0 .cse2 .cse10 .cse4 .cse11 .cse12) (and .cse7 .cse13 .cse8 .cse9 .cse1 .cse6 .cse11) (and .cse7 .cse13 .cse9 .cse1 .cse3 .cse6 .cse11) (and .cse13 .cse8 .cse9 .cse1 .cse4 .cse6 .cse11) (and .cse13 .cse9 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse5 .cse6) (and .cse13 .cse2 .cse3 .cse10 .cse4 .cse11 .cse12) (and .cse7 .cse13 .cse1 .cse2 .cse3 .cse6 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse11) (and .cse7 .cse13 .cse2 .cse3 .cse10 .cse5 .cse12) (and .cse7 .cse13 .cse8 .cse9 .cse10 .cse5 .cse12) (and .cse8 .cse9 .cse0 .cse4 .cse5 .cse6 .cse12) (and .cse13 .cse8 .cse2 .cse10 .cse4 .cse11 .cse12) (and .cse13 .cse8 .cse2 .cse4 .cse6 .cse11 .cse12) (and .cse7 .cse8 .cse9 .cse0 .cse1 .cse5 .cse6) (and .cse7 .cse13 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse13 .cse8 .cse9 .cse10 .cse4 .cse11 .cse12) (and .cse8 .cse0 .cse1 .cse2 .cse10 .cse4 .cse11) (and .cse8 .cse9 .cse0 .cse1 .cse4 .cse6 .cse11) (and .cse7 .cse13 .cse9 .cse1 .cse3 .cse10 .cse5) (and .cse7 .cse13 .cse9 .cse1 .cse3 .cse10 .cse11) (and .cse8 .cse9 .cse0 .cse10 .cse4 .cse5 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse13 .cse8 .cse9 .cse5 .cse6 .cse12) (and .cse7 .cse9 .cse0 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse6 .cse12) (and .cse8 .cse0 .cse1 .cse2 .cse10 .cse4 .cse5) (and .cse13 .cse9 .cse3 .cse10 .cse4 .cse11 .cse12))) [2020-07-07 13:22:31,544 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-07-07 13:22:31,544 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-07-07 13:22:31,544 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-07-07 13:22:31,545 INFO L264 CegarLoopResult]: At program point L67-1(lines 30 116) the Hoare annotation is: (let ((.cse1 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p3~0)) (.cse9 (= 0 main_~p1~0)) (.cse7 (= 0 main_~p2~0)) (.cse2 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk1~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse4) (and .cse5 .cse7 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse5 .cse7 .cse9 .cse3 .cse8) (and .cse1 .cse7 .cse2 .cse6 .cse4) (and .cse7 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse9 .cse3) (and .cse0 .cse2 .cse6 .cse4 .cse8) (and .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse9 .cse3 .cse8) (and .cse5 .cse7 .cse6 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse6 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse8) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse9 .cse3) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse6 .cse4 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse6 .cse9 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse9 .cse3) (and .cse5 .cse0 .cse6 .cse9 .cse8) (and .cse0 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse9) (and .cse5 .cse0 .cse3 .cse4 .cse8) (and .cse5 .cse7 .cse6 .cse9 .cse8) (and .cse7 .cse2 .cse6 .cse4 .cse8))) [2020-07-07 13:22:31,545 INFO L264 CegarLoopResult]: At program point L92(line 92) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk7~0)) (.cse1 (= 0 main_~p4~0)) (.cse3 (= 0 main_~p5~0)) (.cse4 (= 0 main_~p6~0)) (.cse5 (= 1 main_~lk6~0)) (.cse6 (= 0 main_~p7~0)) (.cse2 (= 1 main_~lk3~0)) (.cse7 (= 1 main_~lk5~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse1 .cse2 .cse7) (and .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse2 .cse4 .cse7 .cse8) (and .cse5 .cse0 .cse2 .cse7 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse6 .cse2 .cse3 .cse8) (and .cse5 .cse0 .cse1 .cse2 .cse3) (and .cse6 .cse1 .cse2 .cse4 .cse7) (and .cse5 .cse6 .cse1 .cse2 .cse3) (and .cse5 .cse0 .cse2 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse7) (and .cse0 .cse2 .cse4 .cse7 .cse8) (and .cse5 .cse0 .cse1 .cse2 .cse7) (and .cse6 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse6 .cse2 .cse7 .cse8))) [2020-07-07 13:22:31,545 INFO L264 CegarLoopResult]: At program point L59-1(lines 30 116) the Hoare annotation is: (let ((.cse5 (= 0 main_~p1~0)) (.cse3 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse4 .cse1 .cse5) (and .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse5) (and .cse3 .cse0 .cse5) (and .cse3 .cse0 .cse2) (and .cse4 .cse1 .cse2))) [2020-07-07 13:22:31,545 INFO L271 CegarLoopResult]: At program point L117(lines 5 121) the Hoare annotation is: true [2020-07-07 13:22:31,545 INFO L271 CegarLoopResult]: At program point L51(lines 51 53) the Hoare annotation is: true [2020-07-07 13:22:31,545 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-07 13:22:31,546 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-07-07 13:22:31,546 INFO L264 CegarLoopResult]: At program point L51-2(lines 30 116) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-07 13:22:31,546 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-07-07 13:22:31,546 INFO L264 CegarLoopResult]: At program point L76(line 76) the Hoare annotation is: (let ((.cse2 (= 0 main_~p5~0)) (.cse11 (= 1 main_~lk6~0)) (.cse6 (= 0 main_~p2~0)) (.cse10 (= 1 main_~lk3~0)) (.cse4 (= 0 main_~p1~0)) (.cse5 (= 1 main_~lk4~0)) (.cse0 (= 0 main_~p3~0)) (.cse1 (= 1 main_~lk2~0)) (.cse9 (= 0 main_~p4~0)) (.cse3 (= 0 main_~p6~0)) (.cse7 (= 1 main_~lk5~0)) (.cse8 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse9 .cse6 .cse3 .cse4 .cse7) (and .cse9 .cse6 .cse10 .cse2 .cse3 .cse8) (and .cse6 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse4 .cse7 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse4 .cse7) (and .cse11 .cse0 .cse9 .cse6 .cse2 .cse4) (and .cse6 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse6 .cse2 .cse4 .cse5) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse4) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse4) (and .cse11 .cse1 .cse10 .cse2 .cse4 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse7 .cse8) (and .cse11 .cse0 .cse6 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse6 .cse7 .cse8 .cse5) (and .cse1 .cse9 .cse10 .cse3 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse6 .cse10 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse7 .cse8 .cse5) (and .cse6 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse1 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse6 .cse2 .cse8 .cse5) (and .cse0 .cse9 .cse6 .cse3 .cse7 .cse8) (and .cse11 .cse0 .cse9 .cse6 .cse7 .cse8) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse4) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse4) (and .cse11 .cse6 .cse10 .cse2 .cse4 .cse5) (and .cse9 .cse6 .cse10 .cse3 .cse4 .cse7) (and .cse11 .cse1 .cse10 .cse4 .cse7 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse11 .cse6 .cse10 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse2 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse7 .cse8) (and .cse9 .cse6 .cse10 .cse3 .cse7 .cse8) (and .cse11 .cse1 .cse10 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse9 .cse4 .cse7) (and .cse11 .cse1 .cse10 .cse2 .cse8 .cse5) (and .cse11 .cse9 .cse6 .cse10 .cse4 .cse7) (and .cse11 .cse0 .cse9 .cse6 .cse4 .cse7) (and .cse11 .cse9 .cse6 .cse10 .cse7 .cse8) (and .cse11 .cse6 .cse10 .cse2 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse8) (and .cse6 .cse10 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse8) (and .cse0 .cse6 .cse3 .cse4 .cse7 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse8) (and .cse0 .cse1 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse9 .cse6 .cse10 .cse2 .cse4) (and .cse11 .cse9 .cse6 .cse10 .cse2 .cse8) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse7) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse8) (and .cse11 .cse0 .cse1 .cse2 .cse8 .cse5) (and .cse1 .cse10 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse11 .cse6 .cse10 .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse3 .cse4 .cse7 .cse5) (and .cse0 .cse1 .cse9 .cse3 .cse7 .cse8))) [2020-07-07 13:22:31,547 INFO L271 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: true [2020-07-07 13:22:31,547 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-07-07 13:22:31,547 INFO L264 CegarLoopResult]: At program point L68(line 68) the Hoare annotation is: (let ((.cse7 (= 0 main_~p2~0)) (.cse4 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p1~0)) (.cse5 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse6 (= 1 main_~lk1~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6) (and .cse7 .cse1 .cse6 .cse3) (and .cse4 .cse0 .cse6 .cse3) (and .cse5 .cse7 .cse1 .cse6) (and .cse4 .cse7 .cse6 .cse3) (and .cse7 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse7 .cse6) (and .cse5 .cse7 .cse1 .cse2) (and .cse4 .cse0 .cse5 .cse2) (and .cse4 .cse5 .cse7 .cse2) (and .cse4 .cse7 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2) (and .cse0 .cse5 .cse1 .cse6) (and .cse0 .cse1 .cse6 .cse3))) [2020-07-07 13:22:31,547 INFO L264 CegarLoopResult]: At program point L101-1(lines 30 116) the Hoare annotation is: (let ((.cse1 (= 1 main_~lk7~0)) (.cse3 (= 0 main_~p6~0)) (.cse0 (= 1 main_~lk6~0)) (.cse2 (= 0 main_~p7~0))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse1 .cse3) (and .cse0 .cse2))) [2020-07-07 13:22:31,547 INFO L271 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: true [2020-07-07 13:22:31,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.07 01:22:31 BoogieIcfgContainer [2020-07-07 13:22:31,561 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-07 13:22:31,563 INFO L168 Benchmark]: Toolchain (without parser) took 20052.67 ms. Allocated memory was 145.2 MB in the beginning and 638.6 MB in the end (delta: 493.4 MB). Free memory was 103.5 MB in the beginning and 208.6 MB in the end (delta: -105.1 MB). Peak memory consumption was 466.3 MB. Max. memory is 7.1 GB. [2020-07-07 13:22:31,564 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 145.2 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-07-07 13:22:31,565 INFO L168 Benchmark]: CACSL2BoogieTranslator took 391.73 ms. Allocated memory is still 145.2 MB. Free memory was 103.3 MB in the beginning and 93.1 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-07 13:22:31,566 INFO L168 Benchmark]: Boogie Preprocessor took 135.98 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 93.1 MB in the beginning and 180.1 MB in the end (delta: -87.1 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-07 13:22:31,566 INFO L168 Benchmark]: RCFGBuilder took 403.81 ms. Allocated memory is still 202.4 MB. Free memory was 180.1 MB in the beginning and 160.0 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 7.1 GB. [2020-07-07 13:22:31,567 INFO L168 Benchmark]: TraceAbstraction took 19115.89 ms. Allocated memory was 202.4 MB in the beginning and 638.6 MB in the end (delta: 436.2 MB). Free memory was 159.4 MB in the beginning and 208.6 MB in the end (delta: -49.3 MB). Peak memory consumption was 465.0 MB. Max. memory is 7.1 GB. [2020-07-07 13:22:31,570 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.30 ms. Allocated memory is still 145.2 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 391.73 ms. Allocated memory is still 145.2 MB. Free memory was 103.3 MB in the beginning and 93.1 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.98 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 93.1 MB in the beginning and 180.1 MB in the end (delta: -87.1 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 403.81 ms. Allocated memory is still 202.4 MB. Free memory was 180.1 MB in the beginning and 160.0 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19115.89 ms. Allocated memory was 202.4 MB in the beginning and 638.6 MB in the end (delta: 436.2 MB). Free memory was 159.4 MB in the beginning and 208.6 MB in the end (delta: -49.3 MB). Peak memory consumption was 465.0 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.1s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 14.8s, 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.1s 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, 2.7s HoareSimplificationTime, 88 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 12.0s 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...