./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3289d67d 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/loop-lit/bh2017-ex1-poly.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash d6dbcbf51695ea037a123bcc006ce5f6db095b874a22b169ec869d834ce41de6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 08:34:24,236 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 08:34:24,296 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-17 08:34:24,304 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 08:34:24,304 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 08:34:24,304 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-17 08:34:24,327 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 08:34:24,328 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 08:34:24,329 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 08:34:24,329 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 08:34:24,330 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 08:34:24,330 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 08:34:24,330 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 08:34:24,331 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 08:34:24,331 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-17 08:34:24,331 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-17 08:34:24,332 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-17 08:34:24,332 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-17 08:34:24,332 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-17 08:34:24,333 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-17 08:34:24,333 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 08:34:24,334 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-17 08:34:24,334 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 08:34:24,335 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 08:34:24,335 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 08:34:24,335 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 08:34:24,336 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-17 08:34:24,336 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-17 08:34:24,336 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-17 08:34:24,337 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 08:34:24,337 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 08:34:24,337 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 08:34:24,337 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 08:34:24,338 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-17 08:34:24,338 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 08:34:24,338 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 08:34:24,339 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 08:34:24,339 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 08:34:24,339 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 08:34:24,340 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-17 08:34:24,340 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d6dbcbf51695ea037a123bcc006ce5f6db095b874a22b169ec869d834ce41de6 [2024-11-17 08:34:24,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 08:34:24,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 08:34:24,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 08:34:24,608 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 08:34:24,608 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 08:34:24,609 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i [2024-11-17 08:34:26,086 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 08:34:26,263 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 08:34:26,263 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i [2024-11-17 08:34:26,270 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5e47a7ba/9170cd2f784d4ed8ad57ea8f79185fd3/FLAG7194c4e11 [2024-11-17 08:34:26,283 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5e47a7ba/9170cd2f784d4ed8ad57ea8f79185fd3 [2024-11-17 08:34:26,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 08:34:26,289 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 08:34:26,290 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 08:34:26,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 08:34:26,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 08:34:26,298 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:34:26" (1/1) ... [2024-11-17 08:34:26,299 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e9a2219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:26, skipping insertion in model container [2024-11-17 08:34:26,299 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:34:26" (1/1) ... [2024-11-17 08:34:26,318 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 08:34:26,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:34:26,596 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 08:34:26,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:34:26,633 INFO L204 MainTranslator]: Completed translation [2024-11-17 08:34:26,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:26 WrapperNode [2024-11-17 08:34:26,635 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 08:34:26,636 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 08:34:26,636 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 08:34:26,636 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 08:34:26,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:26" (1/1) ... [2024-11-17 08:34:26,650 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:26" (1/1) ... [2024-11-17 08:34:26,668 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 11, calls inlined = 18, statements flattened = 88 [2024-11-17 08:34:26,669 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 08:34:26,669 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 08:34:26,669 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 08:34:26,670 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 08:34:26,677 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:26" (1/1) ... [2024-11-17 08:34:26,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:26" (1/1) ... [2024-11-17 08:34:26,679 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:26" (1/1) ... [2024-11-17 08:34:26,691 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-17 08:34:26,692 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:26" (1/1) ... [2024-11-17 08:34:26,692 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:26" (1/1) ... [2024-11-17 08:34:26,695 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:26" (1/1) ... [2024-11-17 08:34:26,696 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:26" (1/1) ... [2024-11-17 08:34:26,697 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:26" (1/1) ... [2024-11-17 08:34:26,698 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:26" (1/1) ... [2024-11-17 08:34:26,700 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 08:34:26,701 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 08:34:26,701 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 08:34:26,701 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 08:34:26,702 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:26" (1/1) ... [2024-11-17 08:34:26,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:26,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:26,735 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-17 08:34:26,737 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-17 08:34:26,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 08:34:26,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 08:34:26,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 08:34:26,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 08:34:26,832 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 08:34:26,834 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 08:34:26,970 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-17 08:34:26,971 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 08:34:26,988 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 08:34:26,988 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 08:34:26,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:34:26 BoogieIcfgContainer [2024-11-17 08:34:26,989 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 08:34:26,990 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-17 08:34:26,990 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-17 08:34:26,994 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-17 08:34:26,994 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:34:26,994 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.11 08:34:26" (1/3) ... [2024-11-17 08:34:26,995 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a0b655d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:34:26, skipping insertion in model container [2024-11-17 08:34:26,995 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:34:26,995 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:34:26" (2/3) ... [2024-11-17 08:34:26,996 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a0b655d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:34:26, skipping insertion in model container [2024-11-17 08:34:26,996 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:34:26,996 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:34:26" (3/3) ... [2024-11-17 08:34:26,997 INFO L332 chiAutomizerObserver]: Analyzing ICFG bh2017-ex1-poly.i [2024-11-17 08:34:27,049 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-17 08:34:27,049 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-17 08:34:27,050 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-17 08:34:27,050 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-17 08:34:27,050 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-17 08:34:27,050 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-17 08:34:27,050 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-17 08:34:27,050 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-17 08:34:27,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 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-17 08:34:27,075 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2024-11-17 08:34:27,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:27,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:27,081 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:34:27,081 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:34:27,081 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-17 08:34:27,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 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-17 08:34:27,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2024-11-17 08:34:27,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:27,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:27,085 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:34:27,085 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:34:27,095 INFO L745 eck$LassoCheckResult]: Stem: 43#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); 25#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_~j~0#1, main_~i~0#1;main_~i~0#1 := 0; 30#L16true [2024-11-17 08:34:27,097 INFO L747 eck$LassoCheckResult]: Loop: 30#L16true assume true; 3#L16-1true assume !!(main_~i~0#1 < 4);main_~j~0#1 := 0; 24#L18true assume !true; 22#L26true assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 5#L13-3true assume !(0 == __VERIFIER_assert_~cond#1); 4#__VERIFIER_assert_returnLabel#5true assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 2 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 40#L13-2true assume !(0 == __VERIFIER_assert_~cond#1); 35#__VERIFIER_assert_returnLabel#6true assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~i~0#1 <= 6 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 9#L13-1true assume !(0 == __VERIFIER_assert_~cond#1); 13#__VERIFIER_assert_returnLabel#7true assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 4 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 10#L13true assume !(0 == __VERIFIER_assert_~cond#1); 41#__VERIFIER_assert_returnLabel#8true assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_~i~0#1 := 1 + (main_~i~0#1 - (if main_~j~0#1 < 0 && 0 != main_~j~0#1 % 2 then 1 + main_~j~0#1 / 2 else main_~j~0#1 / 2));havoc main_~j~0#1; 30#L16true [2024-11-17 08:34:27,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:27,103 INFO L85 PathProgramCache]: Analyzing trace with hash 3296, now seen corresponding path program 1 times [2024-11-17 08:34:27,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:27,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546617234] [2024-11-17 08:34:27,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:27,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:27,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:27,207 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:27,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:27,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:27,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1876482342, now seen corresponding path program 1 times [2024-11-17 08:34:27,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:27,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192493202] [2024-11-17 08:34:27,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:27,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:27,320 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-17 08:34:27,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:34:27,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192493202] [2024-11-17 08:34:27,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192493202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:34:27,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:34:27,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 08:34:27,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282541399] [2024-11-17 08:34:27,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:34:27,327 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:34:27,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:34:27,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 08:34:27,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 08:34:27,367 INFO L87 Difference]: Start difference. First operand has 51 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-17 08:34:27,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:34:27,375 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2024-11-17 08:34:27,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 44 transitions. [2024-11-17 08:34:27,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2024-11-17 08:34:27,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 23 states and 24 transitions. [2024-11-17 08:34:27,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-11-17 08:34:27,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-11-17 08:34:27,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2024-11-17 08:34:27,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:34:27,389 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 24 transitions. [2024-11-17 08:34:27,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2024-11-17 08:34:27,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-17 08:34:27,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 22 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-17 08:34:27,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2024-11-17 08:34:27,419 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 24 transitions. [2024-11-17 08:34:27,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 08:34:27,423 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2024-11-17 08:34:27,424 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-17 08:34:27,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 24 transitions. [2024-11-17 08:34:27,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2024-11-17 08:34:27,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:27,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:27,427 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:34:27,427 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:34:27,428 INFO L745 eck$LassoCheckResult]: Stem: 110#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); 111#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_~j~0#1, main_~i~0#1;main_~i~0#1 := 0; 102#L16 [2024-11-17 08:34:27,428 INFO L747 eck$LassoCheckResult]: Loop: 102#L16 assume true; 103#L16-1 assume !!(main_~i~0#1 < 4);main_~j~0#1 := 0; 104#L18 assume true; 105#L18-1 assume !(main_~j~0#1 < 3); 106#L26 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 114#L13-3 assume !(0 == __VERIFIER_assert_~cond#1); 108#__VERIFIER_assert_returnLabel#5 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 2 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 109#L13-2 assume !(0 == __VERIFIER_assert_~cond#1); 117#__VERIFIER_assert_returnLabel#6 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~i~0#1 <= 6 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 118#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 120#__VERIFIER_assert_returnLabel#7 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 4 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 122#L13 assume !(0 == __VERIFIER_assert_~cond#1); 123#__VERIFIER_assert_returnLabel#8 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_~i~0#1 := 1 + (main_~i~0#1 - (if main_~j~0#1 < 0 && 0 != main_~j~0#1 % 2 then 1 + main_~j~0#1 / 2 else main_~j~0#1 / 2));havoc main_~j~0#1; 102#L16 [2024-11-17 08:34:27,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:27,430 INFO L85 PathProgramCache]: Analyzing trace with hash 3296, now seen corresponding path program 2 times [2024-11-17 08:34:27,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:27,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920889031] [2024-11-17 08:34:27,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:27,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:27,437 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:27,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:27,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:27,444 INFO L85 PathProgramCache]: Analyzing trace with hash -642221078, now seen corresponding path program 1 times [2024-11-17 08:34:27,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:27,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632132381] [2024-11-17 08:34:27,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:27,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:27,515 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-17 08:34:27,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:34:27,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632132381] [2024-11-17 08:34:27,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632132381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:34:27,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:34:27,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:34:27,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194037147] [2024-11-17 08:34:27,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:34:27,517 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:34:27,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:34:27,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:34:27,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:34:27,519 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:27,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:34:27,556 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2024-11-17 08:34:27,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2024-11-17 08:34:27,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2024-11-17 08:34:27,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions. [2024-11-17 08:34:27,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-11-17 08:34:27,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-17 08:34:27,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2024-11-17 08:34:27,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:34:27,558 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 26 transitions. [2024-11-17 08:34:27,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2024-11-17 08:34:27,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-17 08:34:27,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.04) internal successors, (26), 24 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-17 08:34:27,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2024-11-17 08:34:27,561 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 26 transitions. [2024-11-17 08:34:27,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:34:27,563 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2024-11-17 08:34:27,563 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-17 08:34:27,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2024-11-17 08:34:27,565 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2024-11-17 08:34:27,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:27,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:27,566 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:34:27,566 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:34:27,566 INFO L745 eck$LassoCheckResult]: Stem: 159#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); 160#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_~j~0#1, main_~i~0#1;main_~i~0#1 := 0; 156#L16 [2024-11-17 08:34:27,567 INFO L747 eck$LassoCheckResult]: Loop: 156#L16 assume true; 157#L16-1 assume !!(main_~i~0#1 < 4);main_~j~0#1 := 0; 158#L18 assume true; 161#L18-1 assume !!(main_~j~0#1 < 3);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 2 + main_~j~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 162#L13-7 assume !(0 == __VERIFIER_assert_~cond#1); 165#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 2 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 166#L13-6 assume !(0 == __VERIFIER_assert_~cond#1); 167#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~i~0#1 <= 6 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 170#L13-5 assume !(0 == __VERIFIER_assert_~cond#1); 173#__VERIFIER_assert_returnLabel#3 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 4 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 174#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 178#__VERIFIER_assert_returnLabel#4 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 179#L18 assume true; 180#L18-1 assume !(main_~j~0#1 < 3); 169#L26 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 168#L13-3 assume !(0 == __VERIFIER_assert_~cond#1); 163#__VERIFIER_assert_returnLabel#5 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 2 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 164#L13-2 assume !(0 == __VERIFIER_assert_~cond#1); 171#__VERIFIER_assert_returnLabel#6 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~i~0#1 <= 6 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 172#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 175#__VERIFIER_assert_returnLabel#7 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 4 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 176#L13 assume !(0 == __VERIFIER_assert_~cond#1); 177#__VERIFIER_assert_returnLabel#8 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_~i~0#1 := 1 + (main_~i~0#1 - (if main_~j~0#1 < 0 && 0 != main_~j~0#1 % 2 then 1 + main_~j~0#1 / 2 else main_~j~0#1 / 2));havoc main_~j~0#1; 156#L16 [2024-11-17 08:34:27,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:27,567 INFO L85 PathProgramCache]: Analyzing trace with hash 3296, now seen corresponding path program 3 times [2024-11-17 08:34:27,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:27,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716169805] [2024-11-17 08:34:27,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:27,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:27,579 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:27,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:27,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:27,591 INFO L85 PathProgramCache]: Analyzing trace with hash -251292829, now seen corresponding path program 1 times [2024-11-17 08:34:27,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:27,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029843234] [2024-11-17 08:34:27,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:27,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:27,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:34:27,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:34:27,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029843234] [2024-11-17 08:34:27,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029843234] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:34:27,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831133861] [2024-11-17 08:34:27,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:27,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:34:27,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:27,743 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-17 08:34:27,745 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-17 08:34:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:27,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 08:34:27,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:27,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:34:27,955 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:34:27,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:34:27,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831133861] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:34:27,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:34:27,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-11-17 08:34:27,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809172227] [2024-11-17 08:34:27,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:34:27,998 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:34:27,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:34:27,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 08:34:27,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 08:34:27,999 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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-17 08:34:28,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:34:28,040 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2024-11-17 08:34:28,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 36 transitions. [2024-11-17 08:34:28,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2024-11-17 08:34:28,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 36 transitions. [2024-11-17 08:34:28,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2024-11-17 08:34:28,042 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2024-11-17 08:34:28,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 36 transitions. [2024-11-17 08:34:28,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:34:28,042 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 36 transitions. [2024-11-17 08:34:28,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 36 transitions. [2024-11-17 08:34:28,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-17 08:34:28,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 34 states have internal predecessors, (36), 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-17 08:34:28,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2024-11-17 08:34:28,049 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 36 transitions. [2024-11-17 08:34:28,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 08:34:28,051 INFO L425 stractBuchiCegarLoop]: Abstraction has 35 states and 36 transitions. [2024-11-17 08:34:28,052 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-17 08:34:28,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 36 transitions. [2024-11-17 08:34:28,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2024-11-17 08:34:28,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:28,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:28,054 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:34:28,054 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:34:28,054 INFO L745 eck$LassoCheckResult]: Stem: 358#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); 359#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_~j~0#1, main_~i~0#1;main_~i~0#1 := 0; 355#L16 [2024-11-17 08:34:28,054 INFO L747 eck$LassoCheckResult]: Loop: 355#L16 assume true; 356#L16-1 assume !!(main_~i~0#1 < 4);main_~j~0#1 := 0; 357#L18 assume true; 360#L18-1 assume !!(main_~j~0#1 < 3);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 2 + main_~j~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 361#L13-7 assume !(0 == __VERIFIER_assert_~cond#1); 364#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 2 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 365#L13-6 assume !(0 == __VERIFIER_assert_~cond#1); 366#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~i~0#1 <= 6 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 369#L13-5 assume !(0 == __VERIFIER_assert_~cond#1); 372#__VERIFIER_assert_returnLabel#3 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 4 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 373#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 377#__VERIFIER_assert_returnLabel#4 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 378#L18 assume true; 389#L18-1 assume !!(main_~j~0#1 < 3);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 2 + main_~j~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 380#L13-7 assume !(0 == __VERIFIER_assert_~cond#1); 388#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 2 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 387#L13-6 assume !(0 == __VERIFIER_assert_~cond#1); 386#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~i~0#1 <= 6 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 385#L13-5 assume !(0 == __VERIFIER_assert_~cond#1); 384#__VERIFIER_assert_returnLabel#3 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 4 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 383#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 382#__VERIFIER_assert_returnLabel#4 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 381#L18 assume true; 379#L18-1 assume !(main_~j~0#1 < 3); 368#L26 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 367#L13-3 assume !(0 == __VERIFIER_assert_~cond#1); 362#__VERIFIER_assert_returnLabel#5 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 2 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 363#L13-2 assume !(0 == __VERIFIER_assert_~cond#1); 370#__VERIFIER_assert_returnLabel#6 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~i~0#1 <= 6 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 371#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 374#__VERIFIER_assert_returnLabel#7 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 4 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 375#L13 assume !(0 == __VERIFIER_assert_~cond#1); 376#__VERIFIER_assert_returnLabel#8 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_~i~0#1 := 1 + (main_~i~0#1 - (if main_~j~0#1 < 0 && 0 != main_~j~0#1 % 2 then 1 + main_~j~0#1 / 2 else main_~j~0#1 / 2));havoc main_~j~0#1; 355#L16 [2024-11-17 08:34:28,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:28,055 INFO L85 PathProgramCache]: Analyzing trace with hash 3296, now seen corresponding path program 4 times [2024-11-17 08:34:28,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:28,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116949684] [2024-11-17 08:34:28,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:28,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:28,063 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:28,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:28,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:28,067 INFO L85 PathProgramCache]: Analyzing trace with hash -130390116, now seen corresponding path program 2 times [2024-11-17 08:34:28,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:28,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694907691] [2024-11-17 08:34:28,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:28,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:28,117 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:28,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:28,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:28,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:28,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1273515363, now seen corresponding path program 1 times [2024-11-17 08:34:28,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:28,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223492066] [2024-11-17 08:34:28,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:28,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:28,206 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:28,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:28,768 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:34:28,768 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:34:28,769 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:34:28,769 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:34:28,769 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-17 08:34:28,769 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:28,770 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:34:28,770 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:34:28,770 INFO L132 ssoRankerPreferences]: Filename of dumped script: bh2017-ex1-poly.i_Iteration4_Loop [2024-11-17 08:34:28,770 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:34:28,771 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:34:28,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:28,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:28,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:28,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:28,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:28,854 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:34:28,855 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-17 08:34:28,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:28,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:28,903 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-17 08:34:28,905 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-17 08:34:28,907 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:34:28,908 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:28,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-17 08:34:28,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:28,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:28,937 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-17 08:34:28,938 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-17 08:34:28,939 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-17 08:34:28,939 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:28,992 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-17 08:34:28,997 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-17 08:34:28,998 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:34:28,998 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:34:28,998 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:34:28,998 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:34:28,998 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:34:28,998 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:28,998 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:34:28,998 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:34:28,999 INFO L132 ssoRankerPreferences]: Filename of dumped script: bh2017-ex1-poly.i_Iteration4_Loop [2024-11-17 08:34:28,999 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:34:28,999 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:34:29,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:29,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:29,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:29,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:29,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:29,054 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:34:29,058 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:34:29,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:29,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:29,062 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-17 08:34:29,064 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-17 08:34:29,065 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-17 08:34:29,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:29,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:29,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:29,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:29,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:29,082 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:29,082 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:29,086 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:34:29,100 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-17 08:34:29,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:29,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:29,103 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-17 08:34:29,105 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-17 08:34:29,107 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-17 08:34:29,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:29,117 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:29,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:29,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:29,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:29,118 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:29,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:29,121 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:34:29,126 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-17 08:34:29,126 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-17 08:34:29,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:29,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:29,131 INFO L229 MonitoredProcess]: Starting monitored process 7 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-17 08:34:29,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-17 08:34:29,133 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:34:29,134 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-17 08:34:29,134 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:34:29,134 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 7 Supporting invariants [] [2024-11-17 08:34:29,151 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-17 08:34:29,155 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-17 08:34:29,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:29,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:29,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:34:29,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:29,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 08:34:29,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:29,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:29,601 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:34:29,605 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2024-11-17 08:34:29,606 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 36 transitions. cyclomatic complexity: 2 Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:29,664 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 36 transitions. cyclomatic complexity: 2. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 99 states and 102 transitions. Complement of second has 7 states. [2024-11-17 08:34:29,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-17 08:34:29,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:29,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2024-11-17 08:34:29,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 2 letters. Loop has 33 letters. [2024-11-17 08:34:29,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:29,669 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:34:29,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:29,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:29,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:34:29,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:29,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 08:34:29,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:29,993 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:34:29,993 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2024-11-17 08:34:29,994 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 36 transitions. cyclomatic complexity: 2 Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:30,101 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 36 transitions. cyclomatic complexity: 2. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 68 states and 71 transitions. Complement of second has 12 states. [2024-11-17 08:34:30,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2024-11-17 08:34:30,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:30,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2024-11-17 08:34:30,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 36 transitions. Stem has 2 letters. Loop has 33 letters. [2024-11-17 08:34:30,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:30,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 36 transitions. Stem has 35 letters. Loop has 33 letters. [2024-11-17 08:34:30,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:30,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 36 transitions. Stem has 2 letters. Loop has 66 letters. [2024-11-17 08:34:30,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:30,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 71 transitions. [2024-11-17 08:34:30,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2024-11-17 08:34:30,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 59 states and 62 transitions. [2024-11-17 08:34:30,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-11-17 08:34:30,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2024-11-17 08:34:30,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 62 transitions. [2024-11-17 08:34:30,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:34:30,108 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 62 transitions. [2024-11-17 08:34:30,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 62 transitions. [2024-11-17 08:34:30,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2024-11-17 08:34:30,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 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-17 08:34:30,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2024-11-17 08:34:30,111 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 50 transitions. [2024-11-17 08:34:30,112 INFO L425 stractBuchiCegarLoop]: Abstraction has 47 states and 50 transitions. [2024-11-17 08:34:30,112 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-17 08:34:30,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 50 transitions. [2024-11-17 08:34:30,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2024-11-17 08:34:30,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:30,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:30,113 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-17 08:34:30,113 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:34:30,113 INFO L745 eck$LassoCheckResult]: Stem: 824#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); 825#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_~j~0#1, main_~i~0#1;main_~i~0#1 := 0; 812#L16 assume true; 814#L16-1 assume !!(main_~i~0#1 < 4);main_~j~0#1 := 0; 816#L18 [2024-11-17 08:34:30,113 INFO L747 eck$LassoCheckResult]: Loop: 816#L18 assume true; 818#L18-1 assume !!(main_~j~0#1 < 3);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 2 + main_~j~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 819#L13-7 assume !(0 == __VERIFIER_assert_~cond#1); 826#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 2 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 827#L13-6 assume !(0 == __VERIFIER_assert_~cond#1); 830#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~i~0#1 <= 6 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 834#L13-5 assume !(0 == __VERIFIER_assert_~cond#1); 838#__VERIFIER_assert_returnLabel#3 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 4 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 841#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 847#__VERIFIER_assert_returnLabel#4 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 816#L18 [2024-11-17 08:34:30,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:30,114 INFO L85 PathProgramCache]: Analyzing trace with hash 3169695, now seen corresponding path program 1 times [2024-11-17 08:34:30,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:30,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752195567] [2024-11-17 08:34:30,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:30,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:30,119 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:30,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:30,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:30,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1677798632, now seen corresponding path program 1 times [2024-11-17 08:34:30,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:30,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680745179] [2024-11-17 08:34:30,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:30,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:30,132 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:30,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:30,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:30,140 INFO L85 PathProgramCache]: Analyzing trace with hash -498623226, now seen corresponding path program 1 times [2024-11-17 08:34:30,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:30,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399606587] [2024-11-17 08:34:30,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:30,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:30,148 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:30,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:30,253 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:34:30,253 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:34:30,254 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:34:30,254 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:34:30,254 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-17 08:34:30,254 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:30,254 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:34:30,254 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:34:30,254 INFO L132 ssoRankerPreferences]: Filename of dumped script: bh2017-ex1-poly.i_Iteration5_Loop [2024-11-17 08:34:30,254 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:34:30,254 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:34:30,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:30,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:30,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:30,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:30,312 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:34:30,312 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-17 08:34:30,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:30,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:30,315 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-17 08:34:30,317 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-17 08:34:30,318 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:34:30,319 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:30,349 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-17 08:34:30,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:30,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:30,352 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-17 08:34:30,353 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-17 08:34:30,354 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-17 08:34:30,355 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:30,394 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-17 08:34:30,400 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-17 08:34:30,401 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:34:30,401 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:34:30,401 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:34:30,401 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:34:30,401 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:34:30,401 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:30,401 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:34:30,401 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:34:30,401 INFO L132 ssoRankerPreferences]: Filename of dumped script: bh2017-ex1-poly.i_Iteration5_Loop [2024-11-17 08:34:30,401 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:34:30,401 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:34:30,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:30,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:30,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:30,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:30,468 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:34:30,468 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:34:30,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:30,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:30,470 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-17 08:34:30,472 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-17 08:34:30,473 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-17 08:34:30,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:30,486 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:30,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:30,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:30,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:30,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:30,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:30,491 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:34:30,494 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-17 08:34:30,494 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-17 08:34:30,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:30,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:30,497 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-17 08:34:30,498 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-17 08:34:30,499 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:34:30,499 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-17 08:34:30,499 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:34:30,499 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 9 Supporting invariants [] [2024-11-17 08:34:30,515 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-17 08:34:30,517 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-17 08:34:30,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:30,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:34:30,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:30,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 08:34:30,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:30,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-17 08:34:30,699 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-17 08:34:30,699 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-11-17 08:34:30,700 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 50 transitions. cyclomatic complexity: 5 Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:30,778 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 50 transitions. cyclomatic complexity: 5. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 129 states and 135 transitions. Complement of second has 9 states. [2024-11-17 08:34:30,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-17 08:34:30,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:30,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2024-11-17 08:34:30,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 4 letters. Loop has 10 letters. [2024-11-17 08:34:30,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:30,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 14 letters. Loop has 10 letters. [2024-11-17 08:34:30,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:30,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 4 letters. Loop has 20 letters. [2024-11-17 08:34:30,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:30,781 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 135 transitions. [2024-11-17 08:34:30,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2024-11-17 08:34:30,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 83 states and 86 transitions. [2024-11-17 08:34:30,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-17 08:34:30,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-17 08:34:30,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 86 transitions. [2024-11-17 08:34:30,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:34:30,788 INFO L218 hiAutomatonCegarLoop]: Abstraction has 83 states and 86 transitions. [2024-11-17 08:34:30,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 86 transitions. [2024-11-17 08:34:30,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 70. [2024-11-17 08:34:30,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 1.042857142857143) internal successors, (73), 69 states have internal predecessors, (73), 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-17 08:34:30,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2024-11-17 08:34:30,798 INFO L240 hiAutomatonCegarLoop]: Abstraction has 70 states and 73 transitions. [2024-11-17 08:34:30,798 INFO L425 stractBuchiCegarLoop]: Abstraction has 70 states and 73 transitions. [2024-11-17 08:34:30,799 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-17 08:34:30,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 73 transitions. [2024-11-17 08:34:30,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2024-11-17 08:34:30,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:34:30,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:34:30,804 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:34:30,804 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:34:30,804 INFO L745 eck$LassoCheckResult]: Stem: 1070#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); 1071#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_~j~0#1, main_~i~0#1;main_~i~0#1 := 0; 1059#L16 assume true; 1060#L16-1 assume !!(main_~i~0#1 < 4);main_~j~0#1 := 0; 1065#L18 assume true; 1116#L18-1 assume !!(main_~j~0#1 < 3);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 2 + main_~j~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1115#L13-7 assume !(0 == __VERIFIER_assert_~cond#1); 1114#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 2 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1113#L13-6 assume !(0 == __VERIFIER_assert_~cond#1); 1084#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~i~0#1 <= 6 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1085#L13-5 assume !(0 == __VERIFIER_assert_~cond#1); 1089#__VERIFIER_assert_returnLabel#3 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 4 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1093#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 1099#__VERIFIER_assert_returnLabel#4 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1094#L18 assume true; 1068#L18-1 assume !!(main_~j~0#1 < 3);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 2 + main_~j~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1069#L13-7 assume !(0 == __VERIFIER_assert_~cond#1); 1076#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 2 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1077#L13-6 assume !(0 == __VERIFIER_assert_~cond#1); 1111#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~i~0#1 <= 6 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1112#L13-5 assume !(0 == __VERIFIER_assert_~cond#1); 1107#__VERIFIER_assert_returnLabel#3 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 4 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1108#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 1103#__VERIFIER_assert_returnLabel#4 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1104#L18 assume true; 1100#L18-1 assume !(main_~j~0#1 < 3); 1082#L26 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1081#L13-3 assume !(0 == __VERIFIER_assert_~cond#1); 1072#__VERIFIER_assert_returnLabel#5 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 2 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1073#L13-2 assume !(0 == __VERIFIER_assert_~cond#1); 1086#__VERIFIER_assert_returnLabel#6 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~i~0#1 <= 6 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1087#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 1095#__VERIFIER_assert_returnLabel#7 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 4 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1096#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1097#__VERIFIER_assert_returnLabel#8 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_~i~0#1 := 1 + (main_~i~0#1 - (if main_~j~0#1 < 0 && 0 != main_~j~0#1 % 2 then 1 + main_~j~0#1 / 2 else main_~j~0#1 / 2));havoc main_~j~0#1; 1061#L16 assume true; 1063#L16-1 assume !!(main_~i~0#1 < 4);main_~j~0#1 := 0; 1064#L18 [2024-11-17 08:34:30,804 INFO L747 eck$LassoCheckResult]: Loop: 1064#L18 assume true; 1066#L18-1 assume !!(main_~j~0#1 < 3);main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;main_~j~0#1 := 2 + main_~j~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1067#L13-7 assume !(0 == __VERIFIER_assert_~cond#1); 1074#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 2 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1075#L13-6 assume !(0 == __VERIFIER_assert_~cond#1); 1078#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 * main_~i~0#1 <= 6 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1083#L13-5 assume !(0 == __VERIFIER_assert_~cond#1); 1088#__VERIFIER_assert_returnLabel#3 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= 4 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1092#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 1098#__VERIFIER_assert_returnLabel#4 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1064#L18 [2024-11-17 08:34:30,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:30,805 INFO L85 PathProgramCache]: Analyzing trace with hash 217417756, now seen corresponding path program 2 times [2024-11-17 08:34:30,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:30,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985051676] [2024-11-17 08:34:30,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:30,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:30,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:30,822 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:30,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:30,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:30,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1677798632, now seen corresponding path program 2 times [2024-11-17 08:34:30,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:30,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603958568] [2024-11-17 08:34:30,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:30,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:30,849 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:30,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:30,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:30,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1244950717, now seen corresponding path program 3 times [2024-11-17 08:34:30,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:34:30,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474638049] [2024-11-17 08:34:30,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:34:30,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:34:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:30,885 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:34:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:34:30,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:34:31,005 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:34:31,006 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:34:31,006 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:34:31,006 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:34:31,006 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-17 08:34:31,006 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:31,006 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:34:31,006 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:34:31,006 INFO L132 ssoRankerPreferences]: Filename of dumped script: bh2017-ex1-poly.i_Iteration6_Loop [2024-11-17 08:34:31,006 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:34:31,007 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:34:31,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:31,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:31,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:31,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:31,064 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:34:31,065 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-17 08:34:31,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:31,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:31,067 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-17 08:34:31,068 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-17 08:34:31,069 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:34:31,069 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:31,100 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-17 08:34:31,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:31,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:31,102 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-17 08:34:31,103 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-17 08:34:31,105 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-17 08:34:31,105 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:34:31,144 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-17 08:34:31,150 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-17 08:34:31,150 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:34:31,151 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:34:31,151 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:34:31,151 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:34:31,151 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:34:31,151 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:31,151 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:34:31,151 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:34:31,151 INFO L132 ssoRankerPreferences]: Filename of dumped script: bh2017-ex1-poly.i_Iteration6_Loop [2024-11-17 08:34:31,151 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:34:31,151 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:34:31,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:31,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:31,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:31,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:34:31,212 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:34:31,212 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:34:31,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:31,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:31,215 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-17 08:34:31,216 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-17 08:34:31,217 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-17 08:34:31,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:31,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:31,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:31,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:31,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:31,231 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:31,231 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:31,235 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:34:31,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-17 08:34:31,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:31,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:31,254 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-17 08:34:31,255 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-17 08:34:31,256 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-17 08:34:31,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:34:31,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:34:31,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:34:31,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:34:31,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:34:31,270 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:34:31,271 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:34:31,273 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:34:31,278 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-17 08:34:31,278 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-17 08:34:31,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:34:31,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:34:31,280 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-17 08:34:31,281 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-17 08:34:31,282 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:34:31,282 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-17 08:34:31,282 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:34:31,282 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 9 Supporting invariants [] [2024-11-17 08:34:31,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-17 08:34:31,299 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-17 08:34:31,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:31,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:31,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:34:31,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:31,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 08:34:31,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:31,462 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-17 08:34:31,463 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-11-17 08:34:31,463 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 73 transitions. cyclomatic complexity: 6 Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:31,540 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 73 transitions. cyclomatic complexity: 6. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 107 states and 111 transitions. Complement of second has 9 states. [2024-11-17 08:34:31,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-17 08:34:31,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:31,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2024-11-17 08:34:31,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 37 letters. Loop has 10 letters. [2024-11-17 08:34:31,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:31,542 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:34:31,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:31,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:34:31,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:31,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 08:34:31,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:31,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-17 08:34:31,753 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-17 08:34:31,754 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2024-11-17 08:34:31,754 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 73 transitions. cyclomatic complexity: 6 Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:31,889 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 73 transitions. cyclomatic complexity: 6. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 107 states and 111 transitions. Complement of second has 13 states. [2024-11-17 08:34:31,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2024-11-17 08:34:31,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:31,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2024-11-17 08:34:31,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 37 letters. Loop has 10 letters. [2024-11-17 08:34:31,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:31,892 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:34:31,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:34:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:31,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:34:31,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:34:31,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 08:34:31,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:34:32,074 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-17 08:34:32,075 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 4 loop predicates [2024-11-17 08:34:32,075 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 73 transitions. cyclomatic complexity: 6 Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:32,151 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 73 transitions. cyclomatic complexity: 6. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 128 states and 135 transitions. Complement of second has 8 states. [2024-11-17 08:34:32,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-17 08:34:32,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:34:32,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2024-11-17 08:34:32,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 37 letters. Loop has 10 letters. [2024-11-17 08:34:32,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:32,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 47 letters. Loop has 10 letters. [2024-11-17 08:34:32,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:32,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 37 letters. Loop has 20 letters. [2024-11-17 08:34:32,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:34:32,154 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 135 transitions. [2024-11-17 08:34:32,159 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-17 08:34:32,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 0 states and 0 transitions. [2024-11-17 08:34:32,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-17 08:34:32,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-17 08:34:32,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-17 08:34:32,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:34:32,159 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:34:32,159 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:34:32,159 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:34:32,159 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-17 08:34:32,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-17 08:34:32,160 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-17 08:34:32,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-17 08:34:32,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.11 08:34:32 BoogieIcfgContainer [2024-11-17 08:34:32,170 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-17 08:34:32,172 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 08:34:32,172 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 08:34:32,173 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 08:34:32,173 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:34:26" (3/4) ... [2024-11-17 08:34:32,175 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 08:34:32,176 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 08:34:32,177 INFO L158 Benchmark]: Toolchain (without parser) took 5888.24ms. Allocated memory was 142.6MB in the beginning and 182.5MB in the end (delta: 39.8MB). Free memory was 85.4MB in the beginning and 109.2MB in the end (delta: -23.8MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2024-11-17 08:34:32,177 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 90.2MB. Free memory is still 43.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:34:32,177 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.94ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 112.6MB in the end (delta: -27.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-17 08:34:32,178 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.14ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 111.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:34:32,179 INFO L158 Benchmark]: Boogie Preprocessor took 30.38ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 109.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:34:32,180 INFO L158 Benchmark]: IcfgBuilder took 288.51ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 97.3MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-17 08:34:32,181 INFO L158 Benchmark]: BuchiAutomizer took 5179.79ms. Allocated memory was 142.6MB in the beginning and 182.5MB in the end (delta: 39.8MB). Free memory was 96.7MB in the beginning and 109.2MB in the end (delta: -12.5MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2024-11-17 08:34:32,181 INFO L158 Benchmark]: Witness Printer took 3.96ms. Allocated memory is still 182.5MB. Free memory is still 109.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:34:32,183 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.19ms. Allocated memory is still 90.2MB. Free memory is still 43.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.94ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 112.6MB in the end (delta: -27.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.14ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 111.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.38ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 109.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 288.51ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 97.3MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 5179.79ms. Allocated memory was 142.6MB in the beginning and 182.5MB in the end (delta: 39.8MB). Free memory was 96.7MB in the beginning and 109.2MB in the end (delta: -12.5MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. * Witness Printer took 3.96ms. Allocated memory is still 182.5MB. Free memory is still 109.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * i) + 7) and consists of 7 locations. One deterministic module has affine ranking function (((long long) -2 * i) + 9) and consists of 5 locations. One nondeterministic module has affine ranking function (((long long) -2 * i) + 9) and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.1s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 2.7s. Construction of modules took 0.2s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 25 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 1, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/14 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 204 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 198 mSDsluCounter, 406 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 196 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 259 IncrementalHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 210 mSDtfsCounter, 259 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital24 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq142 hnf95 smp100 dnf100 smp100 tf107 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-17 08:34:32,213 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-17 08:34:32,412 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 Result: TRUE