./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/float-benchs/filter2_set.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 551b0097 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/float-benchs/filter2_set.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 1052e6ec9925823ba5a2ccaaebf89a3336e5de0f5b82a0218158837daebc1dd1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:28:49,935 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:28:49,970 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-01-10 07:28:49,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:28:49,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:28:49,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:28:49,987 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:28:49,987 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:28:49,988 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:28:49,988 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:28:49,988 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:28:49,988 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:28:49,988 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:28:49,988 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:28:49,988 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:28:49,988 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:28:49,989 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:28:49,989 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:28:49,989 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:28:49,989 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:28:49,989 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:28:49,989 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 07:28:49,989 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:28:49,989 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 07:28:49,989 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:28:49,989 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:28:49,989 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:28:49,990 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:28:49,990 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:28:49,990 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 07:28:49,990 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:28:49,990 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:28:49,990 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:28:49,990 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:28:49,990 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:28:49,990 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:28:49,990 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:28:49,990 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:28:49,991 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:28:49,991 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 -> 1052e6ec9925823ba5a2ccaaebf89a3336e5de0f5b82a0218158837daebc1dd1 [2025-01-10 07:28:50,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:28:50,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:28:50,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:28:50,307 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:28:50,307 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:28:50,308 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/filter2_set.c [2025-01-10 07:28:51,457 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21fb478d9/9ea714393a274ca4b72428cda1c9a3db/FLAG9d8df2b32 [2025-01-10 07:28:51,677 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:28:51,678 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/filter2_set.c [2025-01-10 07:28:51,687 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21fb478d9/9ea714393a274ca4b72428cda1c9a3db/FLAG9d8df2b32 [2025-01-10 07:28:52,025 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21fb478d9/9ea714393a274ca4b72428cda1c9a3db [2025-01-10 07:28:52,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:28:52,028 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:28:52,029 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:28:52,029 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:28:52,032 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:28:52,032 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:28:52" (1/1) ... [2025-01-10 07:28:52,033 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b04e03f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:28:52, skipping insertion in model container [2025-01-10 07:28:52,033 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:28:52" (1/1) ... [2025-01-10 07:28:52,042 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:28:52,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:28:52,140 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:28:52,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:28:52,160 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:28:52,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:28:52 WrapperNode [2025-01-10 07:28:52,160 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:28:52,161 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:28:52,161 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:28:52,161 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:28:52,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:28:52" (1/1) ... [2025-01-10 07:28:52,174 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:28:52" (1/1) ... [2025-01-10 07:28:52,187 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 99 [2025-01-10 07:28:52,187 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:28:52,188 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:28:52,188 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:28:52,188 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:28:52,208 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:28:52" (1/1) ... [2025-01-10 07:28:52,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:28:52" (1/1) ... [2025-01-10 07:28:52,209 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:28:52" (1/1) ... [2025-01-10 07:28:52,215 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]. [2025-01-10 07:28:52,216 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:28:52" (1/1) ... [2025-01-10 07:28:52,216 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:28:52" (1/1) ... [2025-01-10 07:28:52,218 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:28:52" (1/1) ... [2025-01-10 07:28:52,219 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:28:52" (1/1) ... [2025-01-10 07:28:52,221 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:28:52" (1/1) ... [2025-01-10 07:28:52,221 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:28:52" (1/1) ... [2025-01-10 07:28:52,222 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:28:52" (1/1) ... [2025-01-10 07:28:52,223 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:28:52,223 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:28:52,223 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:28:52,224 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:28:52,224 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:28:52" (1/1) ... [2025-01-10 07:28:52,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:28:52,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:28:52,258 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-01-10 07:28:52,259 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-01-10 07:28:52,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 07:28:52,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 07:28:52,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:28:52,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:28:52,318 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:28:52,319 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:28:52,406 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-01-10 07:28:52,406 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:28:52,412 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:28:52,412 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 07:28:52,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:28:52 BoogieIcfgContainer [2025-01-10 07:28:52,412 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:28:52,413 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:28:52,413 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:28:52,417 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:28:52,418 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:28:52,418 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:28:52" (1/3) ... [2025-01-10 07:28:52,418 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c8ca695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:28:52, skipping insertion in model container [2025-01-10 07:28:52,418 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:28:52,419 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:28:52" (2/3) ... [2025-01-10 07:28:52,419 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c8ca695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:28:52, skipping insertion in model container [2025-01-10 07:28:52,419 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:28:52,419 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:28:52" (3/3) ... [2025-01-10 07:28:52,420 INFO L363 chiAutomizerObserver]: Analyzing ICFG filter2_set.c [2025-01-10 07:28:52,450 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:28:52,451 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:28:52,451 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:28:52,451 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:28:52,451 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:28:52,451 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:28:52,451 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:28:52,451 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:28:52,454 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 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-01-10 07:28:52,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-01-10 07:28:52,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:28:52,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:28:52,466 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:28:52,466 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-01-10 07:28:52,466 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:28:52,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 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-01-10 07:28:52,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-01-10 07:28:52,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:28:52,468 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:28:52,468 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:28:52,468 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-01-10 07:28:52,473 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(14, 2);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~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~post12#1, main_~E~0#1, main_~E0~0#1, main_~E1~0#1, main_~S0~0#1, main_~S1~0#1, main_~S~0#1, main_~A1~0#1, main_~A2~0#1, main_~A3~0#1, main_~B1~0#1, main_~B2~0#1, main_~i~0#1;havoc main_~E~0#1;havoc main_~E0~0#1;havoc main_~E1~0#1;havoc main_~S0~0#1;havoc main_~S1~0#1;havoc main_~S~0#1;havoc main_~A1~0#1;havoc main_~A2~0#1;havoc main_~A3~0#1;havoc main_~B1~0#1;havoc main_~B2~0#1;havoc main_~i~0#1;havoc main_#t~nondet4#1;main_~A1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~A2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;main_~A3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~B1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;main_~B2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~A1~0#1, 0.69) && ~someBinaryDOUBLEComparisonOperation(main_~A1~0#1, 0.71) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~A2~0#1, ~someUnaryDOUBLEoperation(1.31)) && ~someBinaryDOUBLEComparisonOperation(main_~A2~0#1, ~someUnaryDOUBLEoperation(1.29)) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~A3~0#1, 1.09) && ~someBinaryDOUBLEComparisonOperation(main_~A3~0#1, 1.11) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~B1~0#1, 1.39) && ~someBinaryDOUBLEComparisonOperation(main_~B1~0#1, 1.41) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~B2~0#1, ~someUnaryDOUBLEoperation(0.71)) && ~someBinaryDOUBLEComparisonOperation(main_~B2~0#1, ~someUnaryDOUBLEoperation(0.69)) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;havoc main_#t~nondet9#1;main_~E~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;main_~E0~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~E~0#1, 0.0) && ~someBinaryDOUBLEComparisonOperation(main_~E~0#1, 1.0) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~E0~0#1, 0.0) && ~someBinaryDOUBLEComparisonOperation(main_~E0~0#1, 1.0) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume 0 == assume_abort_if_not_~cond#1;assume false;" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;main_~S0~0#1 := ~convertINTToDOUBLE(0);main_~S~0#1 := ~convertINTToDOUBLE(0);main_~i~0#1 := 0;" [2025-01-10 07:28:52,473 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 <= 1000000;main_~E1~0#1 := main_~E0~0#1;main_~E0~0#1 := main_~E~0#1;havoc main_#t~nondet11#1;main_~E~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~E~0#1, 0.0) && ~someBinaryDOUBLEComparisonOperation(main_~E~0#1, 1.0) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume 0 == assume_abort_if_not_~cond#1;assume false;" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;main_~S1~0#1 := main_~S0~0#1;main_~S0~0#1 := main_~S~0#1;main_~S~0#1 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(main_~A1~0#1, main_~E~0#1), ~someBinaryArithmeticDOUBLEoperation(main_~E0~0#1, main_~A2~0#1)), ~someBinaryArithmeticDOUBLEoperation(main_~E1~0#1, main_~A3~0#1)), ~someBinaryArithmeticDOUBLEoperation(main_~S0~0#1, main_~B1~0#1)), ~someBinaryArithmeticDOUBLEoperation(main_~S1~0#1, main_~B2~0#1));assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~S~0#1, ~someUnaryDOUBLEoperation(100.0)) && ~someBinaryDOUBLEComparisonOperation(main_~S~0#1, 100.0) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1;" [2025-01-10 07:28:52,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:28:52,477 INFO L85 PathProgramCache]: Analyzing trace with hash 2007861331, now seen corresponding path program 1 times [2025-01-10 07:28:52,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:28:52,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984612893] [2025-01-10 07:28:52,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:28:52,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:28:52,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 07:28:52,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 07:28:52,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:28:52,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:28:52,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:28:52,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:28:52,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984612893] [2025-01-10 07:28:52,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984612893] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:28:52,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:28:52,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 07:28:52,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652001629] [2025-01-10 07:28:52,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:28:52,597 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:28:52,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:28:52,599 INFO L85 PathProgramCache]: Analyzing trace with hash 81212541, now seen corresponding path program 1 times [2025-01-10 07:28:52,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:28:52,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633020629] [2025-01-10 07:28:52,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:28:52,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:28:52,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:28:52,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:28:52,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:28:52,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:28:52,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:28:52,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:28:52,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633020629] [2025-01-10 07:28:52,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633020629] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:28:52,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:28:52,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 07:28:52,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962891679] [2025-01-10 07:28:52,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:28:52,620 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:28:52,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:28:52,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 07:28:52,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 07:28:52,638 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 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 2 states, 2 states have (on average 2.5) 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-01-10 07:28:52,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:28:52,642 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2025-01-10 07:28:52,643 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 25 transitions. [2025-01-10 07:28:52,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:28:52,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 21 transitions. [2025-01-10 07:28:52,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-01-10 07:28:52,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-01-10 07:28:52,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 21 transitions. [2025-01-10 07:28:52,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:28:52,648 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 21 transitions. [2025-01-10 07:28:52,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 21 transitions. [2025-01-10 07:28:52,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-01-10 07:28:52,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.0) internal successors, (21), 20 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-01-10 07:28:52,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2025-01-10 07:28:52,666 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 21 transitions. [2025-01-10 07:28:52,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 07:28:52,669 INFO L432 stractBuchiCegarLoop]: Abstraction has 21 states and 21 transitions. [2025-01-10 07:28:52,669 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:28:52,669 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 21 transitions. [2025-01-10 07:28:52,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:28:52,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:28:52,670 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:28:52,670 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:28:52,670 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-01-10 07:28:52,670 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(14, 2);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~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~post12#1, main_~E~0#1, main_~E0~0#1, main_~E1~0#1, main_~S0~0#1, main_~S1~0#1, main_~S~0#1, main_~A1~0#1, main_~A2~0#1, main_~A3~0#1, main_~B1~0#1, main_~B2~0#1, main_~i~0#1;havoc main_~E~0#1;havoc main_~E0~0#1;havoc main_~E1~0#1;havoc main_~S0~0#1;havoc main_~S1~0#1;havoc main_~S~0#1;havoc main_~A1~0#1;havoc main_~A2~0#1;havoc main_~A3~0#1;havoc main_~B1~0#1;havoc main_~B2~0#1;havoc main_~i~0#1;havoc main_#t~nondet4#1;main_~A1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~A2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;main_~A3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~B1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;main_~B2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~A1~0#1, 0.69) && ~someBinaryDOUBLEComparisonOperation(main_~A1~0#1, 0.71) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~A2~0#1, ~someUnaryDOUBLEoperation(1.31)) && ~someBinaryDOUBLEComparisonOperation(main_~A2~0#1, ~someUnaryDOUBLEoperation(1.29)) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~A3~0#1, 1.09) && ~someBinaryDOUBLEComparisonOperation(main_~A3~0#1, 1.11) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~B1~0#1, 1.39) && ~someBinaryDOUBLEComparisonOperation(main_~B1~0#1, 1.41) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~B2~0#1, ~someUnaryDOUBLEoperation(0.71)) && ~someBinaryDOUBLEComparisonOperation(main_~B2~0#1, ~someUnaryDOUBLEoperation(0.69)) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;havoc main_#t~nondet9#1;main_~E~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;main_~E0~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~E~0#1, 0.0) && ~someBinaryDOUBLEComparisonOperation(main_~E~0#1, 1.0) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~E0~0#1, 0.0) && ~someBinaryDOUBLEComparisonOperation(main_~E0~0#1, 1.0) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;main_~S0~0#1 := ~convertINTToDOUBLE(0);main_~S~0#1 := ~convertINTToDOUBLE(0);main_~i~0#1 := 0;" [2025-01-10 07:28:52,670 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 <= 1000000;main_~E1~0#1 := main_~E0~0#1;main_~E0~0#1 := main_~E~0#1;havoc main_#t~nondet11#1;main_~E~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~E~0#1, 0.0) && ~someBinaryDOUBLEComparisonOperation(main_~E~0#1, 1.0) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;main_~S1~0#1 := main_~S0~0#1;main_~S0~0#1 := main_~S~0#1;main_~S~0#1 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(main_~A1~0#1, main_~E~0#1), ~someBinaryArithmeticDOUBLEoperation(main_~E0~0#1, main_~A2~0#1)), ~someBinaryArithmeticDOUBLEoperation(main_~E1~0#1, main_~A3~0#1)), ~someBinaryArithmeticDOUBLEoperation(main_~S0~0#1, main_~B1~0#1)), ~someBinaryArithmeticDOUBLEoperation(main_~S1~0#1, main_~B2~0#1));assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~S~0#1, ~someUnaryDOUBLEoperation(100.0)) && ~someBinaryDOUBLEComparisonOperation(main_~S~0#1, 100.0) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1;" [2025-01-10 07:28:52,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:28:52,671 INFO L85 PathProgramCache]: Analyzing trace with hash 2007861393, now seen corresponding path program 1 times [2025-01-10 07:28:52,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:28:52,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406752004] [2025-01-10 07:28:52,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:28:52,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:28:52,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 07:28:52,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 07:28:52,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:28:52,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:28:52,691 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:28:52,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 07:28:52,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 07:28:52,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:28:52,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:28:52,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:28:52,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:28:52,727 INFO L85 PathProgramCache]: Analyzing trace with hash 81272123, now seen corresponding path program 1 times [2025-01-10 07:28:52,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:28:52,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284880970] [2025-01-10 07:28:52,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:28:52,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:28:52,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:28:52,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:28:52,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:28:52,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:28:52,741 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:28:52,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:28:52,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:28:52,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:28:52,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:28:52,751 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:28:52,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:28:52,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1511616171, now seen corresponding path program 1 times [2025-01-10 07:28:52,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:28:52,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445716707] [2025-01-10 07:28:52,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:28:52,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:28:52,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 07:28:52,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 07:28:52,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:28:52,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:28:52,788 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:28:52,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 07:28:52,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 07:28:52,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:28:52,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:28:52,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:28:52,927 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:28:52,927 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:28:52,928 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:28:52,928 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:28:52,928 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:28:52,928 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:28:52,928 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:28:52,928 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:28:52,928 INFO L132 ssoRankerPreferences]: Filename of dumped script: filter2_set.c_Iteration2_Loop [2025-01-10 07:28:52,928 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:28:52,928 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:28:52,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:28:52,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:28:52,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:28:52,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:28:52,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:28:52,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:28:52,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:28:52,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:28:52,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:28:53,046 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:28:53,046 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:28:53,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:28:53,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:28:53,051 INFO L229 MonitoredProcess]: Starting monitored process 2 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-01-10 07:28:53,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-01-10 07:28:53,053 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:28:53,053 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:28:53,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-01-10 07:28:53,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:28:53,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:28:53,080 INFO L229 MonitoredProcess]: Starting monitored process 3 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-01-10 07:28:53,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-01-10 07:28:53,081 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:28:53,081 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:28:53,105 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:28:53,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-01-10 07:28:53,110 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:28:53,110 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:28:53,110 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:28:53,110 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:28:53,110 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:28:53,110 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:28:53,110 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:28:53,110 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:28:53,110 INFO L132 ssoRankerPreferences]: Filename of dumped script: filter2_set.c_Iteration2_Loop [2025-01-10 07:28:53,110 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:28:53,110 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:28:53,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:28:53,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:28:53,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:28:53,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:28:53,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:28:53,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:28:53,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:28:53,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:28:53,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:28:53,179 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:28:53,182 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:28:53,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:28:53,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:28:53,187 INFO L229 MonitoredProcess]: Starting monitored process 4 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-01-10 07:28:53,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-01-10 07:28:53,190 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:28:53,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:28:53,201 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:28:53,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:28:53,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:28:53,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:28:53,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:28:53,205 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:28:53,207 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:28:53,210 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:28:53,212 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 07:28:53,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:28:53,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:28:53,215 INFO L229 MonitoredProcess]: Starting monitored process 5 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-01-10 07:28:53,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-01-10 07:28:53,221 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:28:53,221 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:28:53,222 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:28:53,222 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 2000001 Supporting invariants [] [2025-01-10 07:28:53,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-01-10 07:28:53,234 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:28:53,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:28:53,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 07:28:53,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 07:28:53,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:28:53,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:28:53,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:28:53,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:28:53,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:28:53,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:28:53,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:28:53,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:28:53,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:28:53,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:28:53,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:28:53,332 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-01-10 07:28:53,332 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 21 transitions. cyclomatic complexity: 1 Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-01-10 07:28:53,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-01-10 07:28:53,375 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 21 transitions. cyclomatic complexity: 1. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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) Result 26 states and 27 transitions. Complement of second has 4 states. [2025-01-10 07:28:53,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:28:53,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-01-10 07:28:53,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2025-01-10 07:28:53,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 16 letters. Loop has 5 letters. [2025-01-10 07:28:53,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:28:53,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 21 letters. Loop has 5 letters. [2025-01-10 07:28:53,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:28:53,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 16 letters. Loop has 10 letters. [2025-01-10 07:28:53,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:28:53,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 27 transitions. [2025-01-10 07:28:53,381 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 07:28:53,381 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2025-01-10 07:28:53,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-01-10 07:28:53,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-01-10 07:28:53,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-01-10 07:28:53,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:28:53,381 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:28:53,381 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:28:53,381 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:28:53,381 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:28:53,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-01-10 07:28:53,382 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 07:28:53,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-01-10 07:28:53,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 07:28:53 BoogieIcfgContainer [2025-01-10 07:28:53,388 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-01-10 07:28:53,388 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 07:28:53,389 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 07:28:53,389 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 07:28:53,389 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:28:52" (3/4) ... [2025-01-10 07:28:53,391 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 07:28:53,391 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 07:28:53,392 INFO L158 Benchmark]: Toolchain (without parser) took 1363.83ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 115.8MB in the end (delta: 5.4MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2025-01-10 07:28:53,392 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 176.2MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:28:53,393 INFO L158 Benchmark]: CACSL2BoogieTranslator took 131.70ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 109.8MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:28:53,393 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.15ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 108.6MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:28:53,393 INFO L158 Benchmark]: Boogie Preprocessor took 35.01ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 107.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:28:53,394 INFO L158 Benchmark]: RCFGBuilder took 189.11ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 95.1MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:28:53,394 INFO L158 Benchmark]: BuchiAutomizer took 974.93ms. Allocated memory is still 167.8MB. Free memory was 95.1MB in the beginning and 115.8MB in the end (delta: -20.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:28:53,394 INFO L158 Benchmark]: Witness Printer took 2.96ms. Allocated memory is still 167.8MB. Free memory was 115.8MB in the beginning and 115.8MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:28:53,395 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.21ms. Allocated memory is still 176.2MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 131.70ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 109.8MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.15ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 108.6MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.01ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 107.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 189.11ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 95.1MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 974.93ms. Allocated memory is still 167.8MB. Free memory was 95.1MB in the beginning and 115.8MB in the end (delta: -20.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.96ms. Allocated memory is still 167.8MB. Free memory was 115.8MB in the beginning and 115.8MB in the end (delta: 33.1kB). There was no memory consumed. 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 (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * i) + 2000001) and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.9s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 47 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 44 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf100 lsp62 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 39ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-01-10 07:28:53,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE