./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-bwb/or-05.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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.dk.eval-mul-div-a046e57-m [2024-10-13 16:54:57,884 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 16:54:57,937 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-13 16:54:57,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 16:54:57,946 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 16:54:57,972 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 16:54:57,972 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 16:54:57,973 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 16:54:57,973 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 16:54:57,976 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 16:54:57,977 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 16:54:57,977 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 16:54:57,977 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 16:54:57,977 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-13 16:54:57,978 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-13 16:54:57,978 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-13 16:54:57,978 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-13 16:54:57,978 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-13 16:54:57,978 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-13 16:54:57,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 16:54:57,979 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-13 16:54:57,981 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 16:54:57,981 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 16:54:57,982 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-13 16:54:57,982 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-13 16:54:57,982 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-13 16:54:57,982 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 16:54:57,982 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 16:54:57,983 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 16:54:57,983 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-13 16:54:57,983 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 16:54:57,983 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 16:54:57,983 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 16:54:57,983 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 16:54:57,984 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 16:54:57,984 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-13 16:54:57,984 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-10-13 16:54:58,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 16:54:58,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 16:54:58,194 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 16:54:58,196 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 16:54:58,197 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 16:54:58,198 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-bwb/or-05.c [2024-10-13 16:54:59,588 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 16:54:59,727 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 16:54:59,727 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-bwb/or-05.c [2024-10-13 16:54:59,734 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3af65a2a2/ad03be4bbc7a4aa3a77a538cb8baa874/FLAGa0f0969be [2024-10-13 16:54:59,744 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3af65a2a2/ad03be4bbc7a4aa3a77a538cb8baa874 [2024-10-13 16:54:59,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 16:54:59,750 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 16:54:59,751 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 16:54:59,752 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 16:54:59,756 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 16:54:59,757 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:54:59" (1/1) ... [2024-10-13 16:54:59,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@343b0535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:54:59, skipping insertion in model container [2024-10-13 16:54:59,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:54:59" (1/1) ... [2024-10-13 16:54:59,772 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 16:54:59,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 16:54:59,889 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 16:54:59,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 16:54:59,910 INFO L204 MainTranslator]: Completed translation [2024-10-13 16:54:59,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:54:59 WrapperNode [2024-10-13 16:54:59,910 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 16:54:59,911 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 16:54:59,911 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 16:54:59,911 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 16:54:59,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:54:59" (1/1) ... [2024-10-13 16:54:59,919 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:54:59" (1/1) ... [2024-10-13 16:54:59,930 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 27 [2024-10-13 16:54:59,930 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 16:54:59,931 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 16:54:59,931 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 16:54:59,931 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 16:54:59,938 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:54:59" (1/1) ... [2024-10-13 16:54:59,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:54:59" (1/1) ... [2024-10-13 16:54:59,938 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:54:59" (1/1) ... [2024-10-13 16:54:59,942 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-13 16:54:59,943 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:54:59" (1/1) ... [2024-10-13 16:54:59,943 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:54:59" (1/1) ... [2024-10-13 16:54:59,944 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:54:59" (1/1) ... [2024-10-13 16:54:59,946 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:54:59" (1/1) ... [2024-10-13 16:54:59,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:54:59" (1/1) ... [2024-10-13 16:54:59,950 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:54:59" (1/1) ... [2024-10-13 16:54:59,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 16:54:59,952 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 16:54:59,954 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 16:54:59,954 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 16:54:59,954 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:54:59" (1/1) ... [2024-10-13 16:54:59,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:54:59,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:54:59,979 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-10-13 16:54:59,981 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-10-13 16:55:00,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 16:55:00,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 16:55:00,082 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 16:55:00,103 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 16:55:00,243 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-10-13 16:55:00,243 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 16:55:00,253 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 16:55:00,253 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 16:55:00,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:55:00 BoogieIcfgContainer [2024-10-13 16:55:00,254 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 16:55:00,254 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-13 16:55:00,254 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-13 16:55:00,259 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-13 16:55:00,259 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 16:55:00,259 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.10 04:54:59" (1/3) ... [2024-10-13 16:55:00,260 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@689b0df8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 04:55:00, skipping insertion in model container [2024-10-13 16:55:00,260 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 16:55:00,260 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:54:59" (2/3) ... [2024-10-13 16:55:00,261 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@689b0df8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 04:55:00, skipping insertion in model container [2024-10-13 16:55:00,261 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 16:55:00,261 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:55:00" (3/3) ... [2024-10-13 16:55:00,262 INFO L332 chiAutomizerObserver]: Analyzing ICFG or-05.c [2024-10-13 16:55:00,315 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-13 16:55:00,315 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-13 16:55:00,316 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-13 16:55:00,316 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-13 16:55:00,316 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-13 16:55:00,316 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-13 16:55:00,316 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-13 16:55:00,316 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-13 16:55:00,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 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-10-13 16:55:00,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-13 16:55:00,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:55:00,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:55:00,334 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 16:55:00,335 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 16:55:00,335 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-13 16:55:00,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 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-10-13 16:55:00,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-13 16:55:00,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:55:00,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:55:00,337 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 16:55:00,337 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 16:55:00,342 INFO L745 eck$LassoCheckResult]: Stem: 7#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 10#L-1true 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; 5#L20-2true [2024-10-13 16:55:00,342 INFO L747 eck$LassoCheckResult]: Loop: 5#L20-2true assume !!(main_~x~0#1 > 0); 11#L20true assume !(1 == main_~y~0#1);main_~y~0#1 := 1;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; 5#L20-2true [2024-10-13 16:55:00,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:00,347 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-13 16:55:00,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:55:00,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892237698] [2024-10-13 16:55:00,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:55:00,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:55:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:00,410 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:55:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:00,430 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:55:00,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:00,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1331, now seen corresponding path program 1 times [2024-10-13 16:55:00,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:55:00,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442513455] [2024-10-13 16:55:00,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:55:00,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:55:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:00,439 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:55:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:00,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:55:00,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:00,443 INFO L85 PathProgramCache]: Analyzing trace with hash 925813, now seen corresponding path program 1 times [2024-10-13 16:55:00,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:55:00,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138793444] [2024-10-13 16:55:00,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:55:00,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:55:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:00,448 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:55:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:00,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:55:00,512 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:55:00,512 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:55:00,513 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:55:00,513 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:55:00,513 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:55:00,513 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:00,513 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:55:00,513 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:55:00,513 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-05.c_Iteration1_Loop [2024-10-13 16:55:00,513 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:55:00,514 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:55:00,525 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:55:00,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:55:00,610 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:55:00,611 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:55:00,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:00,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:00,614 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-10-13 16:55:00,615 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-10-13 16:55:00,616 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:55:00,616 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:55:00,648 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-10-13 16:55:00,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:00,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:00,650 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-10-13 16:55:00,652 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-10-13 16:55:00,652 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:55:00,653 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:55:00,687 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:55:00,695 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-10-13 16:55:00,695 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:55:00,695 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:55:00,695 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:55:00,695 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:55:00,696 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:55:00,696 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:00,697 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:55:00,697 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:55:00,697 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-05.c_Iteration1_Loop [2024-10-13 16:55:00,697 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:55:00,697 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:55:00,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:55:00,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:55:00,749 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:55:00,753 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:55:00,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:00,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:00,756 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-10-13 16:55:00,757 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-10-13 16:55:00,758 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-10-13 16:55:00,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:00,769 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:55:00,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:00,769 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-13 16:55:00,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:00,771 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-13 16:55:00,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:55:00,775 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:00,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-13 16:55:00,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:00,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:00,788 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-10-13 16:55:00,791 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-10-13 16:55:00,792 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-10-13 16:55:00,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:00,803 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:55:00,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:00,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:00,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:00,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:55:00,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:55:00,809 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:55:00,813 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-10-13 16:55:00,813 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 16:55:00,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:00,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:00,849 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-10-13 16:55:00,856 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-10-13 16:55:00,859 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:55:00,860 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:55:00,860 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:55:00,861 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-10-13 16:55:00,872 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-10-13 16:55:00,875 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:55:00,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:55:00,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:55:00,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:55:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:55:00,916 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 16:55:00,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:55:00,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:55:00,956 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-10-13 16:55:00,958 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-10-13 16:55:00,993 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 29 states and 42 transitions. Complement of second has 6 states. [2024-10-13 16:55:00,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-13 16:55:00,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-10-13 16:55:00,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2024-10-13 16:55:01,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 2 letters. Loop has 2 letters. [2024-10-13 16:55:01,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:55:01,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 2 letters. [2024-10-13 16:55:01,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:55:01,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 2 letters. Loop has 4 letters. [2024-10-13 16:55:01,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:55:01,002 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 42 transitions. [2024-10-13 16:55:01,004 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-13 16:55:01,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 16 states and 23 transitions. [2024-10-13 16:55:01,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-10-13 16:55:01,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-13 16:55:01,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 23 transitions. [2024-10-13 16:55:01,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:55:01,007 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 23 transitions. [2024-10-13 16:55:01,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 23 transitions. [2024-10-13 16:55:01,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 12. [2024-10-13 16:55:01,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 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-10-13 16:55:01,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2024-10-13 16:55:01,026 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2024-10-13 16:55:01,026 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2024-10-13 16:55:01,027 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-13 16:55:01,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2024-10-13 16:55:01,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-13 16:55:01,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:55:01,027 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:55:01,027 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-13 16:55:01,028 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 16:55:01,028 INFO L745 eck$LassoCheckResult]: Stem: 85#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 86#L-1 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; 88#L20-2 assume !!(main_~x~0#1 > 0); 81#L20 assume 1 == main_~y~0#1; 82#L21 [2024-10-13 16:55:01,028 INFO L747 eck$LassoCheckResult]: Loop: 82#L21 assume 0 == main_~y~0#1 || main_~y~0#1 == 1 + main_~y~0#1;main_#t~bitwise1#1 := 1 + main_~y~0#1; 83#L21-5 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; 77#L20-2 assume !!(main_~x~0#1 > 0); 78#L20 assume 1 == main_~y~0#1; 82#L21 [2024-10-13 16:55:01,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:01,028 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2024-10-13 16:55:01,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:55:01,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925159666] [2024-10-13 16:55:01,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:55:01,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:55:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:55:01,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:55:01,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:55:01,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925159666] [2024-10-13 16:55:01,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925159666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:55:01,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:55:01,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 16:55:01,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788025494] [2024-10-13 16:55:01,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:55:01,059 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:55:01,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:01,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1456270, now seen corresponding path program 1 times [2024-10-13 16:55:01,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:55:01,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972808868] [2024-10-13 16:55:01,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:55:01,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:55:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:55:01,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:55:01,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:55:01,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972808868] [2024-10-13 16:55:01,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972808868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:55:01,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:55:01,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 16:55:01,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852782240] [2024-10-13 16:55:01,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:55:01,078 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:55:01,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:55:01,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:55:01,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:55:01,081 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-10-13 16:55:01,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:55:01,096 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2024-10-13 16:55:01,096 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2024-10-13 16:55:01,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-10-13 16:55:01,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 20 transitions. [2024-10-13 16:55:01,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-10-13 16:55:01,097 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-10-13 16:55:01,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2024-10-13 16:55:01,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:55:01,098 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-10-13 16:55:01,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2024-10-13 16:55:01,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-10-13 16:55:01,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 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-10-13 16:55:01,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2024-10-13 16:55:01,099 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-10-13 16:55:01,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:55:01,101 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-10-13 16:55:01,101 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-13 16:55:01,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2024-10-13 16:55:01,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-10-13 16:55:01,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:55:01,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:55:01,103 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2024-10-13 16:55:01,103 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1] [2024-10-13 16:55:01,104 INFO L745 eck$LassoCheckResult]: Stem: 121#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 122#L-1 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; 125#L20-2 assume !!(main_~x~0#1 > 0); 116#L20 assume !(1 == main_~y~0#1);main_~y~0#1 := 1;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; 115#L20-2 assume !!(main_~x~0#1 > 0); 117#L20 assume 1 == main_~y~0#1; 118#L21 [2024-10-13 16:55:01,104 INFO L747 eck$LassoCheckResult]: Loop: 118#L21 assume 0 == main_~y~0#1 || main_~y~0#1 == 1 + main_~y~0#1;main_#t~bitwise1#1 := 1 + main_~y~0#1; 119#L21-5 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; 127#L20-2 assume !!(main_~x~0#1 > 0); 126#L20 assume !(1 == main_~y~0#1);main_~y~0#1 := 1;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; 113#L20-2 assume !!(main_~x~0#1 > 0); 114#L20 assume 1 == main_~y~0#1; 118#L21 [2024-10-13 16:55:01,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:01,104 INFO L85 PathProgramCache]: Analyzing trace with hash 889706648, now seen corresponding path program 1 times [2024-10-13 16:55:01,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:55:01,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346002075] [2024-10-13 16:55:01,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:55:01,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:55:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:01,116 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:55:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:01,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:55:01,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:01,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1399490240, now seen corresponding path program 1 times [2024-10-13 16:55:01,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:55:01,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106503762] [2024-10-13 16:55:01,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:55:01,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:55:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:55:01,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:55:01,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:55:01,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106503762] [2024-10-13 16:55:01,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106503762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:55:01,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:55:01,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 16:55:01,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487791116] [2024-10-13 16:55:01,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:55:01,185 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:55:01,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:55:01,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 16:55:01,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 16:55:01,186 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 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-10-13 16:55:01,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:55:01,206 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2024-10-13 16:55:01,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2024-10-13 16:55:01,207 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-13 16:55:01,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 12 states and 14 transitions. [2024-10-13 16:55:01,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-13 16:55:01,207 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-13 16:55:01,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 14 transitions. [2024-10-13 16:55:01,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:55:01,208 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 14 transitions. [2024-10-13 16:55:01,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 14 transitions. [2024-10-13 16:55:01,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-10-13 16:55:01,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 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-10-13 16:55:01,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2024-10-13 16:55:01,209 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 14 transitions. [2024-10-13 16:55:01,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 16:55:01,210 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2024-10-13 16:55:01,210 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-13 16:55:01,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2024-10-13 16:55:01,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-13 16:55:01,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:55:01,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:55:01,211 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2024-10-13 16:55:01,211 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-13 16:55:01,211 INFO L745 eck$LassoCheckResult]: Stem: 159#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 160#L-1 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; 163#L20-2 assume !!(main_~x~0#1 > 0); 155#L20 assume !(1 == main_~y~0#1);main_~y~0#1 := 1;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; 154#L20-2 assume !!(main_~x~0#1 > 0); 156#L20 assume 1 == main_~y~0#1; 157#L21 [2024-10-13 16:55:01,211 INFO L747 eck$LassoCheckResult]: Loop: 157#L21 assume !(0 == main_~y~0#1 || main_~y~0#1 == 1 + main_~y~0#1); 158#L21-2 assume !(0 == 1 + main_~y~0#1); 161#L21-4 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; 162#L21-5 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; 152#L20-2 assume !!(main_~x~0#1 > 0); 153#L20 assume 1 == main_~y~0#1; 157#L21 [2024-10-13 16:55:01,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:01,212 INFO L85 PathProgramCache]: Analyzing trace with hash 889706648, now seen corresponding path program 2 times [2024-10-13 16:55:01,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:55:01,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737875279] [2024-10-13 16:55:01,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:55:01,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:55:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:01,216 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:55:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:01,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:55:01,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:01,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1454393131, now seen corresponding path program 1 times [2024-10-13 16:55:01,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:55:01,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591567986] [2024-10-13 16:55:01,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:55:01,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:55:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:01,229 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:55:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:01,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:55:01,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:01,234 INFO L85 PathProgramCache]: Analyzing trace with hash -532475262, now seen corresponding path program 1 times [2024-10-13 16:55:01,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:55:01,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114537749] [2024-10-13 16:55:01,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:55:01,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:55:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:01,240 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:55:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:01,246 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:55:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:01,338 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:55:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:01,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.10 04:55:01 BoogieIcfgContainer [2024-10-13 16:55:01,349 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-13 16:55:01,350 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 16:55:01,350 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 16:55:01,350 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 16:55:01,350 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:55:00" (3/4) ... [2024-10-13 16:55:01,352 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 16:55:01,353 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 16:55:01,353 INFO L158 Benchmark]: Toolchain (without parser) took 1603.68ms. Allocated memory is still 180.4MB. Free memory was 110.7MB in the beginning and 79.1MB in the end (delta: 31.7MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2024-10-13 16:55:01,353 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 180.4MB. Free memory is still 137.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 16:55:01,354 INFO L158 Benchmark]: CACSL2BoogieTranslator took 159.49ms. Allocated memory is still 180.4MB. Free memory was 110.5MB in the beginning and 99.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 16:55:01,354 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.32ms. Allocated memory is still 180.4MB. Free memory was 99.6MB in the beginning and 98.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 16:55:01,354 INFO L158 Benchmark]: Boogie Preprocessor took 20.59ms. Allocated memory is still 180.4MB. Free memory was 98.1MB in the beginning and 96.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 16:55:01,355 INFO L158 Benchmark]: RCFGBuilder took 301.97ms. Allocated memory is still 180.4MB. Free memory was 96.8MB in the beginning and 146.5MB in the end (delta: -49.7MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2024-10-13 16:55:01,355 INFO L158 Benchmark]: BuchiAutomizer took 1094.87ms. Allocated memory is still 180.4MB. Free memory was 146.5MB in the beginning and 79.4MB in the end (delta: 67.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2024-10-13 16:55:01,355 INFO L158 Benchmark]: Witness Printer took 3.06ms. Allocated memory is still 180.4MB. Free memory was 79.4MB in the beginning and 79.1MB in the end (delta: 334.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 16:55:01,357 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.10ms. Allocated memory is still 180.4MB. Free memory is still 137.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 159.49ms. Allocated memory is still 180.4MB. Free memory was 110.5MB in the beginning and 99.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.32ms. Allocated memory is still 180.4MB. Free memory was 99.6MB in the beginning and 98.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.59ms. Allocated memory is still 180.4MB. Free memory was 98.1MB in the beginning and 96.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 301.97ms. Allocated memory is still 180.4MB. Free memory was 96.8MB in the beginning and 146.5MB in the end (delta: -49.7MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 1094.87ms. Allocated memory is still 180.4MB. Free memory was 146.5MB in the beginning and 79.4MB in the end (delta: 67.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Witness Printer took 3.06ms. Allocated memory is still 180.4MB. Free memory was 79.4MB in the beginning and 79.1MB in the end (delta: 334.4kB). 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 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic) and one module whose termination is unknown.One deterministic module has affine ranking function x and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.0s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 0.8s. 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 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 5 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, 15 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37 IncrementalHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 28 mSDtfsCounter, 37 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 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: 21ms 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 { :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 !!(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 !!(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 !!(main_~x~0#1 > 0);" "assume 1 == main_~y~0#1;" RESULT: Ultimate could not prove your program: unable to determine termination [2024-10-13 16:55:01,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-10-13 16:55:01,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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