./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/NO_13.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/NO_13.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash eeea679d58a502ae5881094604c1f31424fa081cb4c3d3de58dd4530f33f3571 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 20:54:40,024 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 20:54:40,067 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-12 20:54:40,071 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 20:54:40,071 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 20:54:40,087 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 20:54:40,088 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 20:54:40,088 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 20:54:40,089 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 20:54:40,089 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 20:54:40,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 20:54:40,090 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 20:54:40,090 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 20:54:40,090 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-12 20:54:40,091 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-12 20:54:40,091 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-12 20:54:40,091 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-12 20:54:40,091 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-12 20:54:40,092 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-12 20:54:40,092 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 20:54:40,092 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-12 20:54:40,094 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 20:54:40,094 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 20:54:40,094 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-12 20:54:40,094 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-12 20:54:40,095 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-12 20:54:40,095 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 20:54:40,095 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 20:54:40,095 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 20:54:40,096 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-12 20:54:40,096 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 20:54:40,096 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 20:54:40,096 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 20:54:40,097 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 20:54:40,097 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 20:54:40,097 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-12 20:54:40,098 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eeea679d58a502ae5881094604c1f31424fa081cb4c3d3de58dd4530f33f3571 [2024-11-12 20:54:40,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 20:54:40,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 20:54:40,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 20:54:40,332 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 20:54:40,332 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 20:54:40,333 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/NO_13.c [2024-11-12 20:54:41,609 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 20:54:41,765 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 20:54:41,766 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_13.c [2024-11-12 20:54:41,771 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b8065350/d8c41b4d632248e283274a51d089db75/FLAG7fd2dc257 [2024-11-12 20:54:41,784 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b8065350/d8c41b4d632248e283274a51d089db75 [2024-11-12 20:54:41,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 20:54:41,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 20:54:41,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 20:54:41,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 20:54:41,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 20:54:41,793 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:54:41" (1/1) ... [2024-11-12 20:54:41,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b087840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:54:41, skipping insertion in model container [2024-11-12 20:54:41,794 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:54:41" (1/1) ... [2024-11-12 20:54:41,807 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 20:54:41,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 20:54:41,953 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 20:54:41,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 20:54:41,976 INFO L204 MainTranslator]: Completed translation [2024-11-12 20:54:41,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:54:41 WrapperNode [2024-11-12 20:54:41,977 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 20:54:41,977 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 20:54:41,978 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 20:54:41,978 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 20:54:41,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:54:41" (1/1) ... [2024-11-12 20:54:41,985 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:54:41" (1/1) ... [2024-11-12 20:54:41,996 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 17 [2024-11-12 20:54:41,996 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 20:54:41,996 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 20:54:41,997 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 20:54:41,997 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 20:54:42,004 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:54:41" (1/1) ... [2024-11-12 20:54:42,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:54:41" (1/1) ... [2024-11-12 20:54:42,004 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:54:41" (1/1) ... [2024-11-12 20:54:42,009 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-12 20:54:42,010 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:54:41" (1/1) ... [2024-11-12 20:54:42,010 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:54:41" (1/1) ... [2024-11-12 20:54:42,011 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:54:41" (1/1) ... [2024-11-12 20:54:42,020 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:54:41" (1/1) ... [2024-11-12 20:54:42,021 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:54:41" (1/1) ... [2024-11-12 20:54:42,021 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:54:41" (1/1) ... [2024-11-12 20:54:42,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 20:54:42,024 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 20:54:42,024 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 20:54:42,024 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 20:54:42,025 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:54:41" (1/1) ... [2024-11-12 20:54:42,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:42,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:42,052 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 20:54:42,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-12 20:54:42,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 20:54:42,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 20:54:42,208 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 20:54:42,210 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 20:54:42,258 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-11-12 20:54:42,258 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 20:54:42,271 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 20:54:42,272 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 20:54:42,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:54:42 BoogieIcfgContainer [2024-11-12 20:54:42,272 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 20:54:42,273 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-12 20:54:42,273 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-12 20:54:42,276 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-12 20:54:42,276 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 20:54:42,276 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.11 08:54:41" (1/3) ... [2024-11-12 20:54:42,277 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c28adb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 08:54:42, skipping insertion in model container [2024-11-12 20:54:42,277 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 20:54:42,277 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:54:41" (2/3) ... [2024-11-12 20:54:42,278 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c28adb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 08:54:42, skipping insertion in model container [2024-11-12 20:54:42,278 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 20:54:42,278 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:54:42" (3/3) ... [2024-11-12 20:54:42,279 INFO L332 chiAutomizerObserver]: Analyzing ICFG NO_13.c [2024-11-12 20:54:42,317 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2024-11-12 20:54:42,317 INFO L302 stractBuchiCegarLoop]: Hoare is None [2024-11-12 20:54:42,317 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-12 20:54:42,317 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-12 20:54:42,318 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-12 20:54:42,318 INFO L306 stractBuchiCegarLoop]: Difference is false [2024-11-12 20:54:42,318 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-12 20:54:42,318 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-12 20:54:42,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:54:42,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-12 20:54:42,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:54:42,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:54:42,336 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 20:54:42,336 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-12 20:54:42,336 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-12 20:54:42,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:54:42,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-12 20:54:42,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:54:42,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:54:42,337 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 20:54:42,338 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-12 20:54:42,343 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0;" [2024-11-12 20:54:42,343 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(main_~i~0#1 < main_~j~0#1);" "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" [2024-11-12 20:54:42,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:42,348 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-12 20:54:42,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:42,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837321544] [2024-11-12 20:54:42,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:42,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:42,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:42,414 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:42,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:42,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:42,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 1 times [2024-11-12 20:54:42,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:42,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035797645] [2024-11-12 20:54:42,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:42,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:42,450 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:42,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:42,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:42,461 INFO L85 PathProgramCache]: Analyzing trace with hash 925800, now seen corresponding path program 1 times [2024-11-12 20:54:42,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:42,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956328567] [2024-11-12 20:54:42,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:42,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:42,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:42,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:54:42,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956328567] [2024-11-12 20:54:42,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956328567] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:54:42,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607880221] [2024-11-12 20:54:42,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:42,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:54:42,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:42,545 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:54:42,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 20:54:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:42,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 20:54:42,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:42,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:54:42,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607880221] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:54:42,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:54:42,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 3 [2024-11-12 20:54:42,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836326555] [2024-11-12 20:54:42,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:54:42,649 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 20:54:42,649 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 20:54:42,649 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 20:54:42,649 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 20:54:42,650 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-12 20:54:42,650 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:42,650 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 20:54:42,650 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 20:54:42,650 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration1_Loop [2024-11-12 20:54:42,650 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 20:54:42,650 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 20:54:42,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:42,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:42,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:42,727 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 20:54:42,727 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-12 20:54:42,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:42,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:42,751 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 20:54:42,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-12 20:54:42,754 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 20:54:42,754 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 20:54:42,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-12 20:54:42,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:42,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:42,780 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 20:54:42,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-12 20:54:42,782 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-12 20:54:42,782 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 20:54:42,812 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-12 20:54:42,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-12 20:54:42,822 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 20:54:42,822 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 20:54:42,822 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 20:54:42,823 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 20:54:42,823 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 20:54:42,823 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:42,823 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 20:54:42,823 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 20:54:42,823 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration1_Loop [2024-11-12 20:54:42,823 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 20:54:42,823 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 20:54:42,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:42,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:42,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:42,896 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 20:54:42,900 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 20:54:42,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:42,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:42,903 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 20:54:42,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-12 20:54:42,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 20:54:42,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:54:42,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:54:42,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:54:42,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:54:42,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:54:42,919 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:54:42,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:54:42,922 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 20:54:42,925 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-12 20:54:42,925 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-12 20:54:42,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:42,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:42,929 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 20:54:42,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-12 20:54:42,931 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 20:54:42,931 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-12 20:54:42,931 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 20:54:42,932 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 103 Supporting invariants [] [2024-11-12 20:54:42,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-12 20:54:42,948 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-12 20:54:42,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:42,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 20:54:42,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:42,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:42,984 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 20:54:42,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:42,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:54:43,008 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-11-12 20:54:43,010 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:54:43,034 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 17 states and 24 transitions. Complement of second has 6 states. [2024-11-12 20:54:43,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-12 20:54:43,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:54:43,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2024-11-12 20:54:43,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 2 letters. [2024-11-12 20:54:43,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:54:43,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-12 20:54:43,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:54:43,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-12 20:54:43,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:54:43,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 24 transitions. [2024-11-12 20:54:43,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-12 20:54:43,047 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 8 states and 11 transitions. [2024-11-12 20:54:43,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-12 20:54:43,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-11-12 20:54:43,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2024-11-12 20:54:43,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:54:43,048 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2024-11-12 20:54:43,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2024-11-12 20:54:43,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-11-12 20:54:43,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:54:43,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2024-11-12 20:54:43,065 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2024-11-12 20:54:43,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:54:43,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:54:43,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:54:43,068 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-11-12 20:54:43,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:54:43,081 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2024-11-12 20:54:43,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2024-11-12 20:54:43,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-12 20:54:43,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 8 states and 9 transitions. [2024-11-12 20:54:43,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-12 20:54:43,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-12 20:54:43,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2024-11-12 20:54:43,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 20:54:43,082 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2024-11-12 20:54:43,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2024-11-12 20:54:43,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-11-12 20:54:43,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:54:43,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2024-11-12 20:54:43,083 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2024-11-12 20:54:43,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:54:43,084 INFO L426 stractBuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2024-11-12 20:54:43,084 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-12 20:54:43,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2024-11-12 20:54:43,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-12 20:54:43,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:54:43,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:54:43,084 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1] [2024-11-12 20:54:43,084 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-12 20:54:43,085 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" [2024-11-12 20:54:43,085 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(main_~i~0#1 < main_~j~0#1);" "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" [2024-11-12 20:54:43,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:43,085 INFO L85 PathProgramCache]: Analyzing trace with hash 889692233, now seen corresponding path program 1 times [2024-11-12 20:54:43,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:43,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831169914] [2024-11-12 20:54:43,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:43,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:43,091 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:43,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:43,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:43,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 2 times [2024-11-12 20:54:43,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:43,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862785840] [2024-11-12 20:54:43,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:43,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:43,099 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:43,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:43,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:43,102 INFO L85 PathProgramCache]: Analyzing trace with hash 295744366, now seen corresponding path program 1 times [2024-11-12 20:54:43,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:43,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429778215] [2024-11-12 20:54:43,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:43,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:43,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:54:43,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429778215] [2024-11-12 20:54:43,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429778215] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:54:43,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773377046] [2024-11-12 20:54:43,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:43,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:54:43,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:43,150 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:54:43,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-12 20:54:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:43,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 20:54:43,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:43,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:54:43,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773377046] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:54:43,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:54:43,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-12 20:54:43,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202546091] [2024-11-12 20:54:43,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:54:43,252 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 20:54:43,252 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 20:54:43,252 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 20:54:43,252 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 20:54:43,252 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-12 20:54:43,253 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:43,253 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 20:54:43,253 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 20:54:43,253 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration2_Loop [2024-11-12 20:54:43,253 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 20:54:43,253 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 20:54:43,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:43,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:43,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:43,299 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 20:54:43,299 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-12 20:54:43,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:43,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:43,301 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 20:54:43,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-12 20:54:43,305 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 20:54:43,306 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 20:54:43,324 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 20:54:43,325 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-12 20:54:43,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-12 20:54:43,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:43,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:43,337 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 20:54:43,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-12 20:54:43,343 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 20:54:43,343 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 20:54:43,362 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 20:54:43,362 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-12 20:54:43,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-12 20:54:43,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:43,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:43,375 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 20:54:43,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-12 20:54:43,377 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 20:54:43,377 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 20:54:43,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-12 20:54:43,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:43,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:43,401 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 20:54:43,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-12 20:54:43,404 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-12 20:54:43,404 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 20:54:43,467 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-12 20:54:43,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-12 20:54:43,475 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 20:54:43,476 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 20:54:43,476 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 20:54:43,476 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 20:54:43,476 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 20:54:43,476 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:43,476 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 20:54:43,476 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 20:54:43,476 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration2_Loop [2024-11-12 20:54:43,476 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 20:54:43,476 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 20:54:43,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:43,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:43,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:43,568 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 20:54:43,568 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 20:54:43,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:43,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:43,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-12 20:54:43,577 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 20:54:43,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-12 20:54:43,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 20:54:43,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:54:43,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:54:43,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:54:43,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:54:43,597 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 20:54:43,597 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 20:54:43,603 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 20:54:43,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-12 20:54:43,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:43,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:43,631 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 20:54:43,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-12 20:54:43,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 20:54:43,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:54:43,644 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:54:43,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:54:43,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:54:43,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:54:43,647 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:54:43,647 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:54:43,650 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 20:54:43,653 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-12 20:54:43,653 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-12 20:54:43,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:43,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:43,657 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 20:54:43,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-12 20:54:43,660 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 20:54:43,660 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-12 20:54:43,660 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 20:54:43,660 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 103 Supporting invariants [] [2024-11-12 20:54:43,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-12 20:54:43,675 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-12 20:54:43,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:43,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 20:54:43,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:43,716 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 20:54:43,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:43,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:54:43,720 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-11-12 20:54:43,720 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-11-12 20:54:43,730 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 9 states and 10 transitions. Complement of second has 5 states. [2024-11-12 20:54:43,730 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-11-12 20:54:43,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-11-12 20:54:43,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2024-11-12 20:54:43,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 2 letters. [2024-11-12 20:54:43,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:54:43,732 INFO L683 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-12 20:54:43,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:43,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 20:54:43,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:43,764 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 20:54:43,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:43,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:54:43,768 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-11-12 20:54:43,768 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-11-12 20:54:43,775 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 9 states and 10 transitions. Complement of second has 5 states. [2024-11-12 20:54:43,776 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-11-12 20:54:43,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-11-12 20:54:43,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2024-11-12 20:54:43,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 2 letters. [2024-11-12 20:54:43,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:54:43,777 INFO L683 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-12 20:54:43,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:43,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 20:54:43,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:43,810 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 20:54:43,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:43,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:54:43,813 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-11-12 20:54:43,813 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-11-12 20:54:43,825 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 11 states and 13 transitions. Complement of second has 4 states. [2024-11-12 20:54:43,825 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-11-12 20:54:43,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-11-12 20:54:43,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2024-11-12 20:54:43,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2024-11-12 20:54:43,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:54:43,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2024-11-12 20:54:43,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:54:43,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2024-11-12 20:54:43,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:54:43,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2024-11-12 20:54:43,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-12 20:54:43,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 10 states and 12 transitions. [2024-11-12 20:54:43,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-11-12 20:54:43,828 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-12 20:54:43,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2024-11-12 20:54:43,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:54:43,828 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 12 transitions. [2024-11-12 20:54:43,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2024-11-12 20:54:43,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-12 20:54:43,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:54:43,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2024-11-12 20:54:43,831 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2024-11-12 20:54:43,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:54:43,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 20:54:43,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-12 20:54:43,833 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:54:43,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:54:43,858 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2024-11-12 20:54:43,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 24 transitions. [2024-11-12 20:54:43,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-12 20:54:43,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 18 states and 20 transitions. [2024-11-12 20:54:43,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-11-12 20:54:43,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-11-12 20:54:43,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2024-11-12 20:54:43,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:54:43,860 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-11-12 20:54:43,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2024-11-12 20:54:43,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2024-11-12 20:54:43,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 16 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-11-12 20:54:43,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-11-12 20:54:43,863 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-12 20:54:43,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 20:54:43,864 INFO L426 stractBuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-12 20:54:43,864 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-12 20:54:43,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2024-11-12 20:54:43,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-12 20:54:43,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:54:43,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:54:43,865 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 1, 1] [2024-11-12 20:54:43,865 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-12 20:54:43,865 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" [2024-11-12 20:54:43,865 INFO L749 eck$LassoCheckResult]: Loop: "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" [2024-11-12 20:54:43,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:43,865 INFO L85 PathProgramCache]: Analyzing trace with hash 516168409, now seen corresponding path program 2 times [2024-11-12 20:54:43,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:43,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664066454] [2024-11-12 20:54:43,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:43,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:43,886 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:43,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:43,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:43,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1406, now seen corresponding path program 1 times [2024-11-12 20:54:43,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:43,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651384292] [2024-11-12 20:54:43,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:43,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:43,916 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:43,919 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:43,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:43,920 INFO L85 PathProgramCache]: Analyzing trace with hash 2116602454, now seen corresponding path program 3 times [2024-11-12 20:54:43,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:43,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658560111] [2024-11-12 20:54:43,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:43,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:43,938 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:43,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:43,979 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 20:54:43,979 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 20:54:43,979 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 20:54:43,979 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 20:54:43,979 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-12 20:54:43,979 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:43,979 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 20:54:43,979 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 20:54:43,979 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration3_Loop [2024-11-12 20:54:43,979 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 20:54:43,979 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 20:54:43,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:43,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:43,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:44,030 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 20:54:44,030 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-12 20:54:44,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:44,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:44,033 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 20:54:44,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-12 20:54:44,043 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 20:54:44,043 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 20:54:44,061 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 20:54:44,062 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-12 20:54:44,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-12 20:54:44,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:44,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:44,074 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 20:54:44,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-12 20:54:44,076 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 20:54:44,077 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 20:54:44,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-12 20:54:44,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:44,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:44,099 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 20:54:44,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-12 20:54:44,101 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-12 20:54:44,101 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 20:54:44,129 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-12 20:54:44,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-12 20:54:44,134 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 20:54:44,134 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 20:54:44,134 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 20:54:44,134 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 20:54:44,134 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 20:54:44,134 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:44,134 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 20:54:44,134 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 20:54:44,134 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration3_Loop [2024-11-12 20:54:44,134 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 20:54:44,135 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 20:54:44,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:44,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:44,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:44,188 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 20:54:44,188 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 20:54:44,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:44,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:44,190 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 20:54:44,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-12 20:54:44,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 20:54:44,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:54:44,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:54:44,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:54:44,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:54:44,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:54:44,207 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:54:44,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:54:44,209 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 20:54:44,211 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-11-12 20:54:44,211 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-12 20:54:44,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:44,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:44,213 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 20:54:44,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-12 20:54:44,215 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 20:54:44,215 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-12 20:54:44,215 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 20:54:44,215 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2024-11-12 20:54:44,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-12 20:54:44,229 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-12 20:54:44,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:44,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 20:54:44,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:44,345 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 20:54:44,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:44,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:54:44,370 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-12 20:54:44,370 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-11-12 20:54:44,388 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 26 states and 30 transitions. Complement of second has 5 states. [2024-11-12 20:54:44,388 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-11-12 20:54:44,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-11-12 20:54:44,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2024-11-12 20:54:44,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 13 letters. Loop has 2 letters. [2024-11-12 20:54:44,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:54:44,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 15 letters. Loop has 2 letters. [2024-11-12 20:54:44,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:54:44,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 13 letters. Loop has 4 letters. [2024-11-12 20:54:44,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:54:44,390 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2024-11-12 20:54:44,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-12 20:54:44,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 23 transitions. [2024-11-12 20:54:44,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-11-12 20:54:44,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-11-12 20:54:44,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2024-11-12 20:54:44,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:54:44,391 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-11-12 20:54:44,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2024-11-12 20:54:44,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2024-11-12 20:54:44,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 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-11-12 20:54:44,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-11-12 20:54:44,399 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-12 20:54:44,399 INFO L426 stractBuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-12 20:54:44,399 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-12 20:54:44,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2024-11-12 20:54:44,399 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-12 20:54:44,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:54:44,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:54:44,400 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 6, 1, 1, 1] [2024-11-12 20:54:44,400 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-12 20:54:44,400 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume !!(main_~i~0#1 < main_~j~0#1);" [2024-11-12 20:54:44,400 INFO L749 eck$LassoCheckResult]: Loop: "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" [2024-11-12 20:54:44,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:44,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1759539503, now seen corresponding path program 2 times [2024-11-12 20:54:44,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:44,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260810794] [2024-11-12 20:54:44,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:44,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:44,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:54:44,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260810794] [2024-11-12 20:54:44,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260810794] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:54:44,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739592185] [2024-11-12 20:54:44,664 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 20:54:44,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:54:44,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:44,666 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:54:44,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-12 20:54:44,693 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 20:54:44,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:54:44,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-11-12 20:54:44,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873869279] [2024-11-12 20:54:44,694 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 20:54:44,694 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 20:54:44,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:44,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1406, now seen corresponding path program 2 times [2024-11-12 20:54:44,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:44,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964627820] [2024-11-12 20:54:44,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:44,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:44,701 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:44,705 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:44,730 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 20:54:44,730 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 20:54:44,730 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 20:54:44,730 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 20:54:44,730 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-12 20:54:44,730 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:44,730 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 20:54:44,730 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 20:54:44,730 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration4_Loop [2024-11-12 20:54:44,730 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 20:54:44,730 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 20:54:44,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:44,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:44,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:44,780 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 20:54:44,780 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-12 20:54:44,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:44,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:44,784 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 20:54:44,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-12 20:54:44,789 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 20:54:44,789 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 20:54:44,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-12 20:54:44,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:44,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:44,817 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 20:54:44,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-12 20:54:44,821 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-12 20:54:44,821 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 20:54:44,849 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-12 20:54:44,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-12 20:54:44,857 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 20:54:44,857 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 20:54:44,857 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 20:54:44,857 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 20:54:44,857 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 20:54:44,857 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:44,857 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 20:54:44,858 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 20:54:44,858 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration4_Loop [2024-11-12 20:54:44,858 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 20:54:44,858 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 20:54:44,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:44,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:44,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 20:54:44,902 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 20:54:44,903 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 20:54:44,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:44,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:44,905 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 20:54:44,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-12 20:54:44,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 20:54:44,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 20:54:44,917 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 20:54:44,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 20:54:44,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 20:54:44,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 20:54:44,918 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 20:54:44,918 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 20:54:44,921 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 20:54:44,924 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-11-12 20:54:44,924 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-12 20:54:44,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 20:54:44,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:44,925 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 20:54:44,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-12 20:54:44,929 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 20:54:44,929 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-12 20:54:44,929 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 20:54:44,929 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2024-11-12 20:54:44,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-12 20:54:44,945 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-12 20:54:44,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:44,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 20:54:44,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:44,997 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 20:54:44,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:45,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:54:45,009 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-12 20:54:45,009 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-11-12 20:54:45,015 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Result 26 states and 30 transitions. Complement of second has 5 states. [2024-11-12 20:54:45,015 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-11-12 20:54:45,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-11-12 20:54:45,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2024-11-12 20:54:45,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 17 letters. Loop has 2 letters. [2024-11-12 20:54:45,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:54:45,016 INFO L683 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-12 20:54:45,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:45,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 20:54:45,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:45,058 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 20:54:45,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:45,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:54:45,069 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-12 20:54:45,069 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-11-12 20:54:45,079 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Result 27 states and 31 transitions. Complement of second has 5 states. [2024-11-12 20:54:45,080 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-11-12 20:54:45,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-11-12 20:54:45,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2024-11-12 20:54:45,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 17 letters. Loop has 2 letters. [2024-11-12 20:54:45,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:54:45,081 INFO L683 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-12 20:54:45,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:45,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 20:54:45,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:45,114 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 20:54:45,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:45,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:54:45,127 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 2 loop predicates [2024-11-12 20:54:45,128 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-11-12 20:54:45,134 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Result 28 states and 33 transitions. Complement of second has 4 states. [2024-11-12 20:54:45,134 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-11-12 20:54:45,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-11-12 20:54:45,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2024-11-12 20:54:45,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 17 letters. Loop has 2 letters. [2024-11-12 20:54:45,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:54:45,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 19 letters. Loop has 2 letters. [2024-11-12 20:54:45,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:54:45,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 17 letters. Loop has 4 letters. [2024-11-12 20:54:45,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 20:54:45,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2024-11-12 20:54:45,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-12 20:54:45,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 21 states and 24 transitions. [2024-11-12 20:54:45,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-12 20:54:45,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-12 20:54:45,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 24 transitions. [2024-11-12 20:54:45,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:54:45,137 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-11-12 20:54:45,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 24 transitions. [2024-11-12 20:54:45,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2024-11-12 20:54:45,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:54:45,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-11-12 20:54:45,139 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-11-12 20:54:45,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:54:45,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 20:54:45,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-12 20:54:45,140 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:54:45,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:54:45,156 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2024-11-12 20:54:45,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 24 transitions. [2024-11-12 20:54:45,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-12 20:54:45,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 23 transitions. [2024-11-12 20:54:45,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-12 20:54:45,158 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-12 20:54:45,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2024-11-12 20:54:45,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:54:45,158 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-11-12 20:54:45,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2024-11-12 20:54:45,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-11-12 20:54:45,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.1) internal successors, (22), 19 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-11-12 20:54:45,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-11-12 20:54:45,159 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-12 20:54:45,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 20:54:45,160 INFO L426 stractBuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-12 20:54:45,160 INFO L333 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-12 20:54:45,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2024-11-12 20:54:45,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-12 20:54:45,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:54:45,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:54:45,161 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 7, 1, 1, 1] [2024-11-12 20:54:45,161 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2024-11-12 20:54:45,161 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume !!(main_~i~0#1 < main_~j~0#1);" [2024-11-12 20:54:45,161 INFO L749 eck$LassoCheckResult]: Loop: "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume !!(main_~i~0#1 < main_~j~0#1);" [2024-11-12 20:54:45,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:45,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1299593166, now seen corresponding path program 3 times [2024-11-12 20:54:45,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:45,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140693960] [2024-11-12 20:54:45,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:45,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:45,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-12 20:54:45,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-12 20:54:45,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-12 20:54:45,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:54:45,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140693960] [2024-11-12 20:54:45,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140693960] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:54:45,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523186368] [2024-11-12 20:54:45,337 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 20:54:45,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:54:45,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:45,339 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:54:45,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-12 20:54:45,380 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 20:54:45,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:54:45,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2024-11-12 20:54:45,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503582001] [2024-11-12 20:54:45,381 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 20:54:45,381 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 20:54:45,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:45,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 1 times [2024-11-12 20:54:45,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:45,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881739113] [2024-11-12 20:54:45,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:45,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:45,389 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:45,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:45,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:54:45,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 20:54:45,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2024-11-12 20:54:45,453 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. cyclomatic complexity: 3 Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 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-11-12 20:54:45,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:54:45,477 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2024-11-12 20:54:45,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 26 transitions. [2024-11-12 20:54:45,477 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-12 20:54:45,479 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 23 states and 25 transitions. [2024-11-12 20:54:45,480 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-12 20:54:45,480 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-12 20:54:45,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2024-11-12 20:54:45,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:54:45,480 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 25 transitions. [2024-11-12 20:54:45,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2024-11-12 20:54:45,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2024-11-12 20:54:45,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:54:45,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-11-12 20:54:45,481 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-11-12 20:54:45,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 20:54:45,483 INFO L426 stractBuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-11-12 20:54:45,484 INFO L333 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-12 20:54:45,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2024-11-12 20:54:45,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-12 20:54:45,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:54:45,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:54:45,486 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 8, 1, 1, 1] [2024-11-12 20:54:45,486 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2024-11-12 20:54:45,486 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume !!(main_~i~0#1 < main_~j~0#1);" [2024-11-12 20:54:45,486 INFO L749 eck$LassoCheckResult]: Loop: "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume !!(main_~i~0#1 < main_~j~0#1);" [2024-11-12 20:54:45,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:45,486 INFO L85 PathProgramCache]: Analyzing trace with hash -926509685, now seen corresponding path program 4 times [2024-11-12 20:54:45,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:45,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325223601] [2024-11-12 20:54:45,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:45,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:45,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:54:45,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325223601] [2024-11-12 20:54:45,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325223601] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:54:45,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524028051] [2024-11-12 20:54:45,571 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-12 20:54:45,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:54:45,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:45,573 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:54:45,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-12 20:54:45,593 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 20:54:45,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:54:45,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2024-11-12 20:54:45,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248841932] [2024-11-12 20:54:45,594 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 20:54:45,594 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 20:54:45,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:45,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 2 times [2024-11-12 20:54:45,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:45,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989231902] [2024-11-12 20:54:45,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:45,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:45,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:45,597 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:45,598 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:45,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:54:45,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 20:54:45,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-12 20:54:45,633 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 3 Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:54:45,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:54:45,653 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2024-11-12 20:54:45,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2024-11-12 20:54:45,654 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-12 20:54:45,654 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 25 states and 27 transitions. [2024-11-12 20:54:45,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-12 20:54:45,654 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-12 20:54:45,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 27 transitions. [2024-11-12 20:54:45,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:54:45,655 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 27 transitions. [2024-11-12 20:54:45,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 27 transitions. [2024-11-12 20:54:45,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-11-12 20:54:45,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:54:45,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2024-11-12 20:54:45,656 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-11-12 20:54:45,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 20:54:45,657 INFO L426 stractBuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-11-12 20:54:45,657 INFO L333 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-12 20:54:45,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2024-11-12 20:54:45,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-12 20:54:45,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:54:45,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:54:45,658 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 9, 1, 1, 1] [2024-11-12 20:54:45,658 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2024-11-12 20:54:45,658 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume !!(main_~i~0#1 < main_~j~0#1);" [2024-11-12 20:54:45,658 INFO L749 eck$LassoCheckResult]: Loop: "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume !!(main_~i~0#1 < main_~j~0#1);" [2024-11-12 20:54:45,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:45,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1317636088, now seen corresponding path program 5 times [2024-11-12 20:54:45,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:45,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538102816] [2024-11-12 20:54:45,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:45,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:45,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:54:45,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538102816] [2024-11-12 20:54:45,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538102816] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:54:45,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955961041] [2024-11-12 20:54:45,758 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-12 20:54:45,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:54:45,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:45,763 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:54:45,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-12 20:54:45,784 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 20:54:45,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:54:45,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2024-11-12 20:54:45,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402322906] [2024-11-12 20:54:45,785 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 20:54:45,785 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 20:54:45,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:45,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 3 times [2024-11-12 20:54:45,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:45,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987971877] [2024-11-12 20:54:45,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:45,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:45,788 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:45,790 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:45,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:54:45,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 20:54:45,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-12 20:54:45,822 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 3 Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:54:45,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:54:45,843 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2024-11-12 20:54:45,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 30 transitions. [2024-11-12 20:54:45,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-12 20:54:45,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 27 states and 29 transitions. [2024-11-12 20:54:45,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-12 20:54:45,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-12 20:54:45,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 29 transitions. [2024-11-12 20:54:45,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:54:45,844 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-11-12 20:54:45,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 29 transitions. [2024-11-12 20:54:45,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2024-11-12 20:54:45,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:54:45,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-11-12 20:54:45,846 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-12 20:54:45,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 20:54:45,846 INFO L426 stractBuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-12 20:54:45,847 INFO L333 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-12 20:54:45,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2024-11-12 20:54:45,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-12 20:54:45,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:54:45,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:54:45,847 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 10, 1, 1, 1] [2024-11-12 20:54:45,847 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2024-11-12 20:54:45,847 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume !!(main_~i~0#1 < main_~j~0#1);" [2024-11-12 20:54:45,847 INFO L749 eck$LassoCheckResult]: Loop: "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume !!(main_~i~0#1 < main_~j~0#1);" [2024-11-12 20:54:45,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:45,848 INFO L85 PathProgramCache]: Analyzing trace with hash 767012677, now seen corresponding path program 6 times [2024-11-12 20:54:45,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:45,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452869715] [2024-11-12 20:54:45,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:45,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:45,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:54:45,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452869715] [2024-11-12 20:54:45,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452869715] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:54:45,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97029879] [2024-11-12 20:54:45,953 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-12 20:54:45,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:54:45,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:45,955 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:54:45,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-11-12 20:54:45,979 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 20:54:45,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:54:45,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2024-11-12 20:54:45,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976963563] [2024-11-12 20:54:45,979 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 20:54:45,980 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 20:54:45,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:45,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 4 times [2024-11-12 20:54:45,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:45,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502180930] [2024-11-12 20:54:45,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:45,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:45,983 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:45,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:46,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:54:46,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 20:54:46,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-12 20:54:46,023 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. cyclomatic complexity: 3 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:54:46,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:54:46,047 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2024-11-12 20:54:46,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 32 transitions. [2024-11-12 20:54:46,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-12 20:54:46,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 31 transitions. [2024-11-12 20:54:46,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-12 20:54:46,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-12 20:54:46,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 31 transitions. [2024-11-12 20:54:46,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:54:46,049 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 31 transitions. [2024-11-12 20:54:46,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 31 transitions. [2024-11-12 20:54:46,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-11-12 20:54:46,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 27 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-11-12 20:54:46,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2024-11-12 20:54:46,051 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 30 transitions. [2024-11-12 20:54:46,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 20:54:46,051 INFO L426 stractBuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2024-11-12 20:54:46,052 INFO L333 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-12 20:54:46,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 30 transitions. [2024-11-12 20:54:46,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-12 20:54:46,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:54:46,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:54:46,053 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 11, 1, 1, 1] [2024-11-12 20:54:46,053 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2024-11-12 20:54:46,053 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume !!(main_~i~0#1 < main_~j~0#1);" [2024-11-12 20:54:46,053 INFO L749 eck$LassoCheckResult]: Loop: "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume !!(main_~i~0#1 < main_~j~0#1);" [2024-11-12 20:54:46,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:46,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1635251390, now seen corresponding path program 7 times [2024-11-12 20:54:46,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:46,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716298135] [2024-11-12 20:54:46,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:46,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:46,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:54:46,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716298135] [2024-11-12 20:54:46,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716298135] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:54:46,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727479040] [2024-11-12 20:54:46,202 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-12 20:54:46,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:54:46,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:46,208 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:54:46,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-11-12 20:54:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:46,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 20:54:46,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:46,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:54:46,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727479040] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:54:46,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:54:46,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2024-11-12 20:54:46,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18062792] [2024-11-12 20:54:46,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:54:46,489 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 20:54:46,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:46,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 5 times [2024-11-12 20:54:46,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:46,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360994478] [2024-11-12 20:54:46,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:46,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:46,492 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:46,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:46,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:54:46,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-12 20:54:46,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2024-11-12 20:54:46,523 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. cyclomatic complexity: 3 Second operand has 26 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:54:46,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:54:46,584 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2024-11-12 20:54:46,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 70 transitions. [2024-11-12 20:54:46,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-12 20:54:46,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 55 states and 57 transitions. [2024-11-12 20:54:46,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-12 20:54:46,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-12 20:54:46,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 57 transitions. [2024-11-12 20:54:46,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:54:46,585 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 57 transitions. [2024-11-12 20:54:46,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 57 transitions. [2024-11-12 20:54:46,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2024-11-12 20:54:46,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.037037037037037) internal successors, (56), 53 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:54:46,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2024-11-12 20:54:46,588 INFO L240 hiAutomatonCegarLoop]: Abstraction has 54 states and 56 transitions. [2024-11-12 20:54:46,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-12 20:54:46,589 INFO L426 stractBuchiCegarLoop]: Abstraction has 54 states and 56 transitions. [2024-11-12 20:54:46,589 INFO L333 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-12 20:54:46,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 56 transitions. [2024-11-12 20:54:46,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-12 20:54:46,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:54:46,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:54:46,590 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [26, 24, 1, 1, 1] [2024-11-12 20:54:46,591 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2024-11-12 20:54:46,591 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume !!(main_~i~0#1 < main_~j~0#1);" [2024-11-12 20:54:46,591 INFO L749 eck$LassoCheckResult]: Loop: "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume !!(main_~i~0#1 < main_~j~0#1);" [2024-11-12 20:54:46,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:46,591 INFO L85 PathProgramCache]: Analyzing trace with hash 694908763, now seen corresponding path program 8 times [2024-11-12 20:54:46,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:46,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548386435] [2024-11-12 20:54:46,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:46,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:47,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:54:47,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548386435] [2024-11-12 20:54:47,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548386435] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:54:47,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984962475] [2024-11-12 20:54:47,007 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 20:54:47,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:54:47,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:47,013 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:54:47,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-12 20:54:47,038 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 20:54:47,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:54:47,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2024-11-12 20:54:47,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596817412] [2024-11-12 20:54:47,038 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 20:54:47,039 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 20:54:47,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:47,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 6 times [2024-11-12 20:54:47,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:47,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070799543] [2024-11-12 20:54:47,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:47,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:47,042 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:47,047 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:47,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:54:47,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-12 20:54:47,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2024-11-12 20:54:47,083 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. cyclomatic complexity: 3 Second operand has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 27 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:54:47,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:54:47,143 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2024-11-12 20:54:47,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 60 transitions. [2024-11-12 20:54:47,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-12 20:54:47,144 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 57 states and 59 transitions. [2024-11-12 20:54:47,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-12 20:54:47,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-12 20:54:47,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 59 transitions. [2024-11-12 20:54:47,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:54:47,144 INFO L218 hiAutomatonCegarLoop]: Abstraction has 57 states and 59 transitions. [2024-11-12 20:54:47,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 59 transitions. [2024-11-12 20:54:47,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2024-11-12 20:54:47,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 55 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:54:47,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2024-11-12 20:54:47,146 INFO L240 hiAutomatonCegarLoop]: Abstraction has 56 states and 58 transitions. [2024-11-12 20:54:47,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-12 20:54:47,147 INFO L426 stractBuchiCegarLoop]: Abstraction has 56 states and 58 transitions. [2024-11-12 20:54:47,147 INFO L333 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-12 20:54:47,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 58 transitions. [2024-11-12 20:54:47,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-12 20:54:47,147 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:54:47,147 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:54:47,148 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [27, 25, 1, 1, 1] [2024-11-12 20:54:47,148 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2024-11-12 20:54:47,148 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume !!(main_~i~0#1 < main_~j~0#1);" [2024-11-12 20:54:47,148 INFO L749 eck$LassoCheckResult]: Loop: "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume !!(main_~i~0#1 < main_~j~0#1);" [2024-11-12 20:54:47,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:47,149 INFO L85 PathProgramCache]: Analyzing trace with hash 2087331288, now seen corresponding path program 9 times [2024-11-12 20:54:47,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:47,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520889357] [2024-11-12 20:54:47,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:47,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:47,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:47,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:54:47,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520889357] [2024-11-12 20:54:47,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520889357] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:54:47,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698611232] [2024-11-12 20:54:47,585 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 20:54:47,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:54:47,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:47,588 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:54:47,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-11-12 20:54:47,610 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 20:54:47,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:54:47,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2024-11-12 20:54:47,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720400371] [2024-11-12 20:54:47,611 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 20:54:47,611 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 20:54:47,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:47,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 7 times [2024-11-12 20:54:47,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:47,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714422123] [2024-11-12 20:54:47,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:47,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:47,614 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:47,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:47,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:54:47,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-12 20:54:47,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2024-11-12 20:54:47,675 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. cyclomatic complexity: 3 Second operand has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 28 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:54:47,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:54:47,783 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2024-11-12 20:54:47,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 62 transitions. [2024-11-12 20:54:47,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-12 20:54:47,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 59 states and 61 transitions. [2024-11-12 20:54:47,785 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-12 20:54:47,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-12 20:54:47,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 61 transitions. [2024-11-12 20:54:47,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:54:47,785 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 61 transitions. [2024-11-12 20:54:47,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 61 transitions. [2024-11-12 20:54:47,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2024-11-12 20:54:47,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 57 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:54:47,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2024-11-12 20:54:47,787 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 60 transitions. [2024-11-12 20:54:47,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-12 20:54:47,789 INFO L426 stractBuchiCegarLoop]: Abstraction has 58 states and 60 transitions. [2024-11-12 20:54:47,789 INFO L333 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-12 20:54:47,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 60 transitions. [2024-11-12 20:54:47,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-12 20:54:47,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:54:47,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:54:47,791 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [28, 26, 1, 1, 1] [2024-11-12 20:54:47,791 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2024-11-12 20:54:47,791 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume !!(main_~i~0#1 < main_~j~0#1);" [2024-11-12 20:54:47,791 INFO L749 eck$LassoCheckResult]: Loop: "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume !!(main_~i~0#1 < main_~j~0#1);" [2024-11-12 20:54:47,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:47,792 INFO L85 PathProgramCache]: Analyzing trace with hash 175581461, now seen corresponding path program 10 times [2024-11-12 20:54:47,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:47,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560326315] [2024-11-12 20:54:47,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:47,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:48,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:54:48,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560326315] [2024-11-12 20:54:48,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560326315] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:54:48,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517458369] [2024-11-12 20:54:48,223 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-12 20:54:48,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:54:48,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:48,233 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:54:48,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-12 20:54:48,256 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 20:54:48,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:54:48,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2024-11-12 20:54:48,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054615434] [2024-11-12 20:54:48,256 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 20:54:48,256 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 20:54:48,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:48,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 8 times [2024-11-12 20:54:48,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:48,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215138307] [2024-11-12 20:54:48,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:48,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:48,258 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:48,259 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:48,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:54:48,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-12 20:54:48,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2024-11-12 20:54:48,291 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. cyclomatic complexity: 3 Second operand has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 29 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:54:48,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:54:48,340 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2024-11-12 20:54:48,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 64 transitions. [2024-11-12 20:54:48,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-12 20:54:48,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 61 states and 63 transitions. [2024-11-12 20:54:48,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-12 20:54:48,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-12 20:54:48,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 63 transitions. [2024-11-12 20:54:48,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:54:48,342 INFO L218 hiAutomatonCegarLoop]: Abstraction has 61 states and 63 transitions. [2024-11-12 20:54:48,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 63 transitions. [2024-11-12 20:54:48,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2024-11-12 20:54:48,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 59 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:54:48,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2024-11-12 20:54:48,343 INFO L240 hiAutomatonCegarLoop]: Abstraction has 60 states and 62 transitions. [2024-11-12 20:54:48,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-12 20:54:48,344 INFO L426 stractBuchiCegarLoop]: Abstraction has 60 states and 62 transitions. [2024-11-12 20:54:48,344 INFO L333 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-12 20:54:48,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 62 transitions. [2024-11-12 20:54:48,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-12 20:54:48,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:54:48,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:54:48,345 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [29, 27, 1, 1, 1] [2024-11-12 20:54:48,345 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2024-11-12 20:54:48,345 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume !!(main_~i~0#1 < main_~j~0#1);" [2024-11-12 20:54:48,345 INFO L749 eck$LassoCheckResult]: Loop: "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume !!(main_~i~0#1 < main_~j~0#1);" [2024-11-12 20:54:48,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:48,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1230000402, now seen corresponding path program 11 times [2024-11-12 20:54:48,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:48,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947940517] [2024-11-12 20:54:48,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:48,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:48,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:54:48,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947940517] [2024-11-12 20:54:48,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947940517] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:54:48,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135221566] [2024-11-12 20:54:48,941 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-12 20:54:48,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:54:48,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:48,943 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:54:48,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-11-12 20:54:48,969 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 20:54:48,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:54:48,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2024-11-12 20:54:48,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973354459] [2024-11-12 20:54:48,969 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 20:54:48,969 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 20:54:48,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:48,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 9 times [2024-11-12 20:54:48,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:48,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989067906] [2024-11-12 20:54:48,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:48,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:48,972 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:48,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:49,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:54:49,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-12 20:54:49,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2024-11-12 20:54:49,037 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. cyclomatic complexity: 3 Second operand has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 30 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:54:49,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:54:49,120 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2024-11-12 20:54:49,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 66 transitions. [2024-11-12 20:54:49,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-12 20:54:49,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 63 states and 65 transitions. [2024-11-12 20:54:49,123 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-12 20:54:49,123 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-12 20:54:49,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 65 transitions. [2024-11-12 20:54:49,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:54:49,123 INFO L218 hiAutomatonCegarLoop]: Abstraction has 63 states and 65 transitions. [2024-11-12 20:54:49,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 65 transitions. [2024-11-12 20:54:49,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2024-11-12 20:54:49,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.032258064516129) internal successors, (64), 61 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:54:49,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2024-11-12 20:54:49,127 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62 states and 64 transitions. [2024-11-12 20:54:49,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-12 20:54:49,128 INFO L426 stractBuchiCegarLoop]: Abstraction has 62 states and 64 transitions. [2024-11-12 20:54:49,128 INFO L333 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-12 20:54:49,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 64 transitions. [2024-11-12 20:54:49,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-12 20:54:49,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:54:49,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:54:49,129 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [30, 28, 1, 1, 1] [2024-11-12 20:54:49,129 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2024-11-12 20:54:49,129 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume !!(main_~i~0#1 < main_~j~0#1);" [2024-11-12 20:54:49,130 INFO L749 eck$LassoCheckResult]: Loop: "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume !!(main_~i~0#1 < main_~j~0#1);" [2024-11-12 20:54:49,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:49,131 INFO L85 PathProgramCache]: Analyzing trace with hash 914320847, now seen corresponding path program 12 times [2024-11-12 20:54:49,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:49,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770309711] [2024-11-12 20:54:49,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:49,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:49,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:54:49,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770309711] [2024-11-12 20:54:49,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770309711] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:54:49,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477616688] [2024-11-12 20:54:49,670 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-12 20:54:49,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:54:49,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:49,672 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:54:49,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-11-12 20:54:49,697 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 20:54:49,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:54:49,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2024-11-12 20:54:49,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106228078] [2024-11-12 20:54:49,697 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 20:54:49,697 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 20:54:49,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:49,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 10 times [2024-11-12 20:54:49,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:49,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680867273] [2024-11-12 20:54:49,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:49,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:49,700 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:49,701 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:49,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:54:49,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-12 20:54:49,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2024-11-12 20:54:49,774 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. cyclomatic complexity: 3 Second operand has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 31 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:54:49,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:54:49,874 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2024-11-12 20:54:49,874 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 68 transitions. [2024-11-12 20:54:49,875 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-12 20:54:49,875 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 65 states and 67 transitions. [2024-11-12 20:54:49,875 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-12 20:54:49,875 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-12 20:54:49,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 67 transitions. [2024-11-12 20:54:49,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:54:49,875 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 67 transitions. [2024-11-12 20:54:49,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 67 transitions. [2024-11-12 20:54:49,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2024-11-12 20:54:49,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.03125) internal successors, (66), 63 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:54:49,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2024-11-12 20:54:49,877 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 66 transitions. [2024-11-12 20:54:49,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-12 20:54:49,880 INFO L426 stractBuchiCegarLoop]: Abstraction has 64 states and 66 transitions. [2024-11-12 20:54:49,880 INFO L333 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-11-12 20:54:49,880 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 66 transitions. [2024-11-12 20:54:49,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-12 20:54:49,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:54:49,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:54:49,881 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [31, 29, 1, 1, 1] [2024-11-12 20:54:49,881 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2024-11-12 20:54:49,882 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume !!(main_~i~0#1 < main_~j~0#1);" [2024-11-12 20:54:49,882 INFO L749 eck$LassoCheckResult]: Loop: "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume !!(main_~i~0#1 < main_~j~0#1);" [2024-11-12 20:54:49,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:49,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1806020788, now seen corresponding path program 13 times [2024-11-12 20:54:49,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:49,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33389695] [2024-11-12 20:54:49,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:49,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:50,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:54:50,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33389695] [2024-11-12 20:54:50,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33389695] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:54:50,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898376730] [2024-11-12 20:54:50,498 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-12 20:54:50,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:54:50,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:54:50,500 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:54:50,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-11-12 20:54:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:54:50,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-12 20:54:50,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:54:50,686 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:54:51,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898376730] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:54:51,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:54:51,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 51 [2024-11-12 20:54:51,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019444181] [2024-11-12 20:54:51,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:54:51,621 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 20:54:51,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:51,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 11 times [2024-11-12 20:54:51,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:51,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904253889] [2024-11-12 20:54:51,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:51,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:51,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:51,624 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:51,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:51,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:51,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:54:51,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-12 20:54:51,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2024-11-12 20:54:51,656 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. cyclomatic complexity: 3 Second operand has 51 states, 51 states have (on average 2.019607843137255) internal successors, (103), 51 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:54:51,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:54:51,750 INFO L93 Difference]: Finished difference Result 125 states and 127 transitions. [2024-11-12 20:54:51,750 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 127 transitions. [2024-11-12 20:54:51,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-12 20:54:51,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 105 states and 107 transitions. [2024-11-12 20:54:51,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-12 20:54:51,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-12 20:54:51,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 107 transitions. [2024-11-12 20:54:51,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 20:54:51,752 INFO L218 hiAutomatonCegarLoop]: Abstraction has 105 states and 107 transitions. [2024-11-12 20:54:51,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 107 transitions. [2024-11-12 20:54:51,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-11-12 20:54:51,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 103 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:54:51,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2024-11-12 20:54:51,754 INFO L240 hiAutomatonCegarLoop]: Abstraction has 104 states and 106 transitions. [2024-11-12 20:54:51,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-12 20:54:51,755 INFO L426 stractBuchiCegarLoop]: Abstraction has 104 states and 106 transitions. [2024-11-12 20:54:51,755 INFO L333 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-11-12 20:54:51,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 106 transitions. [2024-11-12 20:54:51,755 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-12 20:54:51,756 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 20:54:51,756 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 20:54:51,756 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [51, 49, 1, 1, 1] [2024-11-12 20:54:51,756 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2024-11-12 20:54:51,756 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume !!(main_~i~0#1 < main_~j~0#1);" [2024-11-12 20:54:51,757 INFO L749 eck$LassoCheckResult]: Loop: "assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1;" "assume !!(main_~i~0#1 < main_~j~0#1);" "assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume !!(main_~i~0#1 < main_~j~0#1);" [2024-11-12 20:54:51,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:51,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1994822288, now seen corresponding path program 14 times [2024-11-12 20:54:51,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:51,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132580169] [2024-11-12 20:54:51,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:51,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:51,792 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:51,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:51,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:51,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 12 times [2024-11-12 20:54:51,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:51,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322699372] [2024-11-12 20:54:51,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:51,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:51,816 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:51,817 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:51,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:54:51,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1522445560, now seen corresponding path program 15 times [2024-11-12 20:54:51,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:54:51,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393614920] [2024-11-12 20:54:51,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:54:51,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:54:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:51,838 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:51,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:51,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:54:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:54,648 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:54:54,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:54:54,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.11 08:54:54 BoogieIcfgContainer [2024-11-12 20:54:54,758 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-12 20:54:54,759 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 20:54:54,759 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 20:54:54,759 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 20:54:54,759 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:54:42" (3/4) ... [2024-11-12 20:54:54,761 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-12 20:54:54,829 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 20:54:54,830 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 20:54:54,830 INFO L158 Benchmark]: Toolchain (without parser) took 13043.33ms. Allocated memory was 163.6MB in the beginning and 383.8MB in the end (delta: 220.2MB). Free memory was 92.6MB in the beginning and 166.1MB in the end (delta: -73.4MB). Peak memory consumption was 148.4MB. Max. memory is 16.1GB. [2024-11-12 20:54:54,830 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 163.6MB. Free memory was 121.1MB in the beginning and 120.9MB in the end (delta: 188.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 20:54:54,831 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.73ms. Allocated memory is still 163.6MB. Free memory was 92.4MB in the beginning and 81.3MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-12 20:54:54,831 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.53ms. Allocated memory is still 163.6MB. Free memory was 81.3MB in the beginning and 79.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 20:54:54,831 INFO L158 Benchmark]: Boogie Preprocessor took 26.14ms. Allocated memory is still 163.6MB. Free memory was 79.8MB in the beginning and 78.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 20:54:54,831 INFO L158 Benchmark]: RCFGBuilder took 248.30ms. Allocated memory is still 163.6MB. Free memory was 78.4MB in the beginning and 127.1MB in the end (delta: -48.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 20:54:54,831 INFO L158 Benchmark]: BuchiAutomizer took 12485.71ms. Allocated memory was 163.6MB in the beginning and 383.8MB in the end (delta: 220.2MB). Free memory was 127.1MB in the beginning and 170.3MB in the end (delta: -43.2MB). Peak memory consumption was 180.2MB. Max. memory is 16.1GB. [2024-11-12 20:54:54,832 INFO L158 Benchmark]: Witness Printer took 70.81ms. Allocated memory is still 383.8MB. Free memory was 170.3MB in the beginning and 166.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 20:54:54,833 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.15ms. Allocated memory is still 163.6MB. Free memory was 121.1MB in the beginning and 120.9MB in the end (delta: 188.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 188.73ms. Allocated memory is still 163.6MB. Free memory was 92.4MB in the beginning and 81.3MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.53ms. Allocated memory is still 163.6MB. Free memory was 81.3MB in the beginning and 79.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.14ms. Allocated memory is still 163.6MB. Free memory was 79.8MB in the beginning and 78.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 248.30ms. Allocated memory is still 163.6MB. Free memory was 78.4MB in the beginning and 127.1MB in the end (delta: -48.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 12485.71ms. Allocated memory was 163.6MB in the beginning and 383.8MB in the end (delta: 220.2MB). Free memory was 127.1MB in the beginning and 170.3MB in the end (delta: -43.2MB). Peak memory consumption was 180.2MB. Max. memory is 16.1GB. * Witness Printer took 70.81ms. Allocated memory is still 383.8MB. Free memory was 170.3MB in the beginning and 166.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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 18 terminating modules (14 trivial, 2 deterministic, 2 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function (((long) -2 * j) + 103) and consists of 4 locations. One deterministic module has affine ranking function j and consists of 3 locations. One nondeterministic module has affine ranking function (((long) -2 * j) + 103) and consists of 3 locations. One nondeterministic module has affine ranking function j and consists of 3 locations. 14 modules have a trivial ranking function, the largest among these consists of 51 locations. The remainder module has 104 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.3s and 16 iterations. TraceHistogramMax:51. Analysis of lassos took 10.9s. Construction of modules took 0.5s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 17. Automata minimization 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 18 StatesRemovedByMinimization, 16 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 [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 122 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 647 IncrementalHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 71 mSDtfsCounter, 647 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT2 SILN11 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital20 mio100 ax160 hnf100 lsp62 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf106 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 34ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 12]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] int j; [L8] j = 100 [L9] i = 0 VAL [i=0, j=100] [L11] COND TRUE i < j VAL [i=0, j=100] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=1, j=99] [L11] COND TRUE i < j VAL [i=1, j=99] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=2, j=98] [L11] COND TRUE i < j VAL [i=2, j=98] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=3, j=97] [L11] COND TRUE i < j VAL [i=3, j=97] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=4, j=96] [L11] COND TRUE i < j VAL [i=4, j=96] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=5, j=95] [L11] COND TRUE i < j VAL [i=5, j=95] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=6, j=94] [L11] COND TRUE i < j VAL [i=6, j=94] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=7, j=93] [L11] COND TRUE i < j VAL [i=7, j=93] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=8, j=92] [L11] COND TRUE i < j VAL [i=8, j=92] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=9, j=91] [L11] COND TRUE i < j VAL [i=9, j=91] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=10, j=90] [L11] COND TRUE i < j VAL [i=10, j=90] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=11, j=89] [L11] COND TRUE i < j VAL [i=11, j=89] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=12, j=88] [L11] COND TRUE i < j VAL [i=12, j=88] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=13, j=87] [L11] COND TRUE i < j VAL [i=13, j=87] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=14, j=86] [L11] COND TRUE i < j VAL [i=14, j=86] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=15, j=85] [L11] COND TRUE i < j VAL [i=15, j=85] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=16, j=84] [L11] COND TRUE i < j VAL [i=16, j=84] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=17, j=83] [L11] COND TRUE i < j VAL [i=17, j=83] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=18, j=82] [L11] COND TRUE i < j VAL [i=18, j=82] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=19, j=81] [L11] COND TRUE i < j VAL [i=19, j=81] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=20, j=80] [L11] COND TRUE i < j VAL [i=20, j=80] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=21, j=79] [L11] COND TRUE i < j VAL [i=21, j=79] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=22, j=78] [L11] COND TRUE i < j VAL [i=22, j=78] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=23, j=77] [L11] COND TRUE i < j VAL [i=23, j=77] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=24, j=76] [L11] COND TRUE i < j VAL [i=24, j=76] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=25, j=75] [L11] COND TRUE i < j VAL [i=25, j=75] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=26, j=74] [L11] COND TRUE i < j VAL [i=26, j=74] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=27, j=73] [L11] COND TRUE i < j VAL [i=27, j=73] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=28, j=72] [L11] COND TRUE i < j VAL [i=28, j=72] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=29, j=71] [L11] COND TRUE i < j VAL [i=29, j=71] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=30, j=70] [L11] COND TRUE i < j VAL [i=30, j=70] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=31, j=69] [L11] COND TRUE i < j VAL [i=31, j=69] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=32, j=68] [L11] COND TRUE i < j VAL [i=32, j=68] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=33, j=67] [L11] COND TRUE i < j VAL [i=33, j=67] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=34, j=66] [L11] COND TRUE i < j VAL [i=34, j=66] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=35, j=65] [L11] COND TRUE i < j VAL [i=35, j=65] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=36, j=64] [L11] COND TRUE i < j VAL [i=36, j=64] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=37, j=63] [L11] COND TRUE i < j VAL [i=37, j=63] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=38, j=62] [L11] COND TRUE i < j VAL [i=38, j=62] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=39, j=61] [L11] COND TRUE i < j VAL [i=39, j=61] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=40, j=60] [L11] COND TRUE i < j VAL [i=40, j=60] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=41, j=59] [L11] COND TRUE i < j VAL [i=41, j=59] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=42, j=58] [L11] COND TRUE i < j VAL [i=42, j=58] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=43, j=57] [L11] COND TRUE i < j VAL [i=43, j=57] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=44, j=56] [L11] COND TRUE i < j VAL [i=44, j=56] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=45, j=55] [L11] COND TRUE i < j VAL [i=45, j=55] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=46, j=54] [L11] COND TRUE i < j VAL [i=46, j=54] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=47, j=53] [L11] COND TRUE i < j VAL [i=47, j=53] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=48, j=52] [L11] COND TRUE i < j VAL [i=48, j=52] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=49, j=51] [L11] COND TRUE i < j VAL [i=49, j=51] [L12] COND FALSE !(51 < j) [L13] i = i-1 [L13] j = j+1 VAL [i=48, j=52] [L11] COND TRUE i < j VAL [i=48, j=52] Loop: [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND FALSE !(51 < j) [L13] i = i-1 [L13] j = j+1 [L11] COND TRUE i < j End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 12]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int j; [L8] j = 100 [L9] i = 0 VAL [i=0, j=100] [L11] COND TRUE i < j VAL [i=0, j=100] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=1, j=99] [L11] COND TRUE i < j VAL [i=1, j=99] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=2, j=98] [L11] COND TRUE i < j VAL [i=2, j=98] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=3, j=97] [L11] COND TRUE i < j VAL [i=3, j=97] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=4, j=96] [L11] COND TRUE i < j VAL [i=4, j=96] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=5, j=95] [L11] COND TRUE i < j VAL [i=5, j=95] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=6, j=94] [L11] COND TRUE i < j VAL [i=6, j=94] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=7, j=93] [L11] COND TRUE i < j VAL [i=7, j=93] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=8, j=92] [L11] COND TRUE i < j VAL [i=8, j=92] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=9, j=91] [L11] COND TRUE i < j VAL [i=9, j=91] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=10, j=90] [L11] COND TRUE i < j VAL [i=10, j=90] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=11, j=89] [L11] COND TRUE i < j VAL [i=11, j=89] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=12, j=88] [L11] COND TRUE i < j VAL [i=12, j=88] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=13, j=87] [L11] COND TRUE i < j VAL [i=13, j=87] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=14, j=86] [L11] COND TRUE i < j VAL [i=14, j=86] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=15, j=85] [L11] COND TRUE i < j VAL [i=15, j=85] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=16, j=84] [L11] COND TRUE i < j VAL [i=16, j=84] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=17, j=83] [L11] COND TRUE i < j VAL [i=17, j=83] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=18, j=82] [L11] COND TRUE i < j VAL [i=18, j=82] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=19, j=81] [L11] COND TRUE i < j VAL [i=19, j=81] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=20, j=80] [L11] COND TRUE i < j VAL [i=20, j=80] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=21, j=79] [L11] COND TRUE i < j VAL [i=21, j=79] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=22, j=78] [L11] COND TRUE i < j VAL [i=22, j=78] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=23, j=77] [L11] COND TRUE i < j VAL [i=23, j=77] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=24, j=76] [L11] COND TRUE i < j VAL [i=24, j=76] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=25, j=75] [L11] COND TRUE i < j VAL [i=25, j=75] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=26, j=74] [L11] COND TRUE i < j VAL [i=26, j=74] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=27, j=73] [L11] COND TRUE i < j VAL [i=27, j=73] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=28, j=72] [L11] COND TRUE i < j VAL [i=28, j=72] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=29, j=71] [L11] COND TRUE i < j VAL [i=29, j=71] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=30, j=70] [L11] COND TRUE i < j VAL [i=30, j=70] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=31, j=69] [L11] COND TRUE i < j VAL [i=31, j=69] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=32, j=68] [L11] COND TRUE i < j VAL [i=32, j=68] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=33, j=67] [L11] COND TRUE i < j VAL [i=33, j=67] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=34, j=66] [L11] COND TRUE i < j VAL [i=34, j=66] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=35, j=65] [L11] COND TRUE i < j VAL [i=35, j=65] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=36, j=64] [L11] COND TRUE i < j VAL [i=36, j=64] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=37, j=63] [L11] COND TRUE i < j VAL [i=37, j=63] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=38, j=62] [L11] COND TRUE i < j VAL [i=38, j=62] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=39, j=61] [L11] COND TRUE i < j VAL [i=39, j=61] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=40, j=60] [L11] COND TRUE i < j VAL [i=40, j=60] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=41, j=59] [L11] COND TRUE i < j VAL [i=41, j=59] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=42, j=58] [L11] COND TRUE i < j VAL [i=42, j=58] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=43, j=57] [L11] COND TRUE i < j VAL [i=43, j=57] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=44, j=56] [L11] COND TRUE i < j VAL [i=44, j=56] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=45, j=55] [L11] COND TRUE i < j VAL [i=45, j=55] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=46, j=54] [L11] COND TRUE i < j VAL [i=46, j=54] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=47, j=53] [L11] COND TRUE i < j VAL [i=47, j=53] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=48, j=52] [L11] COND TRUE i < j VAL [i=48, j=52] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=49, j=51] [L11] COND TRUE i < j VAL [i=49, j=51] [L12] COND FALSE !(51 < j) [L13] i = i-1 [L13] j = j+1 VAL [i=48, j=52] [L11] COND TRUE i < j VAL [i=48, j=52] Loop: [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND FALSE !(51 < j) [L13] i = i-1 [L13] j = j+1 [L11] COND TRUE i < j End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-12 20:54:54,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2024-11-12 20:54:55,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2024-11-12 20:54:55,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2024-11-12 20:54:55,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2024-11-12 20:54:55,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2024-11-12 20:54:55,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2024-11-12 20:54:56,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2024-11-12 20:54:56,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2024-11-12 20:54:56,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2024-11-12 20:54:56,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2024-11-12 20:54:56,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2024-11-12 20:54:57,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-11-12 20:54:57,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-12 20:54:57,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 20:54:57,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)