./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/n.c11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loops/n.c11.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 c22d07de108fc4801b9b7475bdc68ff9a5f4a90db882102d1715237a6b65777f --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:37:36,496 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:37:36,530 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-02-08 14:37:36,533 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:37:36,534 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:37:36,534 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-08 14:37:36,557 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:37:36,557 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:37:36,560 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:37:36,561 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:37:36,561 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:37:36,561 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:37:36,561 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:37:36,561 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:37:36,561 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-08 14:37:36,561 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-08 14:37:36,561 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-08 14:37:36,561 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-08 14:37:36,561 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-08 14:37:36,562 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-08 14:37:36,562 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:37:36,562 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-08 14:37:36,562 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:37:36,562 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:37:36,562 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:37:36,562 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:37:36,562 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-08 14:37:36,562 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-08 14:37:36,562 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-08 14:37:36,562 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:37:36,562 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:37:36,562 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:37:36,562 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-08 14:37:36,562 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:37:36,562 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:37:36,562 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:37:36,562 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:37:36,562 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:37:36,562 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:37:36,563 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-08 14:37:36,563 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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-jdk21/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 -> c22d07de108fc4801b9b7475bdc68ff9a5f4a90db882102d1715237a6b65777f [2025-02-08 14:37:36,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:37:36,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:37:36,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:37:36,803 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:37:36,803 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:37:36,804 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/n.c11.c [2025-02-08 14:37:37,997 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df7fbd313/e485fe76343b4bd48e2c478f90233da9/FLAG1690c9646 [2025-02-08 14:37:38,236 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:37:38,237 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops/n.c11.c [2025-02-08 14:37:38,244 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df7fbd313/e485fe76343b4bd48e2c478f90233da9/FLAG1690c9646 [2025-02-08 14:37:38,580 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df7fbd313/e485fe76343b4bd48e2c478f90233da9 [2025-02-08 14:37:38,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:37:38,585 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:37:38,586 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:37:38,586 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:37:38,590 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:37:38,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:37:38" (1/1) ... [2025-02-08 14:37:38,596 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@456b26e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:37:38, skipping insertion in model container [2025-02-08 14:37:38,596 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:37:38" (1/1) ... [2025-02-08 14:37:38,619 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:37:38,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:37:38,785 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:37:38,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:37:38,806 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:37:38,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:37:38 WrapperNode [2025-02-08 14:37:38,807 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:37:38,807 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:37:38,807 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:37:38,807 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:37:38,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:37:38" (1/1) ... [2025-02-08 14:37:38,815 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:37:38" (1/1) ... [2025-02-08 14:37:38,824 INFO L138 Inliner]: procedures = 13, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 44 [2025-02-08 14:37:38,825 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:37:38,826 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:37:38,826 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:37:38,826 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:37:38,831 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:37:38" (1/1) ... [2025-02-08 14:37:38,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:37:38" (1/1) ... [2025-02-08 14:37:38,836 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:37:38" (1/1) ... [2025-02-08 14:37:38,846 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-02-08 14:37:38,847 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:37:38" (1/1) ... [2025-02-08 14:37:38,847 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:37:38" (1/1) ... [2025-02-08 14:37:38,849 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:37:38" (1/1) ... [2025-02-08 14:37:38,850 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:37:38" (1/1) ... [2025-02-08 14:37:38,851 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:37:38" (1/1) ... [2025-02-08 14:37:38,853 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:37:38" (1/1) ... [2025-02-08 14:37:38,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:37:38,854 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:37:38,855 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:37:38,855 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:37:38,856 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:37:38" (1/1) ... [2025-02-08 14:37:38,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:37:38,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:37:38,880 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:37:38,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-08 14:37:38,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:37:38,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:37:38,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:37:38,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:37:38,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 14:37:38,940 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:37:38,941 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:37:38,999 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2025-02-08 14:37:38,999 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:37:39,004 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:37:39,004 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:37:39,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:37:39 BoogieIcfgContainer [2025-02-08 14:37:39,004 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:37:39,005 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-08 14:37:39,005 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-08 14:37:39,009 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-08 14:37:39,009 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:37:39,009 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:37:38" (1/3) ... [2025-02-08 14:37:39,010 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@342ac6ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:37:39, skipping insertion in model container [2025-02-08 14:37:39,010 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:37:39,010 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:37:38" (2/3) ... [2025-02-08 14:37:39,010 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@342ac6ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:37:39, skipping insertion in model container [2025-02-08 14:37:39,010 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:37:39,010 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:37:39" (3/3) ... [2025-02-08 14:37:39,011 INFO L363 chiAutomizerObserver]: Analyzing ICFG n.c11.c [2025-02-08 14:37:39,038 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-08 14:37:39,039 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-08 14:37:39,039 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-08 14:37:39,039 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-08 14:37:39,039 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-08 14:37:39,039 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-08 14:37:39,039 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-08 14:37:39,039 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-08 14:37:39,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2025-02-08 14:37:39,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-08 14:37:39,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:37:39,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:37:39,052 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:37:39,052 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:37:39,052 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-08 14:37:39,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2025-02-08 14:37:39,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-08 14:37:39,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:37:39,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:37:39,053 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:37:39,053 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:37:39,057 INFO L752 eck$LassoCheckResult]: Stem: "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(8, 2);call write~init~int#1(110, 2, 0, 1);call write~init~int#1(46, 2, 1, 1);call write~init~int#1(99, 2, 2, 1);call write~init~int#1(49, 2, 3, 1);call write~init~int#1(49, 2, 4, 1);call write~init~int#1(46, 2, 5, 1);call write~init~int#1(99, 2, 6, 1);call write~init~int#1(0, 2, 7, 1);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~a~0#1, main_~len~0#1, main_~i~0#1;havoc main_~a~0#1;main_~len~0#1 := 0;havoc main_~i~0#1;" [2025-02-08 14:37:39,057 INFO L754 eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;" "assume 0 != main_#t~nondet4#1 % 256;havoc main_#t~nondet4#1;" "assume 4 == main_~len~0#1 % 4294967296;main_~len~0#1 := 0;" "assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2025-02-08 14:37:39,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:37:39,061 INFO L85 PathProgramCache]: Analyzing trace with hash 42, now seen corresponding path program 1 times [2025-02-08 14:37:39,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:37:39,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137356773] [2025-02-08 14:37:39,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:37:39,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:37:39,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:37:39,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:37:39,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:37:39,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:37:39,109 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:37:39,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:37:39,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:37:39,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:37:39,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:37:39,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:37:39,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:37:39,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1198526, now seen corresponding path program 1 times [2025-02-08 14:37:39,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:37:39,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871295012] [2025-02-08 14:37:39,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:37:39,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:37:39,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:37:39,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:37:39,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:37:39,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:37:39,141 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:37:39,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:37:39,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:37:39,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:37:39,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:37:39,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:37:39,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:37:39,157 INFO L85 PathProgramCache]: Analyzing trace with hash 39062887, now seen corresponding path program 1 times [2025-02-08 14:37:39,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:37:39,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519554789] [2025-02-08 14:37:39,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:37:39,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:37:39,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:37:39,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:37:39,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:37:39,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:37:39,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:37:39,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:37:39,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519554789] [2025-02-08 14:37:39,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519554789] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:37:39,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:37:39,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:37:39,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260119941] [2025-02-08 14:37:39,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:37:39,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:37:39,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:37:39,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:37:39,381 INFO L87 Difference]: Start difference. First operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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) [2025-02-08 14:37:39,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:37:39,394 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2025-02-08 14:37:39,395 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2025-02-08 14:37:39,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-08 14:37:39,403 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 9 states and 10 transitions. [2025-02-08 14:37:39,403 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-08 14:37:39,403 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-02-08 14:37:39,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2025-02-08 14:37:39,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:37:39,404 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-02-08 14:37:39,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2025-02-08 14:37:39,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-02-08 14:37:39,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 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) [2025-02-08 14:37:39,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2025-02-08 14:37:39,434 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-02-08 14:37:39,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:37:39,440 INFO L432 stractBuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-02-08 14:37:39,441 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-08 14:37:39,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2025-02-08 14:37:39,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-08 14:37:39,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:37:39,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:37:39,442 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-08 14:37:39,443 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:37:39,443 INFO L752 eck$LassoCheckResult]: Stem: "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(8, 2);call write~init~int#1(110, 2, 0, 1);call write~init~int#1(46, 2, 1, 1);call write~init~int#1(99, 2, 2, 1);call write~init~int#1(49, 2, 3, 1);call write~init~int#1(49, 2, 4, 1);call write~init~int#1(46, 2, 5, 1);call write~init~int#1(99, 2, 6, 1);call write~init~int#1(0, 2, 7, 1);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~a~0#1, main_~len~0#1, main_~i~0#1;havoc main_~a~0#1;main_~len~0#1 := 0;havoc main_~i~0#1;" "assume true;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;" "assume 0 != main_#t~nondet4#1 % 256;havoc main_#t~nondet4#1;" "assume !(4 == main_~len~0#1 % 4294967296);" [2025-02-08 14:37:39,443 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume true;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;" "assume 0 != main_#t~nondet4#1 % 256;havoc main_#t~nondet4#1;" "assume 4 == main_~len~0#1 % 4294967296;main_~len~0#1 := 0;" [2025-02-08 14:37:39,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:37:39,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1260094, now seen corresponding path program 1 times [2025-02-08 14:37:39,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:37:39,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590099353] [2025-02-08 14:37:39,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:37:39,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:37:39,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:37:39,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:37:39,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:37:39,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:37:39,463 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:37:39,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:37:39,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:37:39,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:37:39,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:37:39,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:37:39,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:37:39,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1051556, now seen corresponding path program 2 times [2025-02-08 14:37:39,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:37:39,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000893452] [2025-02-08 14:37:39,477 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:37:39,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:37:39,480 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:37:39,490 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:37:39,491 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:37:39,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:37:39,491 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:37:39,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:37:39,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:37:39,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:37:39,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:37:39,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:37:39,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:37:39,503 INFO L85 PathProgramCache]: Analyzing trace with hash -212738207, now seen corresponding path program 1 times [2025-02-08 14:37:39,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:37:39,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411713766] [2025-02-08 14:37:39,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:37:39,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:37:39,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:37:39,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:37:39,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:37:39,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:37:39,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:37:39,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:37:39,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411713766] [2025-02-08 14:37:39,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411713766] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:37:39,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708774042] [2025-02-08 14:37:39,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:37:39,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:37:39,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:37:39,589 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:37:39,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 14:37:39,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:37:39,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:37:39,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:37:39,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:37:39,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:37:39,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:37:39,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:37:39,641 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:37:39,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:37:39,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708774042] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:37:39,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:37:39,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2025-02-08 14:37:39,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926818072] [2025-02-08 14:37:39,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:37:39,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:37:39,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 14:37:39,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-02-08 14:37:39,742 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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) [2025-02-08 14:37:39,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:37:39,789 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2025-02-08 14:37:39,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 21 transitions. [2025-02-08 14:37:39,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2025-02-08 14:37:39,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 21 transitions. [2025-02-08 14:37:39,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2025-02-08 14:37:39,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2025-02-08 14:37:39,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2025-02-08 14:37:39,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:37:39,791 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 21 transitions. [2025-02-08 14:37:39,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2025-02-08 14:37:39,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-02-08 14:37:39,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.05) internal successors, (21), 19 states have internal predecessors, (21), 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) [2025-02-08 14:37:39,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2025-02-08 14:37:39,792 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 21 transitions. [2025-02-08 14:37:39,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:37:39,792 INFO L432 stractBuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2025-02-08 14:37:39,792 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-08 14:37:39,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 21 transitions. [2025-02-08 14:37:39,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2025-02-08 14:37:39,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:37:39,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:37:39,793 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-08 14:37:39,793 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 1] [2025-02-08 14:37:39,793 INFO L752 eck$LassoCheckResult]: Stem: "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(8, 2);call write~init~int#1(110, 2, 0, 1);call write~init~int#1(46, 2, 1, 1);call write~init~int#1(99, 2, 2, 1);call write~init~int#1(49, 2, 3, 1);call write~init~int#1(49, 2, 4, 1);call write~init~int#1(46, 2, 5, 1);call write~init~int#1(99, 2, 6, 1);call write~init~int#1(0, 2, 7, 1);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~a~0#1, main_~len~0#1, main_~i~0#1;havoc main_~a~0#1;main_~len~0#1 := 0;havoc main_~i~0#1;" "assume true;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;" "assume 0 != main_#t~nondet4#1 % 256;havoc main_#t~nondet4#1;" "assume !(4 == main_~len~0#1 % 4294967296);" [2025-02-08 14:37:39,793 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume true;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;" "assume 0 != main_#t~nondet4#1 % 256;havoc main_#t~nondet4#1;" "assume !(4 == main_~len~0#1 % 4294967296);" "assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume true;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;" "assume 0 != main_#t~nondet4#1 % 256;havoc main_#t~nondet4#1;" "assume !(4 == main_~len~0#1 % 4294967296);" "assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume true;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;" "assume 0 != main_#t~nondet4#1 % 256;havoc main_#t~nondet4#1;" "assume !(4 == main_~len~0#1 % 4294967296);" "assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume true;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;" "assume 0 != main_#t~nondet4#1 % 256;havoc main_#t~nondet4#1;" "assume 4 == main_~len~0#1 % 4294967296;main_~len~0#1 := 0;" [2025-02-08 14:37:39,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:37:39,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1260094, now seen corresponding path program 2 times [2025-02-08 14:37:39,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:37:39,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618705581] [2025-02-08 14:37:39,794 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:37:39,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:37:39,796 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:37:39,798 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:37:39,799 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:37:39,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:37:39,799 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:37:39,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:37:39,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:37:39,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:37:39,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:37:39,804 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:37:39,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:37:39,804 INFO L85 PathProgramCache]: Analyzing trace with hash -836926832, now seen corresponding path program 1 times [2025-02-08 14:37:39,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:37:39,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606829959] [2025-02-08 14:37:39,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:37:39,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:37:39,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 14:37:39,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:37:39,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:37:39,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:37:39,830 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:37:39,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 14:37:39,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:37:39,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:37:39,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:37:39,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:37:39,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:37:39,850 INFO L85 PathProgramCache]: Analyzing trace with hash -50945331, now seen corresponding path program 2 times [2025-02-08 14:37:39,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:37:39,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823068108] [2025-02-08 14:37:39,850 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:37:39,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:37:39,859 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-02-08 14:37:39,882 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:37:39,882 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:37:39,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:37:39,882 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:37:39,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:37:39,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:37:39,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:37:39,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:37:39,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:37:40,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:37:40,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:37:40,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:37:40,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:37:40,370 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:37:40,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:37:40,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:37:40,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:37:40,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:37:40,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.02 02:37:40 BoogieIcfgContainer [2025-02-08 14:37:40,405 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-08 14:37:40,405 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 14:37:40,405 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 14:37:40,405 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 14:37:40,406 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:37:39" (3/4) ... [2025-02-08 14:37:40,407 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-02-08 14:37:40,428 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 14:37:40,428 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 14:37:40,429 INFO L158 Benchmark]: Toolchain (without parser) took 1843.47ms. Allocated memory is still 201.3MB. Free memory was 159.2MB in the beginning and 137.3MB in the end (delta: 21.9MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2025-02-08 14:37:40,429 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 218.1MB. Free memory is still 133.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:37:40,429 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.83ms. Allocated memory is still 201.3MB. Free memory was 158.9MB in the beginning and 148.5MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:37:40,429 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.21ms. Allocated memory is still 201.3MB. Free memory was 148.5MB in the beginning and 147.5MB in the end (delta: 964.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:37:40,429 INFO L158 Benchmark]: Boogie Preprocessor took 27.51ms. Allocated memory is still 201.3MB. Free memory was 147.2MB in the beginning and 146.2MB in the end (delta: 943.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:37:40,430 INFO L158 Benchmark]: IcfgBuilder took 150.57ms. Allocated memory is still 201.3MB. Free memory was 146.2MB in the beginning and 135.6MB in the end (delta: 10.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 14:37:40,430 INFO L158 Benchmark]: BuchiAutomizer took 1399.85ms. Allocated memory is still 201.3MB. Free memory was 135.6MB in the beginning and 140.6MB in the end (delta: -5.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:37:40,430 INFO L158 Benchmark]: Witness Printer took 22.93ms. Allocated memory is still 201.3MB. Free memory was 140.6MB in the beginning and 137.3MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:37:40,431 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.18ms. Allocated memory is still 218.1MB. Free memory is still 133.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.83ms. Allocated memory is still 201.3MB. Free memory was 158.9MB in the beginning and 148.5MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.21ms. Allocated memory is still 201.3MB. Free memory was 148.5MB in the beginning and 147.5MB in the end (delta: 964.8kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.51ms. Allocated memory is still 201.3MB. Free memory was 147.2MB in the beginning and 146.2MB in the end (delta: 943.6kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 150.57ms. Allocated memory is still 201.3MB. Free memory was 146.2MB in the beginning and 135.6MB in the end (delta: 10.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 1399.85ms. Allocated memory is still 201.3MB. Free memory was 135.6MB in the beginning and 140.6MB in the end (delta: -5.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 22.93ms. Allocated memory is still 201.3MB. Free memory was 140.6MB in the beginning and 137.3MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. 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 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 7 locations. The remainder module has 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.3s and 3 iterations. TraceHistogramMax:4. Analysis of lassos took 1.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s 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, 9 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 29 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 14 mSDtfsCounter, 22 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 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: 21]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L15] int a[5]; [L16] unsigned int len=0; [L18] int i; VAL [len=0] [L21] COND TRUE __VERIFIER_nondet_bool() [L21] COND TRUE __VERIFIER_nondet_bool() [L23] COND FALSE !(len==4) VAL [len=0] Loop: [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE __VERIFIER_nondet_bool() [L21] COND TRUE __VERIFIER_nondet_bool() [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE __VERIFIER_nondet_bool() [L21] COND TRUE __VERIFIER_nondet_bool() [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE __VERIFIER_nondet_bool() [L21] COND TRUE __VERIFIER_nondet_bool() [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE __VERIFIER_nondet_bool() [L21] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE len==4 [L24] len =0 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 21]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L15] int a[5]; [L16] unsigned int len=0; [L18] int i; VAL [len=0] [L21] COND TRUE __VERIFIER_nondet_bool() [L21] COND TRUE __VERIFIER_nondet_bool() [L23] COND FALSE !(len==4) VAL [len=0] Loop: [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE __VERIFIER_nondet_bool() [L21] COND TRUE __VERIFIER_nondet_bool() [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE __VERIFIER_nondet_bool() [L21] COND TRUE __VERIFIER_nondet_bool() [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE __VERIFIER_nondet_bool() [L21] COND TRUE __VERIFIER_nondet_bool() [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE __VERIFIER_nondet_bool() [L21] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE len==4 [L24] len =0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-02-08 14:37:40,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 14:37:40,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)