./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_9.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_9.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 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:27:06,708 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:27:06,777 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-19 14:27:06,784 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:27:06,785 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:27:06,815 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:27:06,815 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:27:06,816 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:27:06,817 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:27:06,818 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:27:06,819 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:27:06,819 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:27:06,819 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:27:06,820 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:27:06,820 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:27:06,823 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:27:06,824 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:27:06,824 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:27:06,824 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:27:06,824 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:27:06,824 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:27:06,825 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 14:27:06,825 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:27:06,825 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 14:27:06,825 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:27:06,825 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:27:06,826 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:27:06,826 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:27:06,826 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:27:06,826 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:27:06,826 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 14:27:06,827 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:27:06,827 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:27:06,827 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:27:06,827 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:27:06,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:27:06,828 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:27:06,828 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:27:06,830 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:27:06,831 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 -> 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 [2024-11-19 14:27:07,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:27:07,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:27:07,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:27:07,135 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:27:07,135 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:27:07,137 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_9.c [2024-11-19 14:27:08,649 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:27:08,866 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:27:08,867 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c [2024-11-19 14:27:08,893 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86e164092/064e1954322e48508a45dec117c0935d/FLAG0735dc830 [2024-11-19 14:27:08,905 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86e164092/064e1954322e48508a45dec117c0935d [2024-11-19 14:27:08,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:27:08,908 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:27:08,909 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:27:08,909 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:27:08,915 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:27:08,915 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:27:08" (1/1) ... [2024-11-19 14:27:08,916 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1844808d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:08, skipping insertion in model container [2024-11-19 14:27:08,916 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:27:08" (1/1) ... [2024-11-19 14:27:08,939 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:27:09,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:27:09,121 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:27:09,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:27:09,155 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:27:09,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:09 WrapperNode [2024-11-19 14:27:09,156 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:27:09,157 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:27:09,157 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:27:09,157 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:27:09,163 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:27:09" (1/1) ... [2024-11-19 14:27:09,169 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:27:09" (1/1) ... [2024-11-19 14:27:09,190 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 127 [2024-11-19 14:27:09,190 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:27:09,191 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:27:09,191 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:27:09,191 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:27:09,201 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:09" (1/1) ... [2024-11-19 14:27:09,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:09" (1/1) ... [2024-11-19 14:27:09,203 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:09" (1/1) ... [2024-11-19 14:27:09,213 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:27:09,213 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:09" (1/1) ... [2024-11-19 14:27:09,214 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:09" (1/1) ... [2024-11-19 14:27:09,216 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:09" (1/1) ... [2024-11-19 14:27:09,223 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:09" (1/1) ... [2024-11-19 14:27:09,224 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:09" (1/1) ... [2024-11-19 14:27:09,225 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:09" (1/1) ... [2024-11-19 14:27:09,230 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:27:09,234 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:27:09,234 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:27:09,234 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:27:09,235 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:09" (1/1) ... [2024-11-19 14:27:09,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:27:09,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:27:09,265 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:27:09,269 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:27:09,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 14:27:09,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:27:09,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:27:09,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 14:27:09,388 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:27:09,390 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:27:09,597 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-19 14:27:09,597 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:27:09,614 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:27:09,614 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 14:27:09,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:27:09 BoogieIcfgContainer [2024-11-19 14:27:09,615 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:27:09,616 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:27:09,617 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:27:09,621 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:27:09,622 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:27:09,623 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:27:08" (1/3) ... [2024-11-19 14:27:09,624 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53091117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:27:09, skipping insertion in model container [2024-11-19 14:27:09,624 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:27:09,624 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:09" (2/3) ... [2024-11-19 14:27:09,624 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53091117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:27:09, skipping insertion in model container [2024-11-19 14:27:09,625 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:27:09,625 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:27:09" (3/3) ... [2024-11-19 14:27:09,626 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_9.c [2024-11-19 14:27:09,688 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:27:09,689 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:27:09,689 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:27:09,689 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:27:09,689 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:27:09,690 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:27:09,690 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:27:09,690 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:27:09,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 37 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 36 states have internal predecessors, (66), 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:09,714 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2024-11-19 14:27:09,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:09,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:09,720 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:09,721 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] [2024-11-19 14:27:09,721 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:27:09,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 37 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 36 states have internal predecessors, (66), 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:09,725 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2024-11-19 14:27:09,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:09,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:09,726 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:09,727 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] [2024-11-19 14:27:09,735 INFO L745 eck$LassoCheckResult]: Stem: 32#$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(15, 2);call #Ultimate.allocInit(12, 3); 7#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_~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_~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_~cond~0#1; 12#L141-1true [2024-11-19 14:27:09,736 INFO L747 eck$LassoCheckResult]: Loop: 12#L141-1true assume !false;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 36#L40true 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; 3#L63true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 19#L63-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 27#L67-1true assume !(0 != main_~p3~0#1); 23#L71-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 29#L75-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 14#L79-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 37#L83-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 8#L87-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4#L91-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 34#L95-1true assume !(0 != main_~p1~0#1); 21#L101-1true assume !(0 != main_~p2~0#1); 9#L106-1true assume !(0 != main_~p3~0#1); 10#L111-1true assume !(0 != main_~p4~0#1); 33#L116-1true assume !(0 != main_~p5~0#1); 5#L121-1true assume !(0 != main_~p6~0#1); 17#L126-1true assume !(0 != main_~p7~0#1); 30#L131-1true assume !(0 != main_~p8~0#1); 18#L136-1true assume !(0 != main_~p9~0#1); 12#L141-1true [2024-11-19 14:27:09,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:09,743 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-19 14:27:09,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:09,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966547471] [2024-11-19 14:27:09,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:09,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:09,845 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:09,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:09,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:09,881 INFO L85 PathProgramCache]: Analyzing trace with hash 694706197, now seen corresponding path program 1 times [2024-11-19 14:27:09,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:09,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464760672] [2024-11-19 14:27:09,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:09,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:10,014 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:10,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:10,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464760672] [2024-11-19 14:27:10,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464760672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:10,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:10,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:27:10,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466493839] [2024-11-19 14:27:10,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:10,025 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:10,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:10,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:10,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:10,064 INFO L87 Difference]: Start difference. First operand has 37 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 36 states have internal predecessors, (66), 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 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:10,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:10,115 INFO L93 Difference]: Finished difference Result 67 states and 117 transitions. [2024-11-19 14:27:10,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 117 transitions. [2024-11-19 14:27:10,122 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2024-11-19 14:27:10,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 59 states and 93 transitions. [2024-11-19 14:27:10,130 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2024-11-19 14:27:10,130 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2024-11-19 14:27:10,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 93 transitions. [2024-11-19 14:27:10,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:10,132 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 93 transitions. [2024-11-19 14:27:10,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 93 transitions. [2024-11-19 14:27:10,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-19 14:27:10,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.576271186440678) internal successors, (93), 58 states have internal predecessors, (93), 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:10,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 93 transitions. [2024-11-19 14:27:10,167 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 93 transitions. [2024-11-19 14:27:10,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:10,174 INFO L425 stractBuchiCegarLoop]: Abstraction has 59 states and 93 transitions. [2024-11-19 14:27:10,174 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:27:10,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 93 transitions. [2024-11-19 14:27:10,176 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2024-11-19 14:27:10,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:10,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:10,179 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:10,180 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] [2024-11-19 14:27:10,180 INFO L745 eck$LassoCheckResult]: Stem: 147#$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(15, 2);call #Ultimate.allocInit(12, 3); 122#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_~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_~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_~cond~0#1; 123#L141-1 [2024-11-19 14:27:10,180 INFO L747 eck$LassoCheckResult]: Loop: 123#L141-1 assume !false;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 130#L40 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; 149#L63 assume !(0 != main_~p1~0#1); 138#L63-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 139#L67-1 assume !(0 != main_~p3~0#1); 144#L71-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 145#L75-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 131#L79-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 132#L83-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 124#L87-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 115#L91-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 116#L95-1 assume !(0 != main_~p1~0#1); 140#L101-1 assume !(0 != main_~p2~0#1); 125#L106-1 assume !(0 != main_~p3~0#1); 126#L111-1 assume !(0 != main_~p4~0#1); 121#L116-1 assume !(0 != main_~p5~0#1); 117#L121-1 assume !(0 != main_~p6~0#1); 119#L126-1 assume !(0 != main_~p7~0#1); 134#L131-1 assume !(0 != main_~p8~0#1); 136#L136-1 assume !(0 != main_~p9~0#1); 123#L141-1 [2024-11-19 14:27:10,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:10,181 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-19 14:27:10,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:10,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413060454] [2024-11-19 14:27:10,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:27:10,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:10,196 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:27:10,196 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:10,197 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:10,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:10,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:10,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1299438509, now seen corresponding path program 1 times [2024-11-19 14:27:10,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:10,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457624301] [2024-11-19 14:27:10,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:10,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:10,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:10,260 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:10,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:10,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457624301] [2024-11-19 14:27:10,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457624301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:10,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:10,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:27:10,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192278605] [2024-11-19 14:27:10,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:10,262 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:10,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:10,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:10,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:10,264 INFO L87 Difference]: Start difference. First operand 59 states and 93 transitions. cyclomatic complexity: 36 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:10,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:10,283 INFO L93 Difference]: Finished difference Result 114 states and 178 transitions. [2024-11-19 14:27:10,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 178 transitions. [2024-11-19 14:27:10,286 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2024-11-19 14:27:10,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 114 states and 178 transitions. [2024-11-19 14:27:10,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 114 [2024-11-19 14:27:10,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2024-11-19 14:27:10,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 178 transitions. [2024-11-19 14:27:10,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:10,291 INFO L218 hiAutomatonCegarLoop]: Abstraction has 114 states and 178 transitions. [2024-11-19 14:27:10,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 178 transitions. [2024-11-19 14:27:10,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-19 14:27:10,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 114 states have (on average 1.5614035087719298) internal successors, (178), 113 states have internal predecessors, (178), 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:10,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 178 transitions. [2024-11-19 14:27:10,301 INFO L240 hiAutomatonCegarLoop]: Abstraction has 114 states and 178 transitions. [2024-11-19 14:27:10,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:10,302 INFO L425 stractBuchiCegarLoop]: Abstraction has 114 states and 178 transitions. [2024-11-19 14:27:10,302 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:27:10,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 178 transitions. [2024-11-19 14:27:10,307 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2024-11-19 14:27:10,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:10,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:10,308 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:10,308 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] [2024-11-19 14:27:10,309 INFO L745 eck$LassoCheckResult]: Stem: 325#$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(15, 2);call #Ultimate.allocInit(12, 3); 301#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_~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_~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_~cond~0#1; 302#L141-1 [2024-11-19 14:27:10,309 INFO L747 eck$LassoCheckResult]: Loop: 302#L141-1 assume !false;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 336#L40 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; 333#L63 assume !(0 != main_~p1~0#1); 334#L63-2 assume !(0 != main_~p2~0#1); 376#L67-1 assume !(0 != main_~p3~0#1); 375#L71-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 374#L75-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 373#L79-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 372#L83-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 371#L87-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 370#L91-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 369#L95-1 assume !(0 != main_~p1~0#1); 367#L101-1 assume !(0 != main_~p2~0#1); 365#L106-1 assume !(0 != main_~p3~0#1); 360#L111-1 assume !(0 != main_~p4~0#1); 357#L116-1 assume !(0 != main_~p5~0#1); 353#L121-1 assume !(0 != main_~p6~0#1); 349#L126-1 assume !(0 != main_~p7~0#1); 345#L131-1 assume !(0 != main_~p8~0#1); 341#L136-1 assume !(0 != main_~p9~0#1); 302#L141-1 [2024-11-19 14:27:10,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:10,309 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-19 14:27:10,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:10,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870203848] [2024-11-19 14:27:10,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:27:10,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:10,317 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:27:10,317 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:10,317 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:10,323 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:10,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:10,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1407180885, now seen corresponding path program 1 times [2024-11-19 14:27:10,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:10,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178769134] [2024-11-19 14:27:10,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:10,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:10,363 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:10,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:10,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178769134] [2024-11-19 14:27:10,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178769134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:10,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:10,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:27:10,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908214329] [2024-11-19 14:27:10,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:10,365 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:10,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:10,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:10,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:10,366 INFO L87 Difference]: Start difference. First operand 114 states and 178 transitions. cyclomatic complexity: 68 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:10,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:10,384 INFO L93 Difference]: Finished difference Result 222 states and 342 transitions. [2024-11-19 14:27:10,384 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 342 transitions. [2024-11-19 14:27:10,387 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 220 [2024-11-19 14:27:10,389 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 222 states and 342 transitions. [2024-11-19 14:27:10,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 222 [2024-11-19 14:27:10,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 222 [2024-11-19 14:27:10,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 222 states and 342 transitions. [2024-11-19 14:27:10,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:10,391 INFO L218 hiAutomatonCegarLoop]: Abstraction has 222 states and 342 transitions. [2024-11-19 14:27:10,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states and 342 transitions. [2024-11-19 14:27:10,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2024-11-19 14:27:10,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 222 states have (on average 1.5405405405405406) internal successors, (342), 221 states have internal predecessors, (342), 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:10,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 342 transitions. [2024-11-19 14:27:10,406 INFO L240 hiAutomatonCegarLoop]: Abstraction has 222 states and 342 transitions. [2024-11-19 14:27:10,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:10,409 INFO L425 stractBuchiCegarLoop]: Abstraction has 222 states and 342 transitions. [2024-11-19 14:27:10,409 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:27:10,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 222 states and 342 transitions. [2024-11-19 14:27:10,410 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 220 [2024-11-19 14:27:10,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:10,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:10,411 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:10,411 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] [2024-11-19 14:27:10,412 INFO L745 eck$LassoCheckResult]: Stem: 671#$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(15, 2);call #Ultimate.allocInit(12, 3); 643#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_~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_~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_~cond~0#1; 644#L141-1 [2024-11-19 14:27:10,412 INFO L747 eck$LassoCheckResult]: Loop: 644#L141-1 assume !false;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 709#L40 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; 706#L63 assume !(0 != main_~p1~0#1); 703#L63-2 assume !(0 != main_~p2~0#1); 700#L67-1 assume !(0 != main_~p3~0#1); 697#L71-1 assume !(0 != main_~p4~0#1); 695#L75-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 693#L79-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 691#L83-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 689#L87-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 687#L91-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 684#L95-1 assume !(0 != main_~p1~0#1); 685#L101-1 assume !(0 != main_~p2~0#1); 734#L106-1 assume !(0 != main_~p3~0#1); 729#L111-1 assume !(0 != main_~p4~0#1); 728#L116-1 assume !(0 != main_~p5~0#1); 724#L121-1 assume !(0 != main_~p6~0#1); 720#L126-1 assume !(0 != main_~p7~0#1); 716#L131-1 assume !(0 != main_~p8~0#1); 713#L136-1 assume !(0 != main_~p9~0#1); 644#L141-1 [2024-11-19 14:27:10,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:10,413 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-11-19 14:27:10,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:10,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604167618] [2024-11-19 14:27:10,413 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:27:10,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:10,423 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:27:10,423 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:10,423 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:10,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:10,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:10,434 INFO L85 PathProgramCache]: Analyzing trace with hash 127317207, now seen corresponding path program 1 times [2024-11-19 14:27:10,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:10,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801471920] [2024-11-19 14:27:10,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:10,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:10,474 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:10,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:10,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801471920] [2024-11-19 14:27:10,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801471920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:10,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:10,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:27:10,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689297479] [2024-11-19 14:27:10,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:10,476 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:10,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:10,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:10,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:10,477 INFO L87 Difference]: Start difference. First operand 222 states and 342 transitions. cyclomatic complexity: 128 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:10,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:10,501 INFO L93 Difference]: Finished difference Result 434 states and 658 transitions. [2024-11-19 14:27:10,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 434 states and 658 transitions. [2024-11-19 14:27:10,505 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 432 [2024-11-19 14:27:10,509 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 434 states to 434 states and 658 transitions. [2024-11-19 14:27:10,509 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 434 [2024-11-19 14:27:10,510 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 434 [2024-11-19 14:27:10,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 434 states and 658 transitions. [2024-11-19 14:27:10,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:10,512 INFO L218 hiAutomatonCegarLoop]: Abstraction has 434 states and 658 transitions. [2024-11-19 14:27:10,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states and 658 transitions. [2024-11-19 14:27:10,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2024-11-19 14:27:10,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 434 states have (on average 1.5161290322580645) internal successors, (658), 433 states have internal predecessors, (658), 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:10,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 658 transitions. [2024-11-19 14:27:10,551 INFO L240 hiAutomatonCegarLoop]: Abstraction has 434 states and 658 transitions. [2024-11-19 14:27:10,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:10,552 INFO L425 stractBuchiCegarLoop]: Abstraction has 434 states and 658 transitions. [2024-11-19 14:27:10,556 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 14:27:10,556 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 434 states and 658 transitions. [2024-11-19 14:27:10,589 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 432 [2024-11-19 14:27:10,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:10,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:10,591 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:10,592 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] [2024-11-19 14:27:10,592 INFO L745 eck$LassoCheckResult]: Stem: 1333#$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(15, 2);call #Ultimate.allocInit(12, 3); 1305#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_~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_~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_~cond~0#1; 1306#L141-1 [2024-11-19 14:27:10,593 INFO L747 eck$LassoCheckResult]: Loop: 1306#L141-1 assume !false;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 1385#L40 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; 1382#L63 assume !(0 != main_~p1~0#1); 1378#L63-2 assume !(0 != main_~p2~0#1); 1375#L67-1 assume !(0 != main_~p3~0#1); 1372#L71-1 assume !(0 != main_~p4~0#1); 1366#L75-1 assume !(0 != main_~p5~0#1); 1367#L79-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1357#L83-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1358#L87-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1350#L91-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1351#L95-1 assume !(0 != main_~p1~0#1); 1414#L101-1 assume !(0 != main_~p2~0#1); 1411#L106-1 assume !(0 != main_~p3~0#1); 1406#L111-1 assume !(0 != main_~p4~0#1); 1404#L116-1 assume !(0 != main_~p5~0#1); 1402#L121-1 assume !(0 != main_~p6~0#1); 1398#L126-1 assume !(0 != main_~p7~0#1); 1394#L131-1 assume !(0 != main_~p8~0#1); 1390#L136-1 assume !(0 != main_~p9~0#1); 1306#L141-1 [2024-11-19 14:27:10,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:10,594 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-11-19 14:27:10,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:10,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124041625] [2024-11-19 14:27:10,595 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:27:10,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:10,603 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:27:10,603 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:10,603 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:10,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:10,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:10,628 INFO L85 PathProgramCache]: Analyzing trace with hash -883800043, now seen corresponding path program 1 times [2024-11-19 14:27:10,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:10,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282044054] [2024-11-19 14:27:10,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:10,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:10,687 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:10,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:10,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282044054] [2024-11-19 14:27:10,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282044054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:10,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:10,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:27:10,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238441259] [2024-11-19 14:27:10,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:10,689 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:10,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:10,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:10,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:10,690 INFO L87 Difference]: Start difference. First operand 434 states and 658 transitions. cyclomatic complexity: 240 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:10,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:10,716 INFO L93 Difference]: Finished difference Result 850 states and 1266 transitions. [2024-11-19 14:27:10,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 850 states and 1266 transitions. [2024-11-19 14:27:10,726 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 848 [2024-11-19 14:27:10,732 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 850 states to 850 states and 1266 transitions. [2024-11-19 14:27:10,732 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 850 [2024-11-19 14:27:10,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 850 [2024-11-19 14:27:10,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 850 states and 1266 transitions. [2024-11-19 14:27:10,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:10,741 INFO L218 hiAutomatonCegarLoop]: Abstraction has 850 states and 1266 transitions. [2024-11-19 14:27:10,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states and 1266 transitions. [2024-11-19 14:27:10,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 850. [2024-11-19 14:27:10,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 850 states have (on average 1.4894117647058824) internal successors, (1266), 849 states have internal predecessors, (1266), 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:10,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1266 transitions. [2024-11-19 14:27:10,768 INFO L240 hiAutomatonCegarLoop]: Abstraction has 850 states and 1266 transitions. [2024-11-19 14:27:10,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:10,770 INFO L425 stractBuchiCegarLoop]: Abstraction has 850 states and 1266 transitions. [2024-11-19 14:27:10,771 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 14:27:10,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 850 states and 1266 transitions. [2024-11-19 14:27:10,776 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 848 [2024-11-19 14:27:10,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:10,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:10,778 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:10,778 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] [2024-11-19 14:27:10,778 INFO L745 eck$LassoCheckResult]: Stem: 2624#$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(15, 2);call #Ultimate.allocInit(12, 3); 2594#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_~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_~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_~cond~0#1; 2595#L141-1 [2024-11-19 14:27:10,779 INFO L747 eck$LassoCheckResult]: Loop: 2595#L141-1 assume !false;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 2777#L40 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; 2774#L63 assume !(0 != main_~p1~0#1); 2775#L63-2 assume !(0 != main_~p2~0#1); 2761#L67-1 assume !(0 != main_~p3~0#1); 2762#L71-1 assume !(0 != main_~p4~0#1); 2744#L75-1 assume !(0 != main_~p5~0#1); 2746#L79-1 assume !(0 != main_~p6~0#1); 2731#L83-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2732#L87-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2716#L91-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 2717#L95-1 assume !(0 != main_~p1~0#1); 2800#L101-1 assume !(0 != main_~p2~0#1); 2799#L106-1 assume !(0 != main_~p3~0#1); 2796#L111-1 assume !(0 != main_~p4~0#1); 2794#L116-1 assume !(0 != main_~p5~0#1); 2792#L121-1 assume !(0 != main_~p6~0#1); 2789#L126-1 assume !(0 != main_~p7~0#1); 2785#L131-1 assume !(0 != main_~p8~0#1); 2781#L136-1 assume !(0 != main_~p9~0#1); 2595#L141-1 [2024-11-19 14:27:10,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:10,780 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2024-11-19 14:27:10,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:10,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49767531] [2024-11-19 14:27:10,780 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:27:10,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:10,786 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-19 14:27:10,789 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:10,789 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:10,796 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:10,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:10,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1470606057, now seen corresponding path program 1 times [2024-11-19 14:27:10,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:10,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267608859] [2024-11-19 14:27:10,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:10,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:10,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:10,835 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:10,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:10,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267608859] [2024-11-19 14:27:10,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267608859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:10,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:10,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:27:10,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758759628] [2024-11-19 14:27:10,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:10,836 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:10,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:10,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:10,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:10,837 INFO L87 Difference]: Start difference. First operand 850 states and 1266 transitions. cyclomatic complexity: 448 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:10,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:10,867 INFO L93 Difference]: Finished difference Result 1666 states and 2434 transitions. [2024-11-19 14:27:10,868 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1666 states and 2434 transitions. [2024-11-19 14:27:10,891 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1664 [2024-11-19 14:27:10,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1666 states to 1666 states and 2434 transitions. [2024-11-19 14:27:10,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1666 [2024-11-19 14:27:10,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1666 [2024-11-19 14:27:10,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1666 states and 2434 transitions. [2024-11-19 14:27:10,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:10,907 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1666 states and 2434 transitions. [2024-11-19 14:27:10,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states and 2434 transitions. [2024-11-19 14:27:10,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1666. [2024-11-19 14:27:10,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1666 states, 1666 states have (on average 1.460984393757503) internal successors, (2434), 1665 states have internal predecessors, (2434), 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:10,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 2434 transitions. [2024-11-19 14:27:10,949 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1666 states and 2434 transitions. [2024-11-19 14:27:10,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:10,951 INFO L425 stractBuchiCegarLoop]: Abstraction has 1666 states and 2434 transitions. [2024-11-19 14:27:10,951 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-19 14:27:10,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1666 states and 2434 transitions. [2024-11-19 14:27:10,962 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1664 [2024-11-19 14:27:10,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:10,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:10,964 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:10,964 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] [2024-11-19 14:27:10,964 INFO L745 eck$LassoCheckResult]: Stem: 5145#$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(15, 2);call #Ultimate.allocInit(12, 3); 5116#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_~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_~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_~cond~0#1; 5117#L141-1 [2024-11-19 14:27:10,964 INFO L747 eck$LassoCheckResult]: Loop: 5117#L141-1 assume !false;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 5462#L40 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; 5460#L63 assume !(0 != main_~p1~0#1); 5458#L63-2 assume !(0 != main_~p2~0#1); 5456#L67-1 assume !(0 != main_~p3~0#1); 5453#L71-1 assume !(0 != main_~p4~0#1); 5450#L75-1 assume !(0 != main_~p5~0#1); 5448#L79-1 assume !(0 != main_~p6~0#1); 5444#L83-1 assume !(0 != main_~p7~0#1); 5442#L87-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 5440#L91-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 5438#L95-1 assume !(0 != main_~p1~0#1); 5432#L101-1 assume !(0 != main_~p2~0#1); 5433#L106-1 assume !(0 != main_~p3~0#1); 5418#L111-1 assume !(0 != main_~p4~0#1); 5419#L116-1 assume !(0 != main_~p5~0#1); 5469#L121-1 assume !(0 != main_~p6~0#1); 5467#L126-1 assume !(0 != main_~p7~0#1); 5466#L131-1 assume !(0 != main_~p8~0#1); 5464#L136-1 assume !(0 != main_~p9~0#1); 5117#L141-1 [2024-11-19 14:27:10,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:10,966 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2024-11-19 14:27:10,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:10,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975940470] [2024-11-19 14:27:10,968 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:27:10,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:10,974 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:10,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:10,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:10,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1212440619, now seen corresponding path program 1 times [2024-11-19 14:27:10,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:10,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074532947] [2024-11-19 14:27:10,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:10,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:11,012 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:11,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:11,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074532947] [2024-11-19 14:27:11,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074532947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:11,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:11,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:27:11,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298524322] [2024-11-19 14:27:11,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:11,014 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:11,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:11,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:11,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:11,015 INFO L87 Difference]: Start difference. First operand 1666 states and 2434 transitions. cyclomatic complexity: 832 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:11,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:11,041 INFO L93 Difference]: Finished difference Result 3266 states and 4674 transitions. [2024-11-19 14:27:11,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3266 states and 4674 transitions. [2024-11-19 14:27:11,076 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3264 [2024-11-19 14:27:11,093 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3266 states to 3266 states and 4674 transitions. [2024-11-19 14:27:11,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3266 [2024-11-19 14:27:11,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3266 [2024-11-19 14:27:11,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3266 states and 4674 transitions. [2024-11-19 14:27:11,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:11,102 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3266 states and 4674 transitions. [2024-11-19 14:27:11,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states and 4674 transitions. [2024-11-19 14:27:11,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3266. [2024-11-19 14:27:11,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3266 states, 3266 states have (on average 1.4311083894672383) internal successors, (4674), 3265 states have internal predecessors, (4674), 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:11,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 4674 transitions. [2024-11-19 14:27:11,162 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3266 states and 4674 transitions. [2024-11-19 14:27:11,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:11,165 INFO L425 stractBuchiCegarLoop]: Abstraction has 3266 states and 4674 transitions. [2024-11-19 14:27:11,165 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-19 14:27:11,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3266 states and 4674 transitions. [2024-11-19 14:27:11,182 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3264 [2024-11-19 14:27:11,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:11,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:11,183 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:11,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] [2024-11-19 14:27:11,183 INFO L745 eck$LassoCheckResult]: Stem: 10087#$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(15, 2);call #Ultimate.allocInit(12, 3); 10054#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_~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_~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_~cond~0#1; 10055#L141-1 [2024-11-19 14:27:11,183 INFO L747 eck$LassoCheckResult]: Loop: 10055#L141-1 assume !false;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 10201#L40 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; 10202#L63 assume !(0 != main_~p1~0#1); 10179#L63-2 assume !(0 != main_~p2~0#1); 10181#L67-1 assume !(0 != main_~p3~0#1); 10157#L71-1 assume !(0 != main_~p4~0#1); 10159#L75-1 assume !(0 != main_~p5~0#1); 10140#L79-1 assume !(0 != main_~p6~0#1); 10142#L83-1 assume !(0 != main_~p7~0#1); 10264#L87-1 assume !(0 != main_~p8~0#1); 10263#L91-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 10261#L95-1 assume !(0 != main_~p1~0#1); 10257#L101-1 assume !(0 != main_~p2~0#1); 10254#L106-1 assume !(0 != main_~p3~0#1); 10249#L111-1 assume !(0 != main_~p4~0#1); 10245#L116-1 assume !(0 != main_~p5~0#1); 10241#L121-1 assume !(0 != main_~p6~0#1); 10238#L126-1 assume !(0 != main_~p7~0#1); 10239#L131-1 assume !(0 != main_~p8~0#1); 10218#L136-1 assume !(0 != main_~p9~0#1); 10055#L141-1 [2024-11-19 14:27:11,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:11,184 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2024-11-19 14:27:11,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:11,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715554473] [2024-11-19 14:27:11,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:27:11,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:11,192 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:27:11,192 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:11,192 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:11,198 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:11,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:11,199 INFO L85 PathProgramCache]: Analyzing trace with hash -511376041, now seen corresponding path program 1 times [2024-11-19 14:27:11,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:11,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530871652] [2024-11-19 14:27:11,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:11,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:11,233 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:11,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:11,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530871652] [2024-11-19 14:27:11,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530871652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:11,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:11,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 14:27:11,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216329847] [2024-11-19 14:27:11,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:11,237 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:11,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:11,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:11,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:11,238 INFO L87 Difference]: Start difference. First operand 3266 states and 4674 transitions. cyclomatic complexity: 1536 Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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:11,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:11,303 INFO L93 Difference]: Finished difference Result 6402 states and 8962 transitions. [2024-11-19 14:27:11,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6402 states and 8962 transitions. [2024-11-19 14:27:11,355 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 6400 [2024-11-19 14:27:11,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6402 states to 6402 states and 8962 transitions. [2024-11-19 14:27:11,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6402 [2024-11-19 14:27:11,412 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6402 [2024-11-19 14:27:11,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6402 states and 8962 transitions. [2024-11-19 14:27:11,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:11,430 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6402 states and 8962 transitions. [2024-11-19 14:27:11,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6402 states and 8962 transitions. [2024-11-19 14:27:11,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6402 to 6402. [2024-11-19 14:27:11,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6402 states, 6402 states have (on average 1.3998750390502968) internal successors, (8962), 6401 states have internal predecessors, (8962), 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:11,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6402 states to 6402 states and 8962 transitions. [2024-11-19 14:27:11,546 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6402 states and 8962 transitions. [2024-11-19 14:27:11,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:11,548 INFO L425 stractBuchiCegarLoop]: Abstraction has 6402 states and 8962 transitions. [2024-11-19 14:27:11,548 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-19 14:27:11,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6402 states and 8962 transitions. [2024-11-19 14:27:11,573 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 6400 [2024-11-19 14:27:11,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:11,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:11,574 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:11,574 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] [2024-11-19 14:27:11,575 INFO L745 eck$LassoCheckResult]: Stem: 19763#$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(15, 2);call #Ultimate.allocInit(12, 3); 19728#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_~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_~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_~cond~0#1; 19729#L141-1 [2024-11-19 14:27:11,575 INFO L747 eck$LassoCheckResult]: Loop: 19729#L141-1 assume !false;havoc main_#t~nondet13#1;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 19928#L40 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; 19925#L63 assume !(0 != main_~p1~0#1); 19926#L63-2 assume !(0 != main_~p2~0#1); 19905#L67-1 assume !(0 != main_~p3~0#1); 19906#L71-1 assume !(0 != main_~p4~0#1); 19889#L75-1 assume !(0 != main_~p5~0#1); 19891#L79-1 assume !(0 != main_~p6~0#1); 19865#L83-1 assume !(0 != main_~p7~0#1); 19867#L87-1 assume !(0 != main_~p8~0#1); 19841#L91-1 assume !(0 != main_~p9~0#1); 19843#L95-1 assume !(0 != main_~p1~0#1); 19952#L101-1 assume !(0 != main_~p2~0#1); 19951#L106-1 assume !(0 != main_~p3~0#1); 19948#L111-1 assume !(0 != main_~p4~0#1); 19946#L116-1 assume !(0 != main_~p5~0#1); 19944#L121-1 assume !(0 != main_~p6~0#1); 19940#L126-1 assume !(0 != main_~p7~0#1); 19936#L131-1 assume !(0 != main_~p8~0#1); 19932#L136-1 assume !(0 != main_~p9~0#1); 19729#L141-1 [2024-11-19 14:27:11,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:11,576 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2024-11-19 14:27:11,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:11,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113432901] [2024-11-19 14:27:11,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:27:11,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:11,581 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:27:11,583 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:11,583 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:11,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:11,588 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:11,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:11,590 INFO L85 PathProgramCache]: Analyzing trace with hash -904403051, now seen corresponding path program 1 times [2024-11-19 14:27:11,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:11,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125110802] [2024-11-19 14:27:11,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:11,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:11,598 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:11,606 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:11,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:11,608 INFO L85 PathProgramCache]: Analyzing trace with hash 551712343, now seen corresponding path program 1 times [2024-11-19 14:27:11,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:11,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656046395] [2024-11-19 14:27:11,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:11,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:11,615 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:11,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:12,025 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:12,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 02:27:12 BoogieIcfgContainer [2024-11-19 14:27:12,059 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-19 14:27:12,060 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 14:27:12,061 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 14:27:12,064 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 14:27:12,065 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:27:09" (3/4) ... [2024-11-19 14:27:12,067 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-19 14:27:12,107 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 14:27:12,108 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 14:27:12,108 INFO L158 Benchmark]: Toolchain (without parser) took 3200.32ms. Allocated memory was 174.1MB in the beginning and 234.9MB in the end (delta: 60.8MB). Free memory was 142.2MB in the beginning and 78.1MB in the end (delta: 64.0MB). Peak memory consumption was 124.5MB. Max. memory is 16.1GB. [2024-11-19 14:27:12,109 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 174.1MB. Free memory is still 146.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:27:12,111 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.99ms. Allocated memory is still 174.1MB. Free memory was 142.2MB in the beginning and 129.5MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 14:27:12,112 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.59ms. Allocated memory is still 174.1MB. Free memory was 129.5MB in the beginning and 127.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:27:12,112 INFO L158 Benchmark]: Boogie Preprocessor took 41.68ms. Allocated memory is still 174.1MB. Free memory was 127.5MB in the beginning and 126.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:27:12,112 INFO L158 Benchmark]: RCFGBuilder took 382.09ms. Allocated memory is still 174.1MB. Free memory was 126.1MB in the beginning and 112.1MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 14:27:12,113 INFO L158 Benchmark]: BuchiAutomizer took 2443.30ms. Allocated memory was 174.1MB in the beginning and 234.9MB in the end (delta: 60.8MB). Free memory was 112.1MB in the beginning and 81.3MB in the end (delta: 30.8MB). Peak memory consumption was 91.0MB. Max. memory is 16.1GB. [2024-11-19 14:27:12,113 INFO L158 Benchmark]: Witness Printer took 47.51ms. Allocated memory is still 234.9MB. Free memory was 80.2MB in the beginning and 78.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:27:12,115 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.19ms. Allocated memory is still 174.1MB. Free memory is still 146.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.99ms. Allocated memory is still 174.1MB. Free memory was 142.2MB in the beginning and 129.5MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.59ms. Allocated memory is still 174.1MB. Free memory was 129.5MB in the beginning and 127.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.68ms. Allocated memory is still 174.1MB. Free memory was 127.5MB in the beginning and 126.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 382.09ms. Allocated memory is still 174.1MB. Free memory was 126.1MB in the beginning and 112.1MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 2443.30ms. Allocated memory was 174.1MB in the beginning and 234.9MB in the end (delta: 60.8MB). Free memory was 112.1MB in the beginning and 81.3MB in the end (delta: 30.8MB). Peak memory consumption was 91.0MB. Max. memory is 16.1GB. * Witness Printer took 47.51ms. Allocated memory is still 234.9MB. Free memory was 80.2MB in the beginning and 78.1MB 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 8 terminating modules (8 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.8 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 6402 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.3s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 0. Minimization of det autom 8. Minimization of nondet autom 0. Automata minimization 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.2s 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, 299 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 299 mSDsluCounter, 937 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 355 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42 IncrementalHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 582 mSDtfsCounter, 42 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI8 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: 38]: 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; [L36] int cond; Loop: [L38] COND TRUE 1 [L39] cond = __VERIFIER_nondet_int() [L40] COND FALSE !(cond == 0) [L43] lk1 = 0 [L45] lk2 = 0 [L47] lk3 = 0 [L49] lk4 = 0 [L51] lk5 = 0 [L53] lk6 = 0 [L55] lk7 = 0 [L57] lk8 = 0 [L59] lk9 = 0 [L63] COND FALSE !(p1 != 0) [L67] COND FALSE !(p2 != 0) [L71] COND FALSE !(p3 != 0) [L75] COND FALSE !(p4 != 0) [L79] COND FALSE !(p5 != 0) [L83] COND FALSE !(p6 != 0) [L87] COND FALSE !(p7 != 0) [L91] COND FALSE !(p8 != 0) [L95] COND FALSE !(p9 != 0) [L101] COND FALSE !(p1 != 0) [L106] COND FALSE !(p2 != 0) [L111] COND FALSE !(p3 != 0) [L116] COND FALSE !(p4 != 0) [L121] COND FALSE !(p5 != 0) [L126] COND FALSE !(p6 != 0) [L131] COND FALSE !(p7 != 0) [L136] COND FALSE !(p8 != 0) [L141] COND FALSE !(p9 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 38]: 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; [L36] int cond; Loop: [L38] COND TRUE 1 [L39] cond = __VERIFIER_nondet_int() [L40] COND FALSE !(cond == 0) [L43] lk1 = 0 [L45] lk2 = 0 [L47] lk3 = 0 [L49] lk4 = 0 [L51] lk5 = 0 [L53] lk6 = 0 [L55] lk7 = 0 [L57] lk8 = 0 [L59] lk9 = 0 [L63] COND FALSE !(p1 != 0) [L67] COND FALSE !(p2 != 0) [L71] COND FALSE !(p3 != 0) [L75] COND FALSE !(p4 != 0) [L79] COND FALSE !(p5 != 0) [L83] COND FALSE !(p6 != 0) [L87] COND FALSE !(p7 != 0) [L91] COND FALSE !(p8 != 0) [L95] COND FALSE !(p9 != 0) [L101] COND FALSE !(p1 != 0) [L106] COND FALSE !(p2 != 0) [L111] COND FALSE !(p3 != 0) [L116] COND FALSE !(p4 != 0) [L121] COND FALSE !(p5 != 0) [L126] COND FALSE !(p6 != 0) [L131] COND FALSE !(p7 != 0) [L136] COND FALSE !(p8 != 0) [L141] COND FALSE !(p9 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-19 14:27:12,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with 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)