./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-bwb/or-05.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-bwb/or-05.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c3769a7b9199e4d3a1d3d7ebad63ad6175b11f31d08bb9cf3238c1849c9b4724 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 22:31:17,604 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 22:31:17,676 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-10 22:31:17,680 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 22:31:17,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 22:31:17,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-10 22:31:17,701 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 22:31:17,702 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 22:31:17,702 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 22:31:17,703 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 22:31:17,703 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 22:31:17,704 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 22:31:17,704 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 22:31:17,704 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 22:31:17,705 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-10 22:31:17,705 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-10 22:31:17,705 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-10 22:31:17,706 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-10 22:31:17,706 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-10 22:31:17,706 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-10 22:31:17,707 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 22:31:17,707 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-10 22:31:17,708 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 22:31:17,708 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 22:31:17,708 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-10 22:31:17,708 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-10 22:31:17,709 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-10 22:31:17,709 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 22:31:17,709 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 22:31:17,709 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 22:31:17,710 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-10 22:31:17,710 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 22:31:17,710 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 22:31:17,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 22:31:17,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 22:31:17,715 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 22:31:17,716 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-10 22:31:17,716 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c3769a7b9199e4d3a1d3d7ebad63ad6175b11f31d08bb9cf3238c1849c9b4724 [2024-11-10 22:31:17,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 22:31:18,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 22:31:18,020 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 22:31:18,022 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 22:31:18,022 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 22:31:18,023 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-bwb/or-05.c [2024-11-10 22:31:19,453 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 22:31:19,646 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 22:31:19,647 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-bwb/or-05.c [2024-11-10 22:31:19,654 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7e102eaa/e8643a71907f46ff81815effb45eee78/FLAGc8626544b [2024-11-10 22:31:19,673 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7e102eaa/e8643a71907f46ff81815effb45eee78 [2024-11-10 22:31:19,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 22:31:19,677 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 22:31:19,678 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 22:31:19,678 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 22:31:19,682 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 22:31:19,683 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:31:19" (1/1) ... [2024-11-10 22:31:19,684 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b02078d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:19, skipping insertion in model container [2024-11-10 22:31:19,684 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:31:19" (1/1) ... [2024-11-10 22:31:19,702 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 22:31:19,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:31:19,870 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 22:31:19,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:31:19,900 INFO L204 MainTranslator]: Completed translation [2024-11-10 22:31:19,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:19 WrapperNode [2024-11-10 22:31:19,901 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 22:31:19,901 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 22:31:19,902 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 22:31:19,902 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 22:31:19,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:19" (1/1) ... [2024-11-10 22:31:19,911 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:19" (1/1) ... [2024-11-10 22:31:19,924 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2024-11-10 22:31:19,924 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 22:31:19,925 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 22:31:19,925 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 22:31:19,925 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 22:31:19,933 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:19" (1/1) ... [2024-11-10 22:31:19,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:19" (1/1) ... [2024-11-10 22:31:19,934 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:19" (1/1) ... [2024-11-10 22:31:19,939 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-10 22:31:19,939 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:19" (1/1) ... [2024-11-10 22:31:19,939 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:19" (1/1) ... [2024-11-10 22:31:19,941 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:19" (1/1) ... [2024-11-10 22:31:19,941 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:19" (1/1) ... [2024-11-10 22:31:19,942 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:19" (1/1) ... [2024-11-10 22:31:19,942 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:19" (1/1) ... [2024-11-10 22:31:19,943 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 22:31:19,944 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 22:31:19,945 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 22:31:19,945 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 22:31:19,947 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:19" (1/1) ... [2024-11-10 22:31:19,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:31:19,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:31:19,981 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:31:19,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-10 22:31:20,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 22:31:20,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 22:31:20,089 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 22:31:20,091 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 22:31:20,198 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-11-10 22:31:20,199 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 22:31:20,227 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 22:31:20,227 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 22:31:20,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:31:20 BoogieIcfgContainer [2024-11-10 22:31:20,227 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 22:31:20,228 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-10 22:31:20,228 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-10 22:31:20,233 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-10 22:31:20,234 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:31:20,234 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 10:31:19" (1/3) ... [2024-11-10 22:31:20,235 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24f59f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:31:20, skipping insertion in model container [2024-11-10 22:31:20,235 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:31:20,235 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:19" (2/3) ... [2024-11-10 22:31:20,236 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24f59f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:31:20, skipping insertion in model container [2024-11-10 22:31:20,237 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:31:20,237 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:31:20" (3/3) ... [2024-11-10 22:31:20,238 INFO L332 chiAutomizerObserver]: Analyzing ICFG or-05.c [2024-11-10 22:31:20,302 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-10 22:31:20,302 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-10 22:31:20,302 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-10 22:31:20,303 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-10 22:31:20,303 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-10 22:31:20,303 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-10 22:31:20,304 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-10 22:31:20,304 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-10 22:31:20,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:31:20,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 22:31:20,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:31:20,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:31:20,329 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:31:20,329 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-10 22:31:20,330 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-10 22:31:20,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:31:20,331 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 22:31:20,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:31:20,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:31:20,332 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:31:20,332 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-10 22:31:20,339 INFO L745 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 8#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~bitwise1#1, main_~y~0#1, main_~x~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := 0; 12#L19true [2024-11-10 22:31:20,339 INFO L747 eck$LassoCheckResult]: Loop: 12#L19true assume true; 5#L19-1true assume !!(main_~x~0#1 > 0); 13#L20true assume !(1 == main_~y~0#1);main_~y~0#1 := 1;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; 12#L19true [2024-11-10 22:31:20,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:31:20,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1504, now seen corresponding path program 1 times [2024-11-10 22:31:20,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:31:20,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739589246] [2024-11-10 22:31:20,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:31:20,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:31:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:20,459 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:31:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:20,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:31:20,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:31:20,529 INFO L85 PathProgramCache]: Analyzing trace with hash 43658, now seen corresponding path program 1 times [2024-11-10 22:31:20,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:31:20,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218745917] [2024-11-10 22:31:20,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:31:20,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:31:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:20,554 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:31:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:20,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:31:20,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:31:20,570 INFO L85 PathProgramCache]: Analyzing trace with hash 44819531, now seen corresponding path program 1 times [2024-11-10 22:31:20,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:31:20,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280940541] [2024-11-10 22:31:20,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:31:20,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:31:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:20,576 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:31:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:20,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:31:20,658 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:31:20,659 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:31:20,659 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:31:20,659 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:31:20,659 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 22:31:20,659 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:31:20,660 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:31:20,660 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:31:20,660 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-05.c_Iteration1_Loop [2024-11-10 22:31:20,660 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:31:20,660 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:31:20,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:31:20,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:31:20,758 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:31:20,759 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 22:31:20,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:31:20,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:31:20,762 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:31:20,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-10 22:31:20,764 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:31:20,764 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:31:20,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-10 22:31:20,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:31:20,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:31:20,801 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:31:20,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-10 22:31:20,805 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 22:31:20,805 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:31:20,840 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 22:31:20,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-10 22:31:20,845 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:31:20,845 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:31:20,845 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:31:20,846 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:31:20,846 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:31:20,846 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:31:20,846 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:31:20,846 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:31:20,846 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-05.c_Iteration1_Loop [2024-11-10 22:31:20,846 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:31:20,846 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:31:20,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:31:20,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:31:20,914 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:31:20,918 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:31:20,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:31:20,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:31:20,921 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:31:20,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-10 22:31:20,924 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 [2024-11-10 22:31:20,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:31:20,934 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:31:20,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:31:20,935 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-10 22:31:20,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:31:20,940 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-10 22:31:20,940 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:31:20,944 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:31:20,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-10 22:31:20,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:31:20,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:31:20,959 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:31:20,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-10 22:31:20,961 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 [2024-11-10 22:31:20,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:31:20,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:31:20,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:31:20,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:31:20,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:31:20,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:31:20,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:31:20,975 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:31:20,980 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-11-10 22:31:20,980 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-10 22:31:20,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:31:20,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:31:21,033 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:31:21,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-10 22:31:21,037 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:31:21,037 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 22:31:21,037 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:31:21,038 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2024-11-10 22:31:21,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-10 22:31:21,060 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 22:31:21,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:31:21,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:31:21,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:31:21,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:31:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:31:21,122 WARN L253 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 22:31:21,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:31:21,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:31:21,180 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 [2024-11-10 22:31:21,183 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) [2024-11-10 22:31:21,245 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) Result 31 states and 43 transitions. Complement of second has 8 states. [2024-11-10 22:31:21,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-10 22:31:21,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) [2024-11-10 22:31:21,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2024-11-10 22:31:21,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 2 letters. Loop has 3 letters. [2024-11-10 22:31:21,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:31:21,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 5 letters. Loop has 3 letters. [2024-11-10 22:31:21,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:31:21,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 2 letters. Loop has 6 letters. [2024-11-10 22:31:21,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:31:21,257 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 43 transitions. [2024-11-10 22:31:21,259 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 22:31:21,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 19 states and 26 transitions. [2024-11-10 22:31:21,265 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-11-10 22:31:21,265 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-11-10 22:31:21,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2024-11-10 22:31:21,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:31:21,266 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2024-11-10 22:31:21,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2024-11-10 22:31:21,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2024-11-10 22:31:21,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:31:21,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2024-11-10 22:31:21,289 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-11-10 22:31:21,289 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-11-10 22:31:21,289 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-10 22:31:21,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2024-11-10 22:31:21,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 22:31:21,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:31:21,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:31:21,290 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-10 22:31:21,291 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-10 22:31:21,291 INFO L745 eck$LassoCheckResult]: Stem: 89#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 90#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~bitwise1#1, main_~y~0#1, main_~x~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := 0; 91#L19 assume true; 93#L19-1 assume !!(main_~x~0#1 > 0); 94#L20 assume 1 == main_~y~0#1; 97#L21-4 [2024-11-10 22:31:21,291 INFO L747 eck$LassoCheckResult]: Loop: 97#L21-4 assume 0 == main_~y~0#1 || main_~y~0#1 == 1 + main_~y~0#1;main_#t~bitwise1#1 := 1 + main_~y~0#1; 87#L21 main_~x~0#1 := main_#t~bitwise1#1;havoc main_#t~bitwise1#1;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; 92#L19 assume true; 98#L19-1 assume !!(main_~x~0#1 > 0); 100#L20 assume 1 == main_~y~0#1; 97#L21-4 [2024-11-10 22:31:21,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:31:21,292 INFO L85 PathProgramCache]: Analyzing trace with hash 44819532, now seen corresponding path program 1 times [2024-11-10 22:31:21,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:31:21,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623251457] [2024-11-10 22:31:21,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:31:21,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:31:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:31:21,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:31:21,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:31:21,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623251457] [2024-11-10 22:31:21,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623251457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:31:21,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:31:21,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 22:31:21,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595773613] [2024-11-10 22:31:21,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:31:21,335 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:31:21,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:31:21,336 INFO L85 PathProgramCache]: Analyzing trace with hash 32426476, now seen corresponding path program 1 times [2024-11-10 22:31:21,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:31:21,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463120582] [2024-11-10 22:31:21,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:31:21,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:31:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:31:21,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:31:21,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:31:21,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463120582] [2024-11-10 22:31:21,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463120582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:31:21,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:31:21,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 22:31:21,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525368968] [2024-11-10 22:31:21,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:31:21,376 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:31:21,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:31:21,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:31:21,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:31:21,381 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand has 3 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) [2024-11-10 22:31:21,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:31:21,401 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2024-11-10 22:31:21,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 27 transitions. [2024-11-10 22:31:21,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2024-11-10 22:31:21,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 21 states and 25 transitions. [2024-11-10 22:31:21,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-11-10 22:31:21,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-11-10 22:31:21,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2024-11-10 22:31:21,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:31:21,407 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-11-10 22:31:21,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2024-11-10 22:31:21,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2024-11-10 22:31:21,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:31:21,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-11-10 22:31:21,411 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-11-10 22:31:21,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:31:21,412 INFO L425 stractBuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-11-10 22:31:21,412 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-10 22:31:21,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2024-11-10 22:31:21,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2024-11-10 22:31:21,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:31:21,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:31:21,413 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2024-11-10 22:31:21,414 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:31:21,414 INFO L745 eck$LassoCheckResult]: Stem: 134#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 135#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~bitwise1#1, main_~y~0#1, main_~x~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := 0; 136#L19 assume true; 141#L19-1 assume !!(main_~x~0#1 > 0); 142#L20 assume !(1 == main_~y~0#1);main_~y~0#1 := 1;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; 144#L19 assume true; 145#L19-1 assume !!(main_~x~0#1 > 0); 147#L20 assume 1 == main_~y~0#1; 143#L21-4 [2024-11-10 22:31:21,414 INFO L747 eck$LassoCheckResult]: Loop: 143#L21-4 assume !(0 == main_~y~0#1 || main_~y~0#1 == 1 + main_~y~0#1); 131#L21-3 assume !(0 == 1 + main_~y~0#1); 133#L21-2 havoc main_#t~bitwise1#1;assume (((((main_~y~0#1 < 0 && 1 + main_~y~0#1 >= 0) || main_#t~bitwise1#1 >= 1 + main_~y~0#1) && ((main_~y~0#1 >= 0 && 1 + main_~y~0#1 < 0) || main_#t~bitwise1#1 >= main_~y~0#1)) && ((main_~y~0#1 < 0 || 1 + main_~y~0#1 < 0) || main_#t~bitwise1#1 <= main_~y~0#1 + (1 + main_~y~0#1))) && ((main_~y~0#1 >= 0 && 1 + main_~y~0#1 >= 0) || main_#t~bitwise1#1 < 0)) && main_#t~bitwise1#1 <= 2147483647; 137#L21 main_~x~0#1 := main_#t~bitwise1#1;havoc main_#t~bitwise1#1;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; 138#L19 assume true; 139#L19-1 assume !!(main_~x~0#1 > 0); 140#L20 assume 1 == main_~y~0#1; 143#L21-4 [2024-11-10 22:31:21,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:31:21,414 INFO L85 PathProgramCache]: Analyzing trace with hash -516167167, now seen corresponding path program 1 times [2024-11-10 22:31:21,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:31:21,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384006231] [2024-11-10 22:31:21,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:31:21,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:31:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:21,424 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:31:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:21,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:31:21,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:31:21,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1387092220, now seen corresponding path program 1 times [2024-11-10 22:31:21,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:31:21,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24595818] [2024-11-10 22:31:21,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:31:21,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:31:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:21,439 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:31:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:21,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:31:21,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:31:21,455 INFO L85 PathProgramCache]: Analyzing trace with hash 2081828604, now seen corresponding path program 1 times [2024-11-10 22:31:21,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:31:21,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074224000] [2024-11-10 22:31:21,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:31:21,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:31:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:21,477 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:31:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:21,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:31:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:21,614 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:31:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:21,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 10:31:21 BoogieIcfgContainer [2024-11-10 22:31:21,627 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-10 22:31:21,627 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 22:31:21,627 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 22:31:21,628 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 22:31:21,628 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:31:20" (3/4) ... [2024-11-10 22:31:21,631 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 22:31:21,632 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 22:31:21,633 INFO L158 Benchmark]: Toolchain (without parser) took 1955.59ms. Allocated memory is still 161.5MB. Free memory was 124.0MB in the beginning and 79.8MB in the end (delta: 44.2MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. [2024-11-10 22:31:21,635 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 117.4MB. Free memory is still 89.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 22:31:21,635 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.22ms. Allocated memory is still 161.5MB. Free memory was 124.0MB in the beginning and 113.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 22:31:21,636 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.87ms. Allocated memory is still 161.5MB. Free memory was 112.5MB in the beginning and 111.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 22:31:21,636 INFO L158 Benchmark]: Boogie Preprocessor took 18.87ms. Allocated memory is still 161.5MB. Free memory was 111.4MB in the beginning and 110.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 22:31:21,636 INFO L158 Benchmark]: IcfgBuilder took 283.19ms. Allocated memory is still 161.5MB. Free memory was 110.4MB in the beginning and 99.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 22:31:21,637 INFO L158 Benchmark]: BuchiAutomizer took 1398.47ms. Allocated memory is still 161.5MB. Free memory was 99.9MB in the beginning and 79.8MB in the end (delta: 20.1MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2024-11-10 22:31:21,637 INFO L158 Benchmark]: Witness Printer took 4.35ms. Allocated memory is still 161.5MB. Free memory is still 79.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 22:31:21,642 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.54ms. Allocated memory is still 117.4MB. Free memory is still 89.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.22ms. Allocated memory is still 161.5MB. Free memory was 124.0MB in the beginning and 113.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.87ms. Allocated memory is still 161.5MB. Free memory was 112.5MB in the beginning and 111.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.87ms. Allocated memory is still 161.5MB. Free memory was 111.4MB in the beginning and 110.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 283.19ms. Allocated memory is still 161.5MB. Free memory was 110.4MB in the beginning and 99.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 1398.47ms. Allocated memory is still 161.5MB. Free memory was 99.9MB in the beginning and 79.8MB in the end (delta: 20.1MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Witness Printer took 4.35ms. Allocated memory is still 161.5MB. Free memory is still 79.8MB. 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) and one module whose termination is unknown.One deterministic module has affine ranking function x and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 19 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.3s and 3 iterations. TraceHistogramMax:2. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 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, 16 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 28 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19 IncrementalHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 18 mSDtfsCounter, 19 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf100 lsp58 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq170 hnf94 smp100 dnf137 smp100 tf109 neg100 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Unable to decide termination Buchi Automizer cannot decide termination for the following lasso because it contains the following overapproximations. Overapproximations C: y|(y+1) [21] (Reason bitwiseOr) Lasso Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~bitwise1#1, main_~y~0#1, main_~x~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := 0;" "assume true;" "assume !!(main_~x~0#1 > 0);" "assume !(1 == main_~y~0#1);main_~y~0#1 := 1;main_~x~0#1 := main_~x~0#1 - main_~y~0#1;" "assume true;" "assume !!(main_~x~0#1 > 0);" "assume 1 == main_~y~0#1;" Loop: "assume !(0 == main_~y~0#1 || main_~y~0#1 == 1 + main_~y~0#1);" "assume !(0 == 1 + main_~y~0#1);" "havoc main_#t~bitwise1#1;assume (((((main_~y~0#1 < 0 && 1 + main_~y~0#1 >= 0) || main_#t~bitwise1#1 >= 1 + main_~y~0#1) && ((main_~y~0#1 >= 0 && 1 + main_~y~0#1 < 0) || main_#t~bitwise1#1 >= main_~y~0#1)) && ((main_~y~0#1 < 0 || 1 + main_~y~0#1 < 0) || main_#t~bitwise1#1 <= main_~y~0#1 + (1 + main_~y~0#1))) && ((main_~y~0#1 >= 0 && 1 + main_~y~0#1 >= 0) || main_#t~bitwise1#1 < 0)) && main_#t~bitwise1#1 <= 2147483647;" "main_~x~0#1 := main_#t~bitwise1#1;havoc main_#t~bitwise1#1;main_~x~0#1 := main_~x~0#1 - main_~y~0#1;" "assume true;" "assume !!(main_~x~0#1 > 0);" "assume 1 == main_~y~0#1;" RESULT: Ultimate could not prove your program: unable to determine termination [2024-11-10 22:31:21,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-10 22:31:21,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN