./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/cggmp2005b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/cggmp2005b.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5a85ef4e6caed20a9aa6e00fcf3a476ebe3f071202fc083a4545018fb19b4c9c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 00:45:59,554 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:45:59,626 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-12 00:45:59,631 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:45:59,632 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:45:59,654 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:45:59,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:45:59,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:45:59,656 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:45:59,658 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:45:59,658 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:45:59,658 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:45:59,659 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:45:59,659 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:45:59,659 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:45:59,660 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:45:59,661 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:45:59,661 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:45:59,661 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:45:59,661 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:45:59,661 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:45:59,662 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 00:45:59,662 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:45:59,662 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 00:45:59,663 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:45:59,663 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:45:59,663 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:45:59,663 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:45:59,663 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:45:59,664 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:45:59,664 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 00:45:59,664 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:45:59,664 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:45:59,664 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:45:59,665 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:45:59,665 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:45:59,665 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:45:59,665 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:45:59,666 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:45:59,666 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-clean/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-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5a85ef4e6caed20a9aa6e00fcf3a476ebe3f071202fc083a4545018fb19b4c9c [2024-10-12 00:45:59,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:45:59,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:45:59,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:45:59,878 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:45:59,878 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:45:59,879 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/cggmp2005b.i [2024-10-12 00:46:01,049 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:46:01,191 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:46:01,192 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/cggmp2005b.i [2024-10-12 00:46:01,197 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7d34a64d2/8fb524a4d0384b2fbee51b997965a9a1/FLAG4fed186c2 [2024-10-12 00:46:01,616 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7d34a64d2/8fb524a4d0384b2fbee51b997965a9a1 [2024-10-12 00:46:01,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:46:01,621 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:46:01,623 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:46:01,624 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:46:01,629 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:46:01,630 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:46:01" (1/1) ... [2024-10-12 00:46:01,631 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c402711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:01, skipping insertion in model container [2024-10-12 00:46:01,631 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:46:01" (1/1) ... [2024-10-12 00:46:01,647 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:46:01,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:46:01,823 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:46:01,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:46:01,868 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:46:01,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:01 WrapperNode [2024-10-12 00:46:01,869 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:46:01,870 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:46:01,870 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:46:01,870 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:46:01,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:01" (1/1) ... [2024-10-12 00:46:01,880 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:01" (1/1) ... [2024-10-12 00:46:01,893 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 41 [2024-10-12 00:46:01,893 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:46:01,894 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:46:01,894 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:46:01,894 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:46:01,900 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:01" (1/1) ... [2024-10-12 00:46:01,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:01" (1/1) ... [2024-10-12 00:46:01,901 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:01" (1/1) ... [2024-10-12 00:46:01,908 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 00:46:01,908 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:01" (1/1) ... [2024-10-12 00:46:01,909 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:01" (1/1) ... [2024-10-12 00:46:01,910 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:01" (1/1) ... [2024-10-12 00:46:01,912 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:01" (1/1) ... [2024-10-12 00:46:01,912 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:01" (1/1) ... [2024-10-12 00:46:01,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:01" (1/1) ... [2024-10-12 00:46:01,914 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:46:01,914 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:46:01,914 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:46:01,914 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:46:01,915 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:01" (1/1) ... [2024-10-12 00:46:01,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:01,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:01,941 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:01,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 00:46:01,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 00:46:01,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 00:46:01,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:46:01,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:46:02,020 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:46:02,022 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:46:02,090 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-10-12 00:46:02,090 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:46:02,098 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:46:02,098 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-12 00:46:02,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:46:02 BoogieIcfgContainer [2024-10-12 00:46:02,098 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:46:02,099 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:46:02,099 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:46:02,106 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:46:02,106 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:46:02,107 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:46:01" (1/3) ... [2024-10-12 00:46:02,108 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2fce3ae8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:46:02, skipping insertion in model container [2024-10-12 00:46:02,108 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:46:02,108 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:01" (2/3) ... [2024-10-12 00:46:02,109 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2fce3ae8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:46:02, skipping insertion in model container [2024-10-12 00:46:02,109 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:46:02,109 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:46:02" (3/3) ... [2024-10-12 00:46:02,110 INFO L332 chiAutomizerObserver]: Analyzing ICFG cggmp2005b.i [2024-10-12 00:46:02,154 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:46:02,154 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:46:02,155 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:46:02,155 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:46:02,155 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:46:02,155 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:46:02,156 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:46:02,156 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:46:02,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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-12 00:46:02,172 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:46:02,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:46:02,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:46:02,176 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:46:02,176 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:46:02,176 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:46:02,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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-12 00:46:02,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:46:02,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:46:02,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:46:02,178 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:46:02,178 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:46:02,183 INFO L745 eck$LassoCheckResult]: Stem: 10#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 4#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1, main_~k~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~i~0#1 := 0;main_~k~0#1 := 9;main_~j~0#1 := -100; 5#L35-3true [2024-10-12 00:46:02,183 INFO L747 eck$LassoCheckResult]: Loop: 5#L35-3true assume !!(main_~i~0#1 <= 100);main_~i~0#1 := 1 + main_~i~0#1; 12#L31-2true assume !(main_~j~0#1 < 20); 6#L31-3true main_~k~0#1 := 4; 11#L35-2true assume !true; 5#L35-3true [2024-10-12 00:46:02,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:02,187 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-12 00:46:02,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:02,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521941228] [2024-10-12 00:46:02,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:02,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:02,254 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:02,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:02,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:02,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1269299, now seen corresponding path program 1 times [2024-10-12 00:46:02,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:02,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096869731] [2024-10-12 00:46:02,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:02,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:02,308 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-12 00:46:02,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:46:02,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096869731] [2024-10-12 00:46:02,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096869731] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:46:02,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:46:02,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-12 00:46:02,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57205398] [2024-10-12 00:46:02,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:46:02,312 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:46:02,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:46:02,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 00:46:02,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 00:46:02,336 INFO L87 Difference]: Start difference. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 4.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-12 00:46:02,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:46:02,339 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2024-10-12 00:46:02,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2024-10-12 00:46:02,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:46:02,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 6 states and 8 transitions. [2024-10-12 00:46:02,343 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-10-12 00:46:02,343 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-10-12 00:46:02,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 8 transitions. [2024-10-12 00:46:02,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:46:02,344 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6 states and 8 transitions. [2024-10-12 00:46:02,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 8 transitions. [2024-10-12 00:46:02,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2024-10-12 00:46:02,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 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-12 00:46:02,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2024-10-12 00:46:02,360 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6 states and 8 transitions. [2024-10-12 00:46:02,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 00:46:02,363 INFO L425 stractBuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2024-10-12 00:46:02,363 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:46:02,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. [2024-10-12 00:46:02,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:46:02,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:46:02,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:46:02,364 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:46:02,364 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:46:02,364 INFO L745 eck$LassoCheckResult]: Stem: 37#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 38#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1, main_~k~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~i~0#1 := 0;main_~k~0#1 := 9;main_~j~0#1 := -100; 40#L35-3 [2024-10-12 00:46:02,364 INFO L747 eck$LassoCheckResult]: Loop: 40#L35-3 assume !!(main_~i~0#1 <= 100);main_~i~0#1 := 1 + main_~i~0#1; 41#L31-2 assume !(main_~j~0#1 < 20); 42#L31-3 main_~k~0#1 := 4; 39#L35-2 assume !(main_~k~0#1 <= 3); 40#L35-3 [2024-10-12 00:46:02,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:02,364 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-10-12 00:46:02,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:02,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783813886] [2024-10-12 00:46:02,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:02,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:02,370 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:02,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:02,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:02,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1269295, now seen corresponding path program 1 times [2024-10-12 00:46:02,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:02,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517003355] [2024-10-12 00:46:02,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:02,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:02,387 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:02,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:02,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:02,393 INFO L85 PathProgramCache]: Analyzing trace with hash 889696497, now seen corresponding path program 1 times [2024-10-12 00:46:02,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:02,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873866990] [2024-10-12 00:46:02,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:02,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:02,439 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-12 00:46:02,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:46:02,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873866990] [2024-10-12 00:46:02,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873866990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:46:02,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:46:02,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:46:02,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723110608] [2024-10-12 00:46:02,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:46:02,523 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:46:02,523 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:46:02,523 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:46:02,523 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:46:02,523 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:46:02,523 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:02,524 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:46:02,524 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:46:02,524 INFO L132 ssoRankerPreferences]: Filename of dumped script: cggmp2005b.i_Iteration2_Loop [2024-10-12 00:46:02,524 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:46:02,524 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:46:02,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:02,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:02,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:02,602 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:46:02,602 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:46:02,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:02,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:02,607 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:02,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-12 00:46:02,610 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:46:02,610 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:46:02,631 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:46:02,632 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0#1=20} Honda state: {ULTIMATE.start_main_~j~0#1=20} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:46:02,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-12 00:46:02,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:02,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:02,644 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:02,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-12 00:46:02,645 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:46:02,645 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:46:02,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-12 00:46:02,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:02,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:02,672 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:02,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-12 00:46:02,674 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:46:02,674 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:46:02,703 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:46:02,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:02,708 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:46:02,708 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:46:02,708 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:46:02,708 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:46:02,708 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:46:02,709 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:02,709 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:46:02,709 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:46:02,709 INFO L132 ssoRankerPreferences]: Filename of dumped script: cggmp2005b.i_Iteration2_Loop [2024-10-12 00:46:02,709 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:46:02,709 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:46:02,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:02,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:02,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:02,749 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:46:02,752 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:46:02,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:02,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:02,755 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:02,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 00:46:02,769 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-12 00:46:02,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:46:02,781 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:46:02,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:46:02,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:46:02,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:46:02,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:46:02,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:46:02,786 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:46:02,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-12 00:46:02,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:02,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:02,801 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:02,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-12 00:46:02,803 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-12 00:46:02,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:46:02,814 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:46:02,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:46:02,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:46:02,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:46:02,815 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:46:02,815 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:46:02,819 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:46:02,821 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:46:02,821 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:46:02,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:02,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:02,843 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:02,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-12 00:46:02,852 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:46:02,853 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:46:02,853 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:46:02,853 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 201 Supporting invariants [] [2024-10-12 00:46:02,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:02,869 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:46:02,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:02,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:46:02,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:02,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:46:02,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:02,956 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-12 00:46:02,959 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-12 00:46:02,961 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-12 00:46:02,983 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Result 14 states and 21 transitions. Complement of second has 4 states. [2024-10-12 00:46:02,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 00:46:02,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-12 00:46:02,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2024-10-12 00:46:02,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 2 letters. Loop has 4 letters. [2024-10-12 00:46:02,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:02,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 4 letters. [2024-10-12 00:46:02,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:02,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 2 letters. Loop has 8 letters. [2024-10-12 00:46:02,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:02,988 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 21 transitions. [2024-10-12 00:46:02,989 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2024-10-12 00:46:02,989 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 13 states and 20 transitions. [2024-10-12 00:46:02,989 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-10-12 00:46:02,989 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-10-12 00:46:02,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 20 transitions. [2024-10-12 00:46:02,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:46:02,990 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 20 transitions. [2024-10-12 00:46:02,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 20 transitions. [2024-10-12 00:46:02,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2024-10-12 00:46:02,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 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-12 00:46:02,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2024-10-12 00:46:02,991 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 17 transitions. [2024-10-12 00:46:02,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:46:02,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:46:02,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:46:02,992 INFO L87 Difference]: Start difference. First operand 11 states and 17 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-12 00:46:02,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:46:02,995 INFO L93 Difference]: Finished difference Result 12 states and 19 transitions. [2024-10-12 00:46:02,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 19 transitions. [2024-10-12 00:46:02,996 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2024-10-12 00:46:02,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 19 transitions. [2024-10-12 00:46:02,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-10-12 00:46:02,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-10-12 00:46:02,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 19 transitions. [2024-10-12 00:46:02,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:46:02,997 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 19 transitions. [2024-10-12 00:46:02,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 19 transitions. [2024-10-12 00:46:02,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-10-12 00:46:03,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 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-12 00:46:03,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 19 transitions. [2024-10-12 00:46:03,000 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 19 transitions. [2024-10-12 00:46:03,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:46:03,001 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 19 transitions. [2024-10-12 00:46:03,001 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:46:03,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 19 transitions. [2024-10-12 00:46:03,002 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2024-10-12 00:46:03,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:46:03,002 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:46:03,002 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:46:03,002 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-10-12 00:46:03,002 INFO L745 eck$LassoCheckResult]: Stem: 118#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 119#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1, main_~k~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~i~0#1 := 0;main_~k~0#1 := 9;main_~j~0#1 := -100; 127#L35-3 assume !!(main_~i~0#1 <= 100);main_~i~0#1 := 1 + main_~i~0#1; 128#L31-2 assume !!(main_~j~0#1 < 20);main_~j~0#1 := main_~i~0#1 + main_~j~0#1; 123#L31-2 [2024-10-12 00:46:03,002 INFO L747 eck$LassoCheckResult]: Loop: 123#L31-2 assume !!(main_~j~0#1 < 20);main_~j~0#1 := main_~i~0#1 + main_~j~0#1; 123#L31-2 [2024-10-12 00:46:03,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:03,003 INFO L85 PathProgramCache]: Analyzing trace with hash 925804, now seen corresponding path program 1 times [2024-10-12 00:46:03,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:03,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578980966] [2024-10-12 00:46:03,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:03,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:03,010 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:03,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:03,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:03,015 INFO L85 PathProgramCache]: Analyzing trace with hash 51, now seen corresponding path program 1 times [2024-10-12 00:46:03,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:03,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381183564] [2024-10-12 00:46:03,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:03,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:03,017 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:03,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:03,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:03,019 INFO L85 PathProgramCache]: Analyzing trace with hash 28699944, now seen corresponding path program 2 times [2024-10-12 00:46:03,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:03,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711370655] [2024-10-12 00:46:03,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:03,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:03,026 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:03,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:03,151 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:46:03,151 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:46:03,151 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:46:03,151 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:46:03,151 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:46:03,151 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:03,151 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:46:03,151 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:46:03,152 INFO L132 ssoRankerPreferences]: Filename of dumped script: cggmp2005b.i_Iteration3_Lasso [2024-10-12 00:46:03,152 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:46:03,152 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:46:03,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:03,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:03,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:03,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:03,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:03,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:03,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:03,286 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:46:03,286 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:46:03,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:03,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:03,289 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:03,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-12 00:46:03,291 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-12 00:46:03,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:46:03,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:46:03,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:46:03,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:46:03,306 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:46:03,307 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:46:03,311 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:46:03,319 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-10-12 00:46:03,319 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2024-10-12 00:46:03,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:03,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:03,321 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:03,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-12 00:46:03,323 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:46:03,335 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-10-12 00:46:03,335 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:46:03,335 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~j~0#1) = 39*ULTIMATE.start_main_~i~0#1 - 2*ULTIMATE.start_main_~j~0#1 Supporting invariants [1*ULTIMATE.start_main_~i~0#1 - 1 >= 0] [2024-10-12 00:46:03,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-12 00:46:03,351 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2024-10-12 00:46:03,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:03,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:46:03,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:03,401 WARN L253 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 00:46:03,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:03,401 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-12 00:46:03,402 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 1 loop predicates [2024-10-12 00:46:03,402 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 19 transitions. cyclomatic complexity: 10 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-10-12 00:46:03,428 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 19 transitions. cyclomatic complexity: 10. 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 25 states and 39 transitions. Complement of second has 7 states. [2024-10-12 00:46:03,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 00:46:03,429 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-10-12 00:46:03,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2024-10-12 00:46:03,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 4 letters. Loop has 1 letters. [2024-10-12 00:46:03,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:03,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 5 letters. Loop has 1 letters. [2024-10-12 00:46:03,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:03,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 4 letters. Loop has 2 letters. [2024-10-12 00:46:03,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:03,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 39 transitions. [2024-10-12 00:46:03,431 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2024-10-12 00:46:03,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 20 states and 31 transitions. [2024-10-12 00:46:03,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-10-12 00:46:03,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-10-12 00:46:03,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 31 transitions. [2024-10-12 00:46:03,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:46:03,432 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 31 transitions. [2024-10-12 00:46:03,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 31 transitions. [2024-10-12 00:46:03,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2024-10-12 00:46:03,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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-10-12 00:46:03,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 23 transitions. [2024-10-12 00:46:03,434 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2024-10-12 00:46:03,434 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 23 transitions. [2024-10-12 00:46:03,434 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:46:03,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 23 transitions. [2024-10-12 00:46:03,434 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2024-10-12 00:46:03,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:46:03,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:46:03,436 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-12 00:46:03,437 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-10-12 00:46:03,437 INFO L745 eck$LassoCheckResult]: Stem: 207#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 208#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1, main_~k~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~i~0#1 := 0;main_~k~0#1 := 9;main_~j~0#1 := -100; 215#L35-3 assume !!(main_~i~0#1 <= 100);main_~i~0#1 := 1 + main_~i~0#1; 216#L31-2 assume !!(main_~j~0#1 < 20);main_~j~0#1 := main_~i~0#1 + main_~j~0#1; 212#L31-2 assume !(main_~j~0#1 < 20); 213#L31-3 main_~k~0#1 := 4; 209#L35-2 [2024-10-12 00:46:03,437 INFO L747 eck$LassoCheckResult]: Loop: 209#L35-2 assume !!(main_~k~0#1 <= 3);main_~k~0#1 := 1 + main_~k~0#1; 209#L35-2 [2024-10-12 00:46:03,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:03,437 INFO L85 PathProgramCache]: Analyzing trace with hash 889698226, now seen corresponding path program 1 times [2024-10-12 00:46:03,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:03,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146935534] [2024-10-12 00:46:03,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:03,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:03,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:46:03,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:46:03,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146935534] [2024-10-12 00:46:03,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146935534] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:46:03,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605303978] [2024-10-12 00:46:03,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:03,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:46:03,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:03,483 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:46:03,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-12 00:46:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:03,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 00:46:03,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:03,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:46:03,532 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:46:03,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:46:03,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605303978] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:46:03,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:46:03,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-12 00:46:03,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778340587] [2024-10-12 00:46:03,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:46:03,559 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:46:03,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:03,559 INFO L85 PathProgramCache]: Analyzing trace with hash 64, now seen corresponding path program 1 times [2024-10-12 00:46:03,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:03,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407971360] [2024-10-12 00:46:03,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:03,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:03,564 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:03,567 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:03,578 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:46:03,578 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:46:03,578 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:46:03,578 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:46:03,578 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:46:03,579 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:03,579 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:46:03,579 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:46:03,579 INFO L132 ssoRankerPreferences]: Filename of dumped script: cggmp2005b.i_Iteration4_Loop [2024-10-12 00:46:03,579 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:46:03,579 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:46:03,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:03,603 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:46:03,603 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:46:03,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:03,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:03,605 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:03,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-12 00:46:03,607 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:46:03,607 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:46:03,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-12 00:46:03,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:03,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:03,629 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:03,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-12 00:46:03,631 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:46:03,631 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:46:03,660 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:46:03,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:03,665 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:46:03,665 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:46:03,665 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:46:03,665 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:46:03,665 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:46:03,665 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:03,665 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:46:03,665 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:46:03,665 INFO L132 ssoRankerPreferences]: Filename of dumped script: cggmp2005b.i_Iteration4_Loop [2024-10-12 00:46:03,665 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:46:03,665 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:46:03,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:03,689 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:46:03,689 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:46:03,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:03,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:03,691 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:03,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-12 00:46:03,705 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-12 00:46:03,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-12 00:46:03,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:46:03,724 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:46:03,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:46:03,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:46:03,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:46:03,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:46:03,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:46:03,732 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:46:03,734 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:46:03,735 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:46:03,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:03,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:03,737 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:03,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-12 00:46:03,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-12 00:46:03,752 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:46:03,753 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:46:03,753 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:46:03,753 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 7 Supporting invariants [] [2024-10-12 00:46:03,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-12 00:46:03,772 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:46:03,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:03,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:46:03,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:03,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:03,803 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:46:03,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:03,803 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-12 00:46:03,804 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-10-12 00:46:03,804 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 23 transitions. cyclomatic complexity: 13 Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-12 00:46:03,813 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 23 transitions. cyclomatic complexity: 13. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 34 states and 54 transitions. Complement of second has 5 states. [2024-10-12 00:46:03,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 00:46:03,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-12 00:46:03,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2024-10-12 00:46:03,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 1 letters. [2024-10-12 00:46:03,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:03,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 7 letters. Loop has 1 letters. [2024-10-12 00:46:03,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:03,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. [2024-10-12 00:46:03,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:03,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 54 transitions. [2024-10-12 00:46:03,816 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2024-10-12 00:46:03,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 21 states and 34 transitions. [2024-10-12 00:46:03,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-10-12 00:46:03,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-10-12 00:46:03,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 34 transitions. [2024-10-12 00:46:03,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:46:03,816 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 34 transitions. [2024-10-12 00:46:03,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 34 transitions. [2024-10-12 00:46:03,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 12. [2024-10-12 00:46:03,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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-12 00:46:03,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2024-10-12 00:46:03,818 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 18 transitions. [2024-10-12 00:46:03,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:46:03,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 00:46:03,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-10-12 00:46:03,819 INFO L87 Difference]: Start difference. First operand 12 states and 18 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:46:03,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:46:03,841 INFO L93 Difference]: Finished difference Result 14 states and 20 transitions. [2024-10-12 00:46:03,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 20 transitions. [2024-10-12 00:46:03,842 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2024-10-12 00:46:03,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 20 transitions. [2024-10-12 00:46:03,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-10-12 00:46:03,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-10-12 00:46:03,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2024-10-12 00:46:03,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:46:03,843 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 20 transitions. [2024-10-12 00:46:03,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2024-10-12 00:46:03,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-12 00:46:03,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 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-10-12 00:46:03,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2024-10-12 00:46:03,844 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 20 transitions. [2024-10-12 00:46:03,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 00:46:03,845 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2024-10-12 00:46:03,845 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:46:03,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2024-10-12 00:46:03,846 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2024-10-12 00:46:03,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:46:03,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:46:03,847 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 2, 1, 1, 1, 1, 1] [2024-10-12 00:46:03,847 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-10-12 00:46:03,847 INFO L745 eck$LassoCheckResult]: Stem: 359#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 360#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1, main_~k~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~i~0#1 := 0;main_~k~0#1 := 9;main_~j~0#1 := -100; 368#L35-3 assume !!(main_~i~0#1 <= 100);main_~i~0#1 := 1 + main_~i~0#1; 366#L31-2 assume !!(main_~j~0#1 < 20);main_~j~0#1 := main_~i~0#1 + main_~j~0#1; 367#L31-2 assume !!(main_~j~0#1 < 20);main_~j~0#1 := main_~i~0#1 + main_~j~0#1; 372#L31-2 assume !!(main_~j~0#1 < 20);main_~j~0#1 := main_~i~0#1 + main_~j~0#1; 371#L31-2 assume !(main_~j~0#1 < 20); 369#L31-3 main_~k~0#1 := 4; 362#L35-2 assume !(main_~k~0#1 <= 3); 363#L35-3 assume !!(main_~i~0#1 <= 100);main_~i~0#1 := 1 + main_~i~0#1; 370#L31-2 assume !!(main_~j~0#1 < 20);main_~j~0#1 := main_~i~0#1 + main_~j~0#1; 364#L31-2 [2024-10-12 00:46:03,847 INFO L747 eck$LassoCheckResult]: Loop: 364#L31-2 assume !!(main_~j~0#1 < 20);main_~j~0#1 := main_~i~0#1 + main_~j~0#1; 364#L31-2 [2024-10-12 00:46:03,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:03,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1309449898, now seen corresponding path program 1 times [2024-10-12 00:46:03,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:03,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716258387] [2024-10-12 00:46:03,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:03,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:03,888 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 00:46:03,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:46:03,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716258387] [2024-10-12 00:46:03,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716258387] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:46:03,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:46:03,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 00:46:03,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443117043] [2024-10-12 00:46:03,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:46:03,889 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:46:03,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:03,892 INFO L85 PathProgramCache]: Analyzing trace with hash 51, now seen corresponding path program 2 times [2024-10-12 00:46:03,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:03,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964074322] [2024-10-12 00:46:03,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:03,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:03,895 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:03,897 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:03,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:46:03,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:46:03,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:46:03,910 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. cyclomatic complexity: 9 Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:46:03,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:46:03,913 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2024-10-12 00:46:03,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2024-10-12 00:46:03,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-10-12 00:46:03,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2024-10-12 00:46:03,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-10-12 00:46:03,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-10-12 00:46:03,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2024-10-12 00:46:03,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:46:03,914 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-10-12 00:46:03,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2024-10-12 00:46:03,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-10-12 00:46:03,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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-12 00:46:03,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2024-10-12 00:46:03,915 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-10-12 00:46:03,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:46:03,919 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-10-12 00:46:03,919 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 00:46:03,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2024-10-12 00:46:03,919 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-10-12 00:46:03,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:46:03,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:46:03,919 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1] [2024-10-12 00:46:03,919 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-10-12 00:46:03,920 INFO L745 eck$LassoCheckResult]: Stem: 392#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 393#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1, main_~k~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~i~0#1 := 0;main_~k~0#1 := 9;main_~j~0#1 := -100; 399#L35-3 assume !!(main_~i~0#1 <= 100);main_~i~0#1 := 1 + main_~i~0#1; 397#L31-2 assume !!(main_~j~0#1 < 20);main_~j~0#1 := main_~i~0#1 + main_~j~0#1; 398#L31-2 assume !!(main_~j~0#1 < 20);main_~j~0#1 := main_~i~0#1 + main_~j~0#1; 404#L31-2 assume !!(main_~j~0#1 < 20);main_~j~0#1 := main_~i~0#1 + main_~j~0#1; 403#L31-2 assume !(main_~j~0#1 < 20); 401#L31-3 main_~k~0#1 := 4; 395#L35-2 assume !(main_~k~0#1 <= 3); 396#L35-3 assume !!(main_~i~0#1 <= 100);main_~i~0#1 := 1 + main_~i~0#1; 402#L31-2 assume !(main_~j~0#1 < 20); 400#L31-3 main_~k~0#1 := 4; 394#L35-2 [2024-10-12 00:46:03,920 INFO L747 eck$LassoCheckResult]: Loop: 394#L35-2 assume !!(main_~k~0#1 <= 3);main_~k~0#1 := 1 + main_~k~0#1; 394#L35-2 [2024-10-12 00:46:03,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:03,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1938241212, now seen corresponding path program 2 times [2024-10-12 00:46:03,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:03,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216334387] [2024-10-12 00:46:03,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:03,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:03,996 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 00:46:03,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:46:03,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216334387] [2024-10-12 00:46:03,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216334387] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:46:03,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26953352] [2024-10-12 00:46:03,997 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:46:03,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:46:03,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:03,998 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:46:03,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-12 00:46:04,032 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:46:04,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:46:04,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 00:46:04,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:04,103 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 00:46:04,104 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:46:04,167 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 00:46:04,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26953352] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:46:04,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:46:04,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-10-12 00:46:04,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732462337] [2024-10-12 00:46:04,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:46:04,168 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:46:04,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:04,169 INFO L85 PathProgramCache]: Analyzing trace with hash 64, now seen corresponding path program 2 times [2024-10-12 00:46:04,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:04,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844101652] [2024-10-12 00:46:04,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:04,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:04,173 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:04,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:04,185 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:46:04,185 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:46:04,185 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:46:04,185 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:46:04,186 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:46:04,186 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:04,186 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:46:04,186 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:46:04,186 INFO L132 ssoRankerPreferences]: Filename of dumped script: cggmp2005b.i_Iteration6_Loop [2024-10-12 00:46:04,186 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:46:04,186 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:46:04,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:04,199 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:46:04,200 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:46:04,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:04,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:04,201 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:04,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-12 00:46:04,207 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:46:04,207 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:46:04,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-10-12 00:46:04,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:04,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:04,229 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:04,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-12 00:46:04,231 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:46:04,231 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:46:04,258 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:46:04,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-10-12 00:46:04,263 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:46:04,263 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:46:04,263 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:46:04,263 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:46:04,263 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:46:04,263 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:04,263 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:46:04,263 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:46:04,263 INFO L132 ssoRankerPreferences]: Filename of dumped script: cggmp2005b.i_Iteration6_Loop [2024-10-12 00:46:04,263 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:46:04,263 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:46:04,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:04,279 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:46:04,279 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:46:04,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:04,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:04,281 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:04,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-12 00:46:04,283 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-12 00:46:04,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:46:04,292 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:46:04,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:46:04,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:46:04,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:46:04,293 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:46:04,293 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:46:04,295 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:46:04,296 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:46:04,296 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:46:04,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:04,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:04,298 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:04,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-12 00:46:04,299 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:46:04,299 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:46:04,300 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:46:04,300 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 7 Supporting invariants [] [2024-10-12 00:46:04,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:04,311 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:46:04,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:04,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:46:04,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:04,351 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:46:04,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:04,351 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-12 00:46:04,352 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-10-12 00:46:04,352 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 6 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:46:04,360 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 6. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 23 states and 28 transitions. Complement of second has 5 states. [2024-10-12 00:46:04,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 00:46:04,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:46:04,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2024-10-12 00:46:04,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 12 letters. Loop has 1 letters. [2024-10-12 00:46:04,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:04,362 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:46:04,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:04,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:46:04,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:04,392 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:46:04,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:04,393 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-12 00:46:04,393 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2024-10-12 00:46:04,393 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 6 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:46:04,398 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 6. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 23 states and 28 transitions. Complement of second has 5 states. [2024-10-12 00:46:04,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 00:46:04,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:46:04,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2024-10-12 00:46:04,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 12 letters. Loop has 1 letters. [2024-10-12 00:46:04,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:04,400 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:46:04,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:04,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:46:04,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:04,429 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:46:04,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:04,429 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-12 00:46:04,430 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-10-12 00:46:04,430 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 6 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:46:04,436 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 6. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 19 states and 22 transitions. Complement of second has 4 states. [2024-10-12 00:46:04,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 00:46:04,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:46:04,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-10-12 00:46:04,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 12 letters. Loop has 1 letters. [2024-10-12 00:46:04,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:04,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 13 letters. Loop has 1 letters. [2024-10-12 00:46:04,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:04,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 12 letters. Loop has 2 letters. [2024-10-12 00:46:04,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:04,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. [2024-10-12 00:46:04,438 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:46:04,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2024-10-12 00:46:04,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-12 00:46:04,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-12 00:46:04,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-12 00:46:04,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:46:04,438 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:46:04,439 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:46:04,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:46:04,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-12 00:46:04,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2024-10-12 00:46:04,439 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 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-12 00:46:04,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:46:04,439 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2024-10-12 00:46:04,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2024-10-12 00:46:04,439 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:46:04,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 00:46:04,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-12 00:46:04,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-12 00:46:04,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-12 00:46:04,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:46:04,440 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:46:04,440 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:46:04,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 00:46:04,440 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:46:04,440 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 00:46:04,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-12 00:46:04,440 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:46:04,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-12 00:46:04,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 12:46:04 BoogieIcfgContainer [2024-10-12 00:46:04,446 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 00:46:04,447 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 00:46:04,447 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 00:46:04,447 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 00:46:04,447 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:46:02" (3/4) ... [2024-10-12 00:46:04,448 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 00:46:04,449 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 00:46:04,450 INFO L158 Benchmark]: Toolchain (without parser) took 2828.68ms. Allocated memory was 155.2MB in the beginning and 188.7MB in the end (delta: 33.6MB). Free memory was 90.4MB in the beginning and 91.5MB in the end (delta: -1.1MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2024-10-12 00:46:04,450 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 96.5MB. Free memory was 48.8MB in the beginning and 48.7MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:46:04,450 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.07ms. Allocated memory is still 155.2MB. Free memory was 90.4MB in the beginning and 125.6MB in the end (delta: -35.2MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2024-10-12 00:46:04,450 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.58ms. Allocated memory is still 155.2MB. Free memory was 125.6MB in the beginning and 124.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:46:04,451 INFO L158 Benchmark]: Boogie Preprocessor took 20.00ms. Allocated memory is still 155.2MB. Free memory was 124.3MB in the beginning and 122.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:46:04,451 INFO L158 Benchmark]: RCFGBuilder took 184.21ms. Allocated memory is still 155.2MB. Free memory was 122.3MB in the beginning and 112.4MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-12 00:46:04,451 INFO L158 Benchmark]: BuchiAutomizer took 2347.45ms. Allocated memory was 155.2MB in the beginning and 188.7MB in the end (delta: 33.6MB). Free memory was 112.4MB in the beginning and 92.6MB in the end (delta: 19.8MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. [2024-10-12 00:46:04,451 INFO L158 Benchmark]: Witness Printer took 2.55ms. Allocated memory is still 188.7MB. Free memory was 92.6MB in the beginning and 91.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:46:04,452 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.12ms. Allocated memory is still 96.5MB. Free memory was 48.8MB in the beginning and 48.7MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.07ms. Allocated memory is still 155.2MB. Free memory was 90.4MB in the beginning and 125.6MB in the end (delta: -35.2MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.58ms. Allocated memory is still 155.2MB. Free memory was 125.6MB in the beginning and 124.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.00ms. Allocated memory is still 155.2MB. Free memory was 124.3MB in the beginning and 122.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 184.21ms. Allocated memory is still 155.2MB. Free memory was 122.3MB in the beginning and 112.4MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 2347.45ms. Allocated memory was 155.2MB in the beginning and 188.7MB in the end (delta: 33.6MB). Free memory was 112.4MB in the beginning and 92.6MB in the end (delta: 19.8MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. * Witness Printer took 2.55ms. Allocated memory is still 188.7MB. Free memory was 92.6MB in the beginning and 91.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (5 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * i) + 201) and consists of 3 locations. One deterministic module has affine ranking function (((long long) -2 * j) + ((long long) 39 * i)) and consists of 5 locations. One deterministic module has affine ranking function (7 + ((long long) -2 * k)) and consists of 3 locations. One nondeterministic module has affine ranking function (7 + ((long long) -2 * k)) and consists of 3 locations. 5 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.3s and 7 iterations. TraceHistogramMax:4. Analysis of lassos took 1.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 17 StatesRemovedByMinimization, 3 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 [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 57 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 52 mSDsluCounter, 123 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49 IncrementalHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 88 mSDtfsCounter, 49 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN1 SILU0 SILI0 SILT2 lasso1 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax100 hnf100 lsp79 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq164 hnf93 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 47ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-12 00:46:04,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:04,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:04,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:05,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:05,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE