./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/locks/test_locks_10.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c861265e1e1e27fe23877e47c41012b82996e1c7e91f362716a115cbf38b786b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:26:55,627 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:26:55,708 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-19 14:26:55,712 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:26:55,712 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:26:55,747 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:26:55,748 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:26:55,748 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:26:55,749 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:26:55,749 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:26:55,750 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:26:55,750 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:26:55,751 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:26:55,751 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:26:55,751 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:26:55,752 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:26:55,752 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:26:55,752 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:26:55,752 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:26:55,753 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:26:55,753 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:26:55,753 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 14:26:55,754 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:26:55,754 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 14:26:55,754 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:26:55,754 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:26:55,754 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:26:55,755 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:26:55,755 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:26:55,755 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:26:55,755 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 14:26:55,756 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:26:55,756 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:26:55,756 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:26:55,756 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:26:55,756 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:26:55,757 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:26:55,757 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:26:55,760 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:26:55,761 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c861265e1e1e27fe23877e47c41012b82996e1c7e91f362716a115cbf38b786b [2024-11-19 14:26:55,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:26:56,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:26:56,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:26:56,024 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:26:56,025 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:26:56,026 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_10.c [2024-11-19 14:26:57,438 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:26:57,631 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:26:57,632 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_10.c [2024-11-19 14:26:57,640 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72adda4e3/9538f9c96939433ba0dc17b0a27bce35/FLAG5601950c9 [2024-11-19 14:26:58,009 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72adda4e3/9538f9c96939433ba0dc17b0a27bce35 [2024-11-19 14:26:58,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:26:58,013 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:26:58,014 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:26:58,015 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:26:58,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:26:58,022 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:26:58" (1/1) ... [2024-11-19 14:26:58,024 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ba4f78e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:26:58, skipping insertion in model container [2024-11-19 14:26:58,025 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:26:58" (1/1) ... [2024-11-19 14:26:58,052 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:26:58,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:26:58,242 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:26:58,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:26:58,278 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:26:58,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:26:58 WrapperNode [2024-11-19 14:26:58,278 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:26:58,279 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:26:58,279 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:26:58,279 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:26:58,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:26:58" (1/1) ... [2024-11-19 14:26:58,294 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:26:58" (1/1) ... [2024-11-19 14:26:58,311 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 138 [2024-11-19 14:26:58,312 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:26:58,312 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:26:58,312 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:26:58,313 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:26:58,321 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:26:58" (1/1) ... [2024-11-19 14:26:58,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:26:58" (1/1) ... [2024-11-19 14:26:58,323 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:26:58" (1/1) ... [2024-11-19 14:26:58,334 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 14:26:58,334 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:26:58" (1/1) ... [2024-11-19 14:26:58,335 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:26:58" (1/1) ... [2024-11-19 14:26:58,338 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:26:58" (1/1) ... [2024-11-19 14:26:58,346 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:26:58" (1/1) ... [2024-11-19 14:26:58,347 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:26:58" (1/1) ... [2024-11-19 14:26:58,348 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:26:58" (1/1) ... [2024-11-19 14:26:58,350 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:26:58,351 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:26:58,352 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:26:58,352 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:26:58,352 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:26:58" (1/1) ... [2024-11-19 14:26:58,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:26:58,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:26:58,380 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:26:58,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-19 14:26:58,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 14:26:58,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:26:58,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:26:58,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 14:26:58,513 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:26:58,515 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:26:58,687 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-19 14:26:58,687 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:26:58,703 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:26:58,703 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 14:26:58,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:26:58 BoogieIcfgContainer [2024-11-19 14:26:58,704 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:26:58,705 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:26:58,705 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:26:58,710 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:26:58,710 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:26:58,711 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:26:58" (1/3) ... [2024-11-19 14:26:58,711 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7455fc9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:26:58, skipping insertion in model container [2024-11-19 14:26:58,712 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:26:58,713 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:26:58" (2/3) ... [2024-11-19 14:26:58,713 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7455fc9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:26:58, skipping insertion in model container [2024-11-19 14:26:58,713 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:26:58,714 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:26:58" (3/3) ... [2024-11-19 14:26:58,715 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_10.c [2024-11-19 14:26:58,772 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:26:58,773 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:26:58,773 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:26:58,773 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:26:58,773 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:26:58,773 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:26:58,773 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:26:58,773 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:26:58,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 40 states, 39 states have (on average 1.8461538461538463) internal successors, (72), 39 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:26:58,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2024-11-19 14:26:58,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:26:58,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:26:58,794 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:26:58,794 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:26:58,795 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:26:58,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 40 states, 39 states have (on average 1.8461538461538463) internal successors, (72), 39 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:26:58,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2024-11-19 14:26:58,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:26:58,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:26:58,798 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:26:58,798 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:26:58,804 INFO L745 eck$LassoCheckResult]: Stem: 38#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 28#L155-1true [2024-11-19 14:26:58,805 INFO L747 eck$LassoCheckResult]: Loop: 28#L155-1true assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 25#L43true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 29#L68true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 9#L68-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 3#L72-1true assume !(0 != main_~p3~0#1); 19#L76-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 18#L80-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 30#L84-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 20#L88-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 6#L92-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4#L96-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 7#L100-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 39#L104-1true assume !(0 != main_~p1~0#1); 23#L110-1true assume !(0 != main_~p2~0#1); 33#L115-1true assume !(0 != main_~p3~0#1); 17#L120-1true assume !(0 != main_~p4~0#1); 27#L125-1true assume !(0 != main_~p5~0#1); 36#L130-1true assume !(0 != main_~p6~0#1); 15#L135-1true assume !(0 != main_~p7~0#1); 13#L140-1true assume !(0 != main_~p8~0#1); 40#L145-1true assume !(0 != main_~p9~0#1); 10#L150-1true assume !(0 != main_~p10~0#1); 28#L155-1true [2024-11-19 14:26:58,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:26:58,810 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-19 14:26:58,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:26:58,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331914861] [2024-11-19 14:26:58,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:26:58,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:26:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:26:58,893 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:26:58,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:26:58,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:26:58,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:26:58,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1693159719, now seen corresponding path program 1 times [2024-11-19 14:26:58,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:26:58,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76125867] [2024-11-19 14:26:58,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:26:58,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:26:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:26:59,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:26:59,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:26:59,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76125867] [2024-11-19 14:26:59,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76125867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:26:59,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:26:59,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:26:59,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744752569] [2024-11-19 14:26:59,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:26:59,044 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:26:59,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:26:59,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:26:59,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:26:59,089 INFO L87 Difference]: Start difference. First operand has 40 states, 39 states have (on average 1.8461538461538463) internal successors, (72), 39 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:26:59,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:26:59,132 INFO L93 Difference]: Finished difference Result 73 states and 129 transitions. [2024-11-19 14:26:59,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 129 transitions. [2024-11-19 14:26:59,137 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 63 [2024-11-19 14:26:59,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 65 states and 103 transitions. [2024-11-19 14:26:59,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2024-11-19 14:26:59,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2024-11-19 14:26:59,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 103 transitions. [2024-11-19 14:26:59,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:26:59,145 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 103 transitions. [2024-11-19 14:26:59,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 103 transitions. [2024-11-19 14:26:59,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-19 14:26:59,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.5846153846153845) internal successors, (103), 64 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:26:59,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 103 transitions. [2024-11-19 14:26:59,176 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 103 transitions. [2024-11-19 14:26:59,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:26:59,180 INFO L425 stractBuchiCegarLoop]: Abstraction has 65 states and 103 transitions. [2024-11-19 14:26:59,180 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:26:59,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 103 transitions. [2024-11-19 14:26:59,182 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 63 [2024-11-19 14:26:59,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:26:59,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:26:59,183 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:26:59,183 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:26:59,183 INFO L745 eck$LassoCheckResult]: Stem: 159#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 130#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 131#L155-1 [2024-11-19 14:26:59,184 INFO L747 eck$LassoCheckResult]: Loop: 131#L155-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 170#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 169#L68 assume !(0 != main_~p1~0#1); 168#L68-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 167#L72-1 assume !(0 != main_~p3~0#1); 166#L76-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 165#L80-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 164#L84-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 147#L88-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 128#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 124#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 125#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 129#L104-1 assume !(0 != main_~p1~0#1); 150#L110-1 assume !(0 != main_~p2~0#1); 151#L115-1 assume !(0 != main_~p3~0#1); 144#L120-1 assume !(0 != main_~p4~0#1); 127#L125-1 assume !(0 != main_~p5~0#1); 137#L130-1 assume !(0 != main_~p6~0#1); 143#L135-1 assume !(0 != main_~p7~0#1); 142#L140-1 assume !(0 != main_~p8~0#1); 174#L145-1 assume !(0 != main_~p9~0#1); 172#L150-1 assume !(0 != main_~p10~0#1); 131#L155-1 [2024-11-19 14:26:59,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:26:59,185 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-19 14:26:59,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:26:59,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457778179] [2024-11-19 14:26:59,186 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:26:59,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:26:59,194 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:26:59,194 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:26:59,196 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:26:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:26:59,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:26:59,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:26:59,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1784159127, now seen corresponding path program 1 times [2024-11-19 14:26:59,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:26:59,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476731671] [2024-11-19 14:26:59,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:26:59,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:26:59,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:26:59,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:26:59,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:26:59,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476731671] [2024-11-19 14:26:59,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476731671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:26:59,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:26:59,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:26:59,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406639357] [2024-11-19 14:26:59,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:26:59,269 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:26:59,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:26:59,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:26:59,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:26:59,270 INFO L87 Difference]: Start difference. First operand 65 states and 103 transitions. cyclomatic complexity: 40 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:26:59,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:26:59,298 INFO L93 Difference]: Finished difference Result 126 states and 198 transitions. [2024-11-19 14:26:59,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 198 transitions. [2024-11-19 14:26:59,300 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 124 [2024-11-19 14:26:59,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 198 transitions. [2024-11-19 14:26:59,304 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2024-11-19 14:26:59,304 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2024-11-19 14:26:59,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 198 transitions. [2024-11-19 14:26:59,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:26:59,305 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 198 transitions. [2024-11-19 14:26:59,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 198 transitions. [2024-11-19 14:26:59,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-19 14:26:59,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.5714285714285714) internal successors, (198), 125 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:26:59,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 198 transitions. [2024-11-19 14:26:59,314 INFO L240 hiAutomatonCegarLoop]: Abstraction has 126 states and 198 transitions. [2024-11-19 14:26:59,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:26:59,315 INFO L425 stractBuchiCegarLoop]: Abstraction has 126 states and 198 transitions. [2024-11-19 14:26:59,316 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:26:59,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 198 transitions. [2024-11-19 14:26:59,318 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 124 [2024-11-19 14:26:59,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:26:59,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:26:59,318 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:26:59,319 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:26:59,319 INFO L745 eck$LassoCheckResult]: Stem: 359#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 327#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 328#L155-1 [2024-11-19 14:26:59,319 INFO L747 eck$LassoCheckResult]: Loop: 328#L155-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 388#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 386#L68 assume !(0 != main_~p1~0#1); 384#L68-2 assume !(0 != main_~p2~0#1); 382#L72-1 assume !(0 != main_~p3~0#1); 380#L76-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 378#L80-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 376#L84-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 374#L88-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 372#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 370#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 368#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 366#L104-1 assume !(0 != main_~p1~0#1); 362#L110-1 assume !(0 != main_~p2~0#1); 363#L115-1 assume !(0 != main_~p3~0#1); 419#L120-1 assume !(0 != main_~p4~0#1); 415#L125-1 assume !(0 != main_~p5~0#1); 411#L130-1 assume !(0 != main_~p6~0#1); 405#L135-1 assume !(0 != main_~p7~0#1); 401#L140-1 assume !(0 != main_~p8~0#1); 397#L145-1 assume !(0 != main_~p9~0#1); 393#L150-1 assume !(0 != main_~p10~0#1); 328#L155-1 [2024-11-19 14:26:59,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:26:59,320 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-19 14:26:59,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:26:59,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426546588] [2024-11-19 14:26:59,321 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:26:59,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:26:59,330 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:26:59,334 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:26:59,334 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:26:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:26:59,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:26:59,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:26:59,344 INFO L85 PathProgramCache]: Analyzing trace with hash 95215385, now seen corresponding path program 1 times [2024-11-19 14:26:59,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:26:59,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974527672] [2024-11-19 14:26:59,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:26:59,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:26:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:26:59,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:26:59,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:26:59,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974527672] [2024-11-19 14:26:59,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974527672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:26:59,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:26:59,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:26:59,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668855395] [2024-11-19 14:26:59,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:26:59,398 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:26:59,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:26:59,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:26:59,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:26:59,401 INFO L87 Difference]: Start difference. First operand 126 states and 198 transitions. cyclomatic complexity: 76 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:26:59,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:26:59,430 INFO L93 Difference]: Finished difference Result 246 states and 382 transitions. [2024-11-19 14:26:59,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 246 states and 382 transitions. [2024-11-19 14:26:59,434 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 244 [2024-11-19 14:26:59,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 246 states to 246 states and 382 transitions. [2024-11-19 14:26:59,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 246 [2024-11-19 14:26:59,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 246 [2024-11-19 14:26:59,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 246 states and 382 transitions. [2024-11-19 14:26:59,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:26:59,441 INFO L218 hiAutomatonCegarLoop]: Abstraction has 246 states and 382 transitions. [2024-11-19 14:26:59,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states and 382 transitions. [2024-11-19 14:26:59,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2024-11-19 14:26:59,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 246 states have (on average 1.5528455284552845) internal successors, (382), 245 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:26:59,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 382 transitions. [2024-11-19 14:26:59,472 INFO L240 hiAutomatonCegarLoop]: Abstraction has 246 states and 382 transitions. [2024-11-19 14:26:59,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:26:59,474 INFO L425 stractBuchiCegarLoop]: Abstraction has 246 states and 382 transitions. [2024-11-19 14:26:59,474 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:26:59,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 246 states and 382 transitions. [2024-11-19 14:26:59,476 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 244 [2024-11-19 14:26:59,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:26:59,476 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:26:59,479 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:26:59,479 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:26:59,480 INFO L745 eck$LassoCheckResult]: Stem: 739#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 706#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 707#L155-1 [2024-11-19 14:26:59,480 INFO L747 eck$LassoCheckResult]: Loop: 707#L155-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 794#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 790#L68 assume !(0 != main_~p1~0#1); 785#L68-2 assume !(0 != main_~p2~0#1); 779#L72-1 assume !(0 != main_~p3~0#1); 775#L76-1 assume !(0 != main_~p4~0#1); 768#L80-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 769#L84-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 761#L88-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 762#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 754#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 751#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 747#L104-1 assume !(0 != main_~p1~0#1); 748#L110-1 assume !(0 != main_~p2~0#1); 853#L115-1 assume !(0 != main_~p3~0#1); 851#L120-1 assume !(0 != main_~p4~0#1); 849#L125-1 assume !(0 != main_~p5~0#1); 845#L130-1 assume !(0 != main_~p6~0#1); 841#L135-1 assume !(0 != main_~p7~0#1); 837#L140-1 assume !(0 != main_~p8~0#1); 833#L145-1 assume !(0 != main_~p9~0#1); 829#L150-1 assume !(0 != main_~p10~0#1); 707#L155-1 [2024-11-19 14:26:59,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:26:59,481 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-11-19 14:26:59,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:26:59,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016321330] [2024-11-19 14:26:59,481 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:26:59,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:26:59,487 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:26:59,489 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:26:59,490 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:26:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:26:59,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:26:59,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:26:59,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1493132517, now seen corresponding path program 1 times [2024-11-19 14:26:59,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:26:59,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784373608] [2024-11-19 14:26:59,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:26:59,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:26:59,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:26:59,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:26:59,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:26:59,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784373608] [2024-11-19 14:26:59,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784373608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:26:59,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:26:59,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:26:59,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330052771] [2024-11-19 14:26:59,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:26:59,537 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:26:59,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:26:59,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:26:59,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:26:59,540 INFO L87 Difference]: Start difference. First operand 246 states and 382 transitions. cyclomatic complexity: 144 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:26:59,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:26:59,573 INFO L93 Difference]: Finished difference Result 482 states and 738 transitions. [2024-11-19 14:26:59,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 482 states and 738 transitions. [2024-11-19 14:26:59,578 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 480 [2024-11-19 14:26:59,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 482 states to 482 states and 738 transitions. [2024-11-19 14:26:59,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 482 [2024-11-19 14:26:59,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 482 [2024-11-19 14:26:59,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 482 states and 738 transitions. [2024-11-19 14:26:59,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:26:59,591 INFO L218 hiAutomatonCegarLoop]: Abstraction has 482 states and 738 transitions. [2024-11-19 14:26:59,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states and 738 transitions. [2024-11-19 14:26:59,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2024-11-19 14:26:59,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 482 states have (on average 1.5311203319502074) internal successors, (738), 481 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:26:59,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 738 transitions. [2024-11-19 14:26:59,614 INFO L240 hiAutomatonCegarLoop]: Abstraction has 482 states and 738 transitions. [2024-11-19 14:26:59,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:26:59,616 INFO L425 stractBuchiCegarLoop]: Abstraction has 482 states and 738 transitions. [2024-11-19 14:26:59,616 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 14:26:59,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 482 states and 738 transitions. [2024-11-19 14:26:59,619 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 480 [2024-11-19 14:26:59,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:26:59,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:26:59,619 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:26:59,620 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:26:59,620 INFO L745 eck$LassoCheckResult]: Stem: 1472#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 1440#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 1441#L155-1 [2024-11-19 14:26:59,620 INFO L747 eck$LassoCheckResult]: Loop: 1441#L155-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 1524#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 1519#L68 assume !(0 != main_~p1~0#1); 1511#L68-2 assume !(0 != main_~p2~0#1); 1504#L72-1 assume !(0 != main_~p3~0#1); 1500#L76-1 assume !(0 != main_~p4~0#1); 1493#L80-1 assume !(0 != main_~p5~0#1); 1494#L84-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1606#L88-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1604#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1602#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1600#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1596#L104-1 assume !(0 != main_~p1~0#1); 1584#L110-1 assume !(0 != main_~p2~0#1); 1583#L115-1 assume !(0 != main_~p3~0#1); 1577#L120-1 assume !(0 != main_~p4~0#1); 1573#L125-1 assume !(0 != main_~p5~0#1); 1571#L130-1 assume !(0 != main_~p6~0#1); 1567#L135-1 assume !(0 != main_~p7~0#1); 1563#L140-1 assume !(0 != main_~p8~0#1); 1559#L145-1 assume !(0 != main_~p9~0#1); 1555#L150-1 assume !(0 != main_~p10~0#1); 1441#L155-1 [2024-11-19 14:26:59,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:26:59,621 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-11-19 14:26:59,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:26:59,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211788106] [2024-11-19 14:26:59,621 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:26:59,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:26:59,627 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:26:59,628 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:26:59,628 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:26:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:26:59,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:26:59,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:26:59,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1780766425, now seen corresponding path program 1 times [2024-11-19 14:26:59,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:26:59,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429359945] [2024-11-19 14:26:59,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:26:59,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:26:59,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:26:59,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:26:59,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:26:59,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429359945] [2024-11-19 14:26:59,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429359945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:26:59,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:26:59,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:26:59,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635837399] [2024-11-19 14:26:59,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:26:59,673 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:26:59,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:26:59,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:26:59,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:26:59,674 INFO L87 Difference]: Start difference. First operand 482 states and 738 transitions. cyclomatic complexity: 272 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:26:59,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:26:59,695 INFO L93 Difference]: Finished difference Result 946 states and 1426 transitions. [2024-11-19 14:26:59,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 946 states and 1426 transitions. [2024-11-19 14:26:59,704 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 944 [2024-11-19 14:26:59,710 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 946 states to 946 states and 1426 transitions. [2024-11-19 14:26:59,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 946 [2024-11-19 14:26:59,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 946 [2024-11-19 14:26:59,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 946 states and 1426 transitions. [2024-11-19 14:26:59,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:26:59,713 INFO L218 hiAutomatonCegarLoop]: Abstraction has 946 states and 1426 transitions. [2024-11-19 14:26:59,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states and 1426 transitions. [2024-11-19 14:26:59,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 946. [2024-11-19 14:26:59,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 946 states have (on average 1.507399577167019) internal successors, (1426), 945 states have internal predecessors, (1426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:26:59,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1426 transitions. [2024-11-19 14:26:59,759 INFO L240 hiAutomatonCegarLoop]: Abstraction has 946 states and 1426 transitions. [2024-11-19 14:26:59,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:26:59,760 INFO L425 stractBuchiCegarLoop]: Abstraction has 946 states and 1426 transitions. [2024-11-19 14:26:59,761 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 14:26:59,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 946 states and 1426 transitions. [2024-11-19 14:26:59,766 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 944 [2024-11-19 14:26:59,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:26:59,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:26:59,766 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:26:59,767 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:26:59,767 INFO L745 eck$LassoCheckResult]: Stem: 2910#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 2873#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 2874#L155-1 [2024-11-19 14:26:59,767 INFO L747 eck$LassoCheckResult]: Loop: 2874#L155-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 3066#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 3064#L68 assume !(0 != main_~p1~0#1); 3062#L68-2 assume !(0 != main_~p2~0#1); 3061#L72-1 assume !(0 != main_~p3~0#1); 3060#L76-1 assume !(0 != main_~p4~0#1); 3058#L80-1 assume !(0 != main_~p5~0#1); 3056#L84-1 assume !(0 != main_~p6~0#1); 3050#L88-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 3051#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 3043#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 3044#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 3030#L104-1 assume !(0 != main_~p1~0#1); 3031#L110-1 assume !(0 != main_~p2~0#1); 3018#L115-1 assume !(0 != main_~p3~0#1); 3017#L120-1 assume !(0 != main_~p4~0#1); 3002#L125-1 assume !(0 != main_~p5~0#1); 3003#L130-1 assume !(0 != main_~p6~0#1); 3074#L135-1 assume !(0 != main_~p7~0#1); 3072#L140-1 assume !(0 != main_~p8~0#1); 3070#L145-1 assume !(0 != main_~p9~0#1); 3068#L150-1 assume !(0 != main_~p10~0#1); 2874#L155-1 [2024-11-19 14:26:59,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:26:59,768 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2024-11-19 14:26:59,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:26:59,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740589310] [2024-11-19 14:26:59,769 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:26:59,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:26:59,774 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-19 14:26:59,775 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:26:59,775 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:26:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:26:59,780 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:26:59,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:26:59,781 INFO L85 PathProgramCache]: Analyzing trace with hash 500902747, now seen corresponding path program 1 times [2024-11-19 14:26:59,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:26:59,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155715727] [2024-11-19 14:26:59,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:26:59,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:26:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:26:59,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:26:59,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:26:59,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155715727] [2024-11-19 14:26:59,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155715727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:26:59,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:26:59,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:26:59,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871650043] [2024-11-19 14:26:59,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:26:59,815 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:26:59,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:26:59,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:26:59,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:26:59,816 INFO L87 Difference]: Start difference. First operand 946 states and 1426 transitions. cyclomatic complexity: 512 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:26:59,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:26:59,839 INFO L93 Difference]: Finished difference Result 1858 states and 2754 transitions. [2024-11-19 14:26:59,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1858 states and 2754 transitions. [2024-11-19 14:26:59,860 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1856 [2024-11-19 14:26:59,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1858 states to 1858 states and 2754 transitions. [2024-11-19 14:26:59,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1858 [2024-11-19 14:26:59,872 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1858 [2024-11-19 14:26:59,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1858 states and 2754 transitions. [2024-11-19 14:26:59,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:26:59,875 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1858 states and 2754 transitions. [2024-11-19 14:26:59,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states and 2754 transitions. [2024-11-19 14:26:59,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1858. [2024-11-19 14:26:59,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1858 states have (on average 1.4822389666307858) internal successors, (2754), 1857 states have internal predecessors, (2754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:26:59,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2754 transitions. [2024-11-19 14:26:59,912 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1858 states and 2754 transitions. [2024-11-19 14:26:59,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:26:59,915 INFO L425 stractBuchiCegarLoop]: Abstraction has 1858 states and 2754 transitions. [2024-11-19 14:26:59,915 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-19 14:26:59,915 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1858 states and 2754 transitions. [2024-11-19 14:26:59,925 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1856 [2024-11-19 14:26:59,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:26:59,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:26:59,926 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:26:59,926 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:26:59,927 INFO L745 eck$LassoCheckResult]: Stem: 5722#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 5683#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 5684#L155-1 [2024-11-19 14:26:59,927 INFO L747 eck$LassoCheckResult]: Loop: 5684#L155-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 5881#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 5878#L68 assume !(0 != main_~p1~0#1); 5874#L68-2 assume !(0 != main_~p2~0#1); 5871#L72-1 assume !(0 != main_~p3~0#1); 5869#L76-1 assume !(0 != main_~p4~0#1); 5861#L80-1 assume !(0 != main_~p5~0#1); 5863#L84-1 assume !(0 != main_~p6~0#1); 5850#L88-1 assume !(0 != main_~p7~0#1); 5852#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 5840#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 5841#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 5827#L104-1 assume !(0 != main_~p1~0#1); 5828#L110-1 assume !(0 != main_~p2~0#1); 5804#L115-1 assume !(0 != main_~p3~0#1); 5803#L120-1 assume !(0 != main_~p4~0#1); 5899#L125-1 assume !(0 != main_~p5~0#1); 5897#L130-1 assume !(0 != main_~p6~0#1); 5895#L135-1 assume !(0 != main_~p7~0#1); 5894#L140-1 assume !(0 != main_~p8~0#1); 5890#L145-1 assume !(0 != main_~p9~0#1); 5886#L150-1 assume !(0 != main_~p10~0#1); 5684#L155-1 [2024-11-19 14:26:59,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:26:59,927 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2024-11-19 14:26:59,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:26:59,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993095740] [2024-11-19 14:26:59,928 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:26:59,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:26:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:26:59,936 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:26:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:26:59,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:26:59,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:26:59,943 INFO L85 PathProgramCache]: Analyzing trace with hash -510214503, now seen corresponding path program 1 times [2024-11-19 14:26:59,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:26:59,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334716015] [2024-11-19 14:26:59,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:26:59,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:26:59,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:26:59,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:26:59,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:26:59,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334716015] [2024-11-19 14:26:59,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334716015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:26:59,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:26:59,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:26:59,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162881847] [2024-11-19 14:26:59,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:26:59,988 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:26:59,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:26:59,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:26:59,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:26:59,989 INFO L87 Difference]: Start difference. First operand 1858 states and 2754 transitions. cyclomatic complexity: 960 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:00,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:00,016 INFO L93 Difference]: Finished difference Result 3650 states and 5314 transitions. [2024-11-19 14:27:00,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3650 states and 5314 transitions. [2024-11-19 14:27:00,045 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3648 [2024-11-19 14:27:00,064 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3650 states to 3650 states and 5314 transitions. [2024-11-19 14:27:00,064 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3650 [2024-11-19 14:27:00,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3650 [2024-11-19 14:27:00,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3650 states and 5314 transitions. [2024-11-19 14:27:00,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:00,073 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3650 states and 5314 transitions. [2024-11-19 14:27:00,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3650 states and 5314 transitions. [2024-11-19 14:27:00,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3650 to 3650. [2024-11-19 14:27:00,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3650 states, 3650 states have (on average 1.4558904109589041) internal successors, (5314), 3649 states have internal predecessors, (5314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:00,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3650 states to 3650 states and 5314 transitions. [2024-11-19 14:27:00,143 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3650 states and 5314 transitions. [2024-11-19 14:27:00,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:00,145 INFO L425 stractBuchiCegarLoop]: Abstraction has 3650 states and 5314 transitions. [2024-11-19 14:27:00,145 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-19 14:27:00,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3650 states and 5314 transitions. [2024-11-19 14:27:00,166 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3648 [2024-11-19 14:27:00,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:00,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:00,168 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:00,169 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:00,169 INFO L745 eck$LassoCheckResult]: Stem: 11234#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 11198#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 11199#L155-1 [2024-11-19 14:27:00,169 INFO L747 eck$LassoCheckResult]: Loop: 11199#L155-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 11423#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 11420#L68 assume !(0 != main_~p1~0#1); 11416#L68-2 assume !(0 != main_~p2~0#1); 11413#L72-1 assume !(0 != main_~p3~0#1); 11411#L76-1 assume !(0 != main_~p4~0#1); 11401#L80-1 assume !(0 != main_~p5~0#1); 11403#L84-1 assume !(0 != main_~p6~0#1); 11386#L88-1 assume !(0 != main_~p7~0#1); 11388#L92-1 assume !(0 != main_~p8~0#1); 11370#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 11371#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 11349#L104-1 assume !(0 != main_~p1~0#1); 11350#L110-1 assume !(0 != main_~p2~0#1); 11325#L115-1 assume !(0 != main_~p3~0#1); 11324#L120-1 assume !(0 != main_~p4~0#1); 11441#L125-1 assume !(0 != main_~p5~0#1); 11439#L130-1 assume !(0 != main_~p6~0#1); 11437#L135-1 assume !(0 != main_~p7~0#1); 11435#L140-1 assume !(0 != main_~p8~0#1); 11432#L145-1 assume !(0 != main_~p9~0#1); 11428#L150-1 assume !(0 != main_~p10~0#1); 11199#L155-1 [2024-11-19 14:27:00,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:00,170 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2024-11-19 14:27:00,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:00,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774949715] [2024-11-19 14:27:00,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:27:00,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:00,177 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:27:00,178 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:00,178 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:00,184 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:00,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:00,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1097020517, now seen corresponding path program 1 times [2024-11-19 14:27:00,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:00,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610060968] [2024-11-19 14:27:00,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:00,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:00,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:00,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:27:00,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:00,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610060968] [2024-11-19 14:27:00,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610060968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:00,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:00,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:27:00,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802215] [2024-11-19 14:27:00,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:00,245 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:00,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:00,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:00,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:00,246 INFO L87 Difference]: Start difference. First operand 3650 states and 5314 transitions. cyclomatic complexity: 1792 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:00,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:00,293 INFO L93 Difference]: Finished difference Result 7170 states and 10242 transitions. [2024-11-19 14:27:00,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7170 states and 10242 transitions. [2024-11-19 14:27:00,350 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7168 [2024-11-19 14:27:00,385 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7170 states to 7170 states and 10242 transitions. [2024-11-19 14:27:00,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7170 [2024-11-19 14:27:00,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7170 [2024-11-19 14:27:00,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7170 states and 10242 transitions. [2024-11-19 14:27:00,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:00,403 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7170 states and 10242 transitions. [2024-11-19 14:27:00,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7170 states and 10242 transitions. [2024-11-19 14:27:00,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7170 to 7170. [2024-11-19 14:27:00,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7170 states, 7170 states have (on average 1.4284518828451882) internal successors, (10242), 7169 states have internal predecessors, (10242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:00,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7170 states to 7170 states and 10242 transitions. [2024-11-19 14:27:00,537 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7170 states and 10242 transitions. [2024-11-19 14:27:00,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:00,540 INFO L425 stractBuchiCegarLoop]: Abstraction has 7170 states and 10242 transitions. [2024-11-19 14:27:00,541 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-19 14:27:00,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7170 states and 10242 transitions. [2024-11-19 14:27:00,568 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7168 [2024-11-19 14:27:00,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:00,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:00,569 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:00,569 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:00,569 INFO L745 eck$LassoCheckResult]: Stem: 22058#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 22023#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 22024#L155-1 [2024-11-19 14:27:00,570 INFO L747 eck$LassoCheckResult]: Loop: 22024#L155-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 22197#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 22193#L68 assume !(0 != main_~p1~0#1); 22189#L68-2 assume !(0 != main_~p2~0#1); 22186#L72-1 assume !(0 != main_~p3~0#1); 22182#L76-1 assume !(0 != main_~p4~0#1); 22116#L80-1 assume !(0 != main_~p5~0#1); 22117#L84-1 assume !(0 != main_~p6~0#1); 22316#L88-1 assume !(0 != main_~p7~0#1); 22332#L92-1 assume !(0 != main_~p8~0#1); 22324#L96-1 assume !(0 != main_~p9~0#1); 22289#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 22286#L104-1 assume !(0 != main_~p1~0#1); 22284#L110-1 assume !(0 != main_~p2~0#1); 22281#L115-1 assume !(0 != main_~p3~0#1); 22278#L120-1 assume !(0 != main_~p4~0#1); 22257#L125-1 assume !(0 != main_~p5~0#1); 22258#L130-1 assume !(0 != main_~p6~0#1); 22272#L135-1 assume !(0 != main_~p7~0#1); 22232#L140-1 assume !(0 != main_~p8~0#1); 22230#L145-1 assume !(0 != main_~p9~0#1); 22202#L150-1 assume !(0 != main_~p10~0#1); 22024#L155-1 [2024-11-19 14:27:00,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:00,571 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2024-11-19 14:27:00,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:00,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785817856] [2024-11-19 14:27:00,571 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:27:00,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:00,577 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:27:00,577 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:00,577 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:00,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:00,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:00,583 INFO L85 PathProgramCache]: Analyzing trace with hash -838855079, now seen corresponding path program 1 times [2024-11-19 14:27:00,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:00,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642752917] [2024-11-19 14:27:00,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:00,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:00,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:27:00,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:00,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642752917] [2024-11-19 14:27:00,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642752917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:00,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:00,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 14:27:00,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53965985] [2024-11-19 14:27:00,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:00,671 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:00,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:00,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:00,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:00,672 INFO L87 Difference]: Start difference. First operand 7170 states and 10242 transitions. cyclomatic complexity: 3328 Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:00,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:00,748 INFO L93 Difference]: Finished difference Result 14082 states and 19714 transitions. [2024-11-19 14:27:00,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14082 states and 19714 transitions. [2024-11-19 14:27:00,836 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14080 [2024-11-19 14:27:00,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14082 states to 14082 states and 19714 transitions. [2024-11-19 14:27:00,920 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14082 [2024-11-19 14:27:00,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14082 [2024-11-19 14:27:00,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14082 states and 19714 transitions. [2024-11-19 14:27:00,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:00,954 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14082 states and 19714 transitions. [2024-11-19 14:27:00,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14082 states and 19714 transitions. [2024-11-19 14:27:01,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14082 to 14082. [2024-11-19 14:27:01,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14082 states, 14082 states have (on average 1.3999431898878) internal successors, (19714), 14081 states have internal predecessors, (19714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:01,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14082 states to 14082 states and 19714 transitions. [2024-11-19 14:27:01,376 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14082 states and 19714 transitions. [2024-11-19 14:27:01,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:01,380 INFO L425 stractBuchiCegarLoop]: Abstraction has 14082 states and 19714 transitions. [2024-11-19 14:27:01,380 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-19 14:27:01,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14082 states and 19714 transitions. [2024-11-19 14:27:01,432 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14080 [2024-11-19 14:27:01,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:01,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:01,434 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:01,434 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:01,434 INFO L745 eck$LassoCheckResult]: Stem: 43314#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 43281#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 43282#L155-1 [2024-11-19 14:27:01,434 INFO L747 eck$LassoCheckResult]: Loop: 43282#L155-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 43404#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 43402#L68 assume !(0 != main_~p1~0#1); 43398#L68-2 assume !(0 != main_~p2~0#1); 43396#L72-1 assume !(0 != main_~p3~0#1); 43392#L76-1 assume !(0 != main_~p4~0#1); 43388#L80-1 assume !(0 != main_~p5~0#1); 43384#L84-1 assume !(0 != main_~p6~0#1); 43380#L88-1 assume !(0 != main_~p7~0#1); 43376#L92-1 assume !(0 != main_~p8~0#1); 43372#L96-1 assume !(0 != main_~p9~0#1); 43368#L100-1 assume !(0 != main_~p10~0#1); 43365#L104-1 assume !(0 != main_~p1~0#1); 43366#L110-1 assume !(0 != main_~p2~0#1); 43436#L115-1 assume !(0 != main_~p3~0#1); 43431#L120-1 assume !(0 != main_~p4~0#1); 43427#L125-1 assume !(0 != main_~p5~0#1); 43423#L130-1 assume !(0 != main_~p6~0#1); 43419#L135-1 assume !(0 != main_~p7~0#1); 43415#L140-1 assume !(0 != main_~p8~0#1); 43411#L145-1 assume !(0 != main_~p9~0#1); 43407#L150-1 assume !(0 != main_~p10~0#1); 43282#L155-1 [2024-11-19 14:27:01,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:01,435 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2024-11-19 14:27:01,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:01,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836626559] [2024-11-19 14:27:01,436 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:27:01,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:01,441 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:27:01,443 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:01,443 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:01,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:01,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:01,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:01,452 INFO L85 PathProgramCache]: Analyzing trace with hash -137790501, now seen corresponding path program 1 times [2024-11-19 14:27:01,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:01,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049895893] [2024-11-19 14:27:01,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:01,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:01,458 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:01,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:01,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:01,467 INFO L85 PathProgramCache]: Analyzing trace with hash -970235363, now seen corresponding path program 1 times [2024-11-19 14:27:01,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:01,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450931014] [2024-11-19 14:27:01,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:01,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:01,477 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:01,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:01,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:01,941 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:01,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 02:27:01 BoogieIcfgContainer [2024-11-19 14:27:01,978 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-19 14:27:01,979 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 14:27:01,979 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 14:27:01,979 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 14:27:01,979 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:26:58" (3/4) ... [2024-11-19 14:27:01,981 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-19 14:27:02,030 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 14:27:02,031 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 14:27:02,031 INFO L158 Benchmark]: Toolchain (without parser) took 4017.98ms. Allocated memory was 190.8MB in the beginning and 243.3MB in the end (delta: 52.4MB). Free memory was 122.2MB in the beginning and 112.2MB in the end (delta: 9.9MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. [2024-11-19 14:27:02,031 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 117.4MB. Free memory is still 83.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:27:02,032 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.07ms. Allocated memory is still 190.8MB. Free memory was 121.9MB in the beginning and 109.0MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 14:27:02,032 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.94ms. Allocated memory is still 190.8MB. Free memory was 109.0MB in the beginning and 107.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:27:02,033 INFO L158 Benchmark]: Boogie Preprocessor took 38.09ms. Allocated memory is still 190.8MB. Free memory was 107.2MB in the beginning and 105.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:27:02,033 INFO L158 Benchmark]: RCFGBuilder took 352.63ms. Allocated memory is still 190.8MB. Free memory was 105.4MB in the beginning and 153.4MB in the end (delta: -47.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 14:27:02,033 INFO L158 Benchmark]: BuchiAutomizer took 3273.44ms. Allocated memory was 190.8MB in the beginning and 243.3MB in the end (delta: 52.4MB). Free memory was 152.8MB in the beginning and 114.3MB in the end (delta: 38.5MB). Peak memory consumption was 94.1MB. Max. memory is 16.1GB. [2024-11-19 14:27:02,033 INFO L158 Benchmark]: Witness Printer took 52.12ms. Allocated memory is still 243.3MB. Free memory was 114.3MB in the beginning and 112.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:27:02,035 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 117.4MB. Free memory is still 83.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.07ms. Allocated memory is still 190.8MB. Free memory was 121.9MB in the beginning and 109.0MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.94ms. Allocated memory is still 190.8MB. Free memory was 109.0MB in the beginning and 107.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.09ms. Allocated memory is still 190.8MB. Free memory was 107.2MB in the beginning and 105.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 352.63ms. Allocated memory is still 190.8MB. Free memory was 105.4MB in the beginning and 153.4MB in the end (delta: -47.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 3273.44ms. Allocated memory was 190.8MB in the beginning and 243.3MB in the end (delta: 52.4MB). Free memory was 152.8MB in the beginning and 114.3MB in the end (delta: 38.5MB). Peak memory consumption was 94.1MB. Max. memory is 16.1GB. * Witness Printer took 52.12ms. Allocated memory is still 243.3MB. Free memory was 114.3MB in the beginning and 112.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (9 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.9 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 14082 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.1s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.0s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 0.8s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.3s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 372 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 372 mSDsluCounter, 1165 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 444 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47 IncrementalHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 721 mSDtfsCounter, 47 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI9 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 41]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L39] int cond; Loop: [L41] COND TRUE 1 [L42] cond = __VERIFIER_nondet_int() [L43] COND FALSE !(cond == 0) [L46] lk1 = 0 [L48] lk2 = 0 [L50] lk3 = 0 [L52] lk4 = 0 [L54] lk5 = 0 [L56] lk6 = 0 [L58] lk7 = 0 [L60] lk8 = 0 [L62] lk9 = 0 [L64] lk10 = 0 [L68] COND FALSE !(p1 != 0) [L72] COND FALSE !(p2 != 0) [L76] COND FALSE !(p3 != 0) [L80] COND FALSE !(p4 != 0) [L84] COND FALSE !(p5 != 0) [L88] COND FALSE !(p6 != 0) [L92] COND FALSE !(p7 != 0) [L96] COND FALSE !(p8 != 0) [L100] COND FALSE !(p9 != 0) [L104] COND FALSE !(p10 != 0) [L110] COND FALSE !(p1 != 0) [L115] COND FALSE !(p2 != 0) [L120] COND FALSE !(p3 != 0) [L125] COND FALSE !(p4 != 0) [L130] COND FALSE !(p5 != 0) [L135] COND FALSE !(p6 != 0) [L140] COND FALSE !(p7 != 0) [L145] COND FALSE !(p8 != 0) [L150] COND FALSE !(p9 != 0) [L155] COND FALSE !(p10 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 41]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L39] int cond; Loop: [L41] COND TRUE 1 [L42] cond = __VERIFIER_nondet_int() [L43] COND FALSE !(cond == 0) [L46] lk1 = 0 [L48] lk2 = 0 [L50] lk3 = 0 [L52] lk4 = 0 [L54] lk5 = 0 [L56] lk6 = 0 [L58] lk7 = 0 [L60] lk8 = 0 [L62] lk9 = 0 [L64] lk10 = 0 [L68] COND FALSE !(p1 != 0) [L72] COND FALSE !(p2 != 0) [L76] COND FALSE !(p3 != 0) [L80] COND FALSE !(p4 != 0) [L84] COND FALSE !(p5 != 0) [L88] COND FALSE !(p6 != 0) [L92] COND FALSE !(p7 != 0) [L96] COND FALSE !(p8 != 0) [L100] COND FALSE !(p9 != 0) [L104] COND FALSE !(p10 != 0) [L110] COND FALSE !(p1 != 0) [L115] COND FALSE !(p2 != 0) [L120] COND FALSE !(p3 != 0) [L125] COND FALSE !(p4 != 0) [L130] COND FALSE !(p5 != 0) [L135] COND FALSE !(p6 != 0) [L140] COND FALSE !(p7 != 0) [L145] COND FALSE !(p8 != 0) [L150] COND FALSE !(p9 != 0) [L155] COND FALSE !(p10 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-19 14:27:02,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)