./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d6dbcbf51695ea037a123bcc006ce5f6db095b874a22b169ec869d834ce41de6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 00:45:49,530 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:45:49,587 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-12 00:45:49,592 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:45:49,593 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:45:49,626 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:45:49,627 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:45:49,633 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:45:49,634 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:45:49,635 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:45:49,635 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:45:49,635 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:45:49,636 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:45:49,636 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:45:49,636 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:45:49,636 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:45:49,637 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:45:49,637 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:45:49,637 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:45:49,637 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:45:49,638 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:45:49,638 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 00:45:49,641 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:45:49,641 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 00:45:49,641 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:45:49,642 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:45:49,642 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:45:49,642 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:45:49,642 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:45:49,642 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:45:49,642 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 00:45:49,642 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:45:49,643 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:45:49,643 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:45:49,643 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:45:49,643 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:45:49,643 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:45:49,643 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:45:49,644 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:45:49,644 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d6dbcbf51695ea037a123bcc006ce5f6db095b874a22b169ec869d834ce41de6 [2024-10-12 00:45:49,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:45:49,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:45:49,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:45:49,856 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:45:49,856 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:45:49,857 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i [2024-10-12 00:45:51,082 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:45:51,234 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:45:51,234 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i [2024-10-12 00:45:51,240 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c686d3391/0014e2e7615d4c1c96e332756c218eda/FLAGd3d143525 [2024-10-12 00:45:51,635 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c686d3391/0014e2e7615d4c1c96e332756c218eda [2024-10-12 00:45:51,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:45:51,638 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:45:51,640 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:45:51,640 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:45:51,644 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:45:51,644 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:45:51" (1/1) ... [2024-10-12 00:45:51,645 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32001413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:51, skipping insertion in model container [2024-10-12 00:45:51,646 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:45:51" (1/1) ... [2024-10-12 00:45:51,661 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:45:51,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:45:51,798 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:45:51,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:45:51,821 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:45:51,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:51 WrapperNode [2024-10-12 00:45:51,821 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:45:51,822 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:45:51,822 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:45:51,822 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:45:51,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:51" (1/1) ... [2024-10-12 00:45:51,832 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:51" (1/1) ... [2024-10-12 00:45:51,844 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 11, calls inlined = 18, statements flattened = 90 [2024-10-12 00:45:51,844 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:45:51,845 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:45:51,845 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:45:51,845 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:45:51,853 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:51" (1/1) ... [2024-10-12 00:45:51,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:51" (1/1) ... [2024-10-12 00:45:51,854 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:51" (1/1) ... [2024-10-12 00:45:51,862 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 00:45:51,862 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:51" (1/1) ... [2024-10-12 00:45:51,862 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:51" (1/1) ... [2024-10-12 00:45:51,876 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:51" (1/1) ... [2024-10-12 00:45:51,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:51" (1/1) ... [2024-10-12 00:45:51,885 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:51" (1/1) ... [2024-10-12 00:45:51,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:51" (1/1) ... [2024-10-12 00:45:51,887 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:45:51,892 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:45:51,892 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:45:51,893 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:45:51,893 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:51" (1/1) ... [2024-10-12 00:45:51,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:51,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:51,927 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:51,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 00:45:51,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 00:45:51,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 00:45:51,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:45:51,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:45:52,014 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:45:52,016 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:45:52,139 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-10-12 00:45:52,139 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:45:52,152 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:45:52,153 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 00:45:52,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:45:52 BoogieIcfgContainer [2024-10-12 00:45:52,154 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:45:52,154 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:45:52,154 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:45:52,157 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:45:52,158 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:45:52,159 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:45:51" (1/3) ... [2024-10-12 00:45:52,160 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48f969d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:45:52, skipping insertion in model container [2024-10-12 00:45:52,160 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:45:52,161 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:45:51" (2/3) ... [2024-10-12 00:45:52,161 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48f969d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:45:52, skipping insertion in model container [2024-10-12 00:45:52,161 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:45:52,161 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:45:52" (3/3) ... [2024-10-12 00:45:52,163 INFO L332 chiAutomizerObserver]: Analyzing ICFG bh2017-ex1-poly.i [2024-10-12 00:45:52,208 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:45:52,208 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:45:52,208 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:45:52,208 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:45:52,208 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:45:52,208 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:45:52,209 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:45:52,209 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:45:52,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 49 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:45:52,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2024-10-12 00:45:52,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:45:52,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:45:52,232 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:45:52,232 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:45:52,233 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:45:52,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 49 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:45:52,235 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2024-10-12 00:45:52,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:45:52,235 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:45:52,236 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:45:52,236 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:45:52,242 INFO L745 eck$LassoCheckResult]: Stem: 17#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); 24#L-1true 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; 46#L16-2true [2024-10-12 00:45:52,243 INFO L747 eck$LassoCheckResult]: Loop: 46#L16-2true assume !!(main_~i~0#1 < 4);main_~j~0#1 := 0; 28#L18-2true assume !(main_~j~0#1 < 3); 30#L18-3true 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; 23#L13-16true assume !(0 == __VERIFIER_assert_~cond#1); 13#L13-19true 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; 50#L13-20true assume !(0 == __VERIFIER_assert_~cond#1); 39#L13-23true 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; 34#L13-24true assume !(0 == __VERIFIER_assert_~cond#1); 18#L13-27true 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; 25#L13-28true assume !(0 == __VERIFIER_assert_~cond#1); 42#L13-31true 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; 46#L16-2true [2024-10-12 00:45:52,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:52,249 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-12 00:45:52,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:52,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116054665] [2024-10-12 00:45:52,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:52,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:52,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:52,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:52,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:52,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:52,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1135295544, now seen corresponding path program 1 times [2024-10-12 00:45:52,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:52,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880432942] [2024-10-12 00:45:52,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:52,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:52,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:52,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:45:52,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880432942] [2024-10-12 00:45:52,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880432942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:45:52,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:45:52,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 00:45:52,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983404528] [2024-10-12 00:45:52,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:45:52,426 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:45:52,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:45:52,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:45:52,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:45:52,458 INFO L87 Difference]: Start difference. First operand has 49 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:45:52,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:45:52,487 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2024-10-12 00:45:52,488 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 43 transitions. [2024-10-12 00:45:52,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2024-10-12 00:45:52,491 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 22 states and 23 transitions. [2024-10-12 00:45:52,492 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-10-12 00:45:52,492 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2024-10-12 00:45:52,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 23 transitions. [2024-10-12 00:45:52,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:45:52,493 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 23 transitions. [2024-10-12 00:45:52,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 23 transitions. [2024-10-12 00:45:52,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-12 00:45:52,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:45:52,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2024-10-12 00:45:52,512 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 23 transitions. [2024-10-12 00:45:52,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:45:52,516 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2024-10-12 00:45:52,516 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:45:52,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 23 transitions. [2024-10-12 00:45:52,516 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2024-10-12 00:45:52,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:45:52,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:45:52,517 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:45:52,517 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:45:52,517 INFO L745 eck$LassoCheckResult]: Stem: 118#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); 107#L-1 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; 108#L16-2 [2024-10-12 00:45:52,517 INFO L747 eck$LassoCheckResult]: Loop: 108#L16-2 assume !!(main_~i~0#1 < 4);main_~j~0#1 := 0; 115#L18-2 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; 114#L13 assume !(0 == __VERIFIER_assert_~cond#1); 105#L13-3 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; 106#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 111#L13-7 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; 112#L13-8 assume !(0 == __VERIFIER_assert_~cond#1); 113#L13-11 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; 116#L13-12 assume !(0 == __VERIFIER_assert_~cond#1); 120#L13-15 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 121#L18-2 assume !(main_~j~0#1 < 3); 117#L18-3 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; 102#L13-16 assume !(0 == __VERIFIER_assert_~cond#1); 100#L13-19 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; 101#L13-20 assume !(0 == __VERIFIER_assert_~cond#1); 103#L13-23 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; 104#L13-24 assume !(0 == __VERIFIER_assert_~cond#1); 119#L13-27 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; 110#L13-28 assume !(0 == __VERIFIER_assert_~cond#1); 109#L13-31 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; 108#L16-2 [2024-10-12 00:45:52,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:52,518 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-10-12 00:45:52,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:52,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587830937] [2024-10-12 00:45:52,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:52,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:52,525 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:52,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:52,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:52,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1841154240, now seen corresponding path program 1 times [2024-10-12 00:45:52,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:52,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733437979] [2024-10-12 00:45:52,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:52,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:52,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:52,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:45:52,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733437979] [2024-10-12 00:45:52,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733437979] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:45:52,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851554006] [2024-10-12 00:45:52,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:52,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:45:52,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:52,680 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:45:52,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 00:45:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:52,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 00:45:52,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:52,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:52,779 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:45:52,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:52,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851554006] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:45:52,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:45:52,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2024-10-12 00:45:52,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727228908] [2024-10-12 00:45:52,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:45:52,817 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:45:52,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:45:52,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 00:45:52,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 00:45:52,817 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:45:52,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:45:52,838 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2024-10-12 00:45:52,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 32 transitions. [2024-10-12 00:45:52,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2024-10-12 00:45:52,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 32 transitions. [2024-10-12 00:45:52,840 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-10-12 00:45:52,840 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-10-12 00:45:52,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 32 transitions. [2024-10-12 00:45:52,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:45:52,840 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 32 transitions. [2024-10-12 00:45:52,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 32 transitions. [2024-10-12 00:45:52,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-12 00:45:52,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.032258064516129) internal successors, (32), 30 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:45:52,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2024-10-12 00:45:52,844 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 32 transitions. [2024-10-12 00:45:52,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 00:45:52,844 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 32 transitions. [2024-10-12 00:45:52,845 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:45:52,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 32 transitions. [2024-10-12 00:45:52,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2024-10-12 00:45:52,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:45:52,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:45:52,846 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:45:52,846 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:45:52,846 INFO L745 eck$LassoCheckResult]: Stem: 293#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); 281#L-1 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; 282#L16-2 [2024-10-12 00:45:52,846 INFO L747 eck$LassoCheckResult]: Loop: 282#L16-2 assume !!(main_~i~0#1 < 4);main_~j~0#1 := 0; 290#L18-2 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; 288#L13 assume !(0 == __VERIFIER_assert_~cond#1); 289#L13-3 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; 304#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 303#L13-7 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; 302#L13-8 assume !(0 == __VERIFIER_assert_~cond#1); 301#L13-11 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; 300#L13-12 assume !(0 == __VERIFIER_assert_~cond#1); 295#L13-15 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 296#L18-2 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; 299#L13 assume !(0 == __VERIFIER_assert_~cond#1); 279#L13-3 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; 280#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 285#L13-7 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; 286#L13-8 assume !(0 == __VERIFIER_assert_~cond#1); 287#L13-11 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; 291#L13-12 assume !(0 == __VERIFIER_assert_~cond#1); 297#L13-15 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 298#L18-2 assume !(main_~j~0#1 < 3); 292#L18-3 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; 276#L13-16 assume !(0 == __VERIFIER_assert_~cond#1); 274#L13-19 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; 275#L13-20 assume !(0 == __VERIFIER_assert_~cond#1); 277#L13-23 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; 278#L13-24 assume !(0 == __VERIFIER_assert_~cond#1); 294#L13-27 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; 283#L13-28 assume !(0 == __VERIFIER_assert_~cond#1); 284#L13-31 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; 282#L16-2 [2024-10-12 00:45:52,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:52,849 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-10-12 00:45:52,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:52,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704080210] [2024-10-12 00:45:52,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:52,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:52,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:52,855 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:52,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:52,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:52,863 INFO L85 PathProgramCache]: Analyzing trace with hash -257874632, now seen corresponding path program 2 times [2024-10-12 00:45:52,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:52,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513035138] [2024-10-12 00:45:52,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:52,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:52,912 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:52,941 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:52,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:52,946 INFO L85 PathProgramCache]: Analyzing trace with hash 2038304950, now seen corresponding path program 1 times [2024-10-12 00:45:52,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:52,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848364216] [2024-10-12 00:45:52,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:52,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:52,974 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:52,995 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:53,364 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:45:53,364 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:45:53,364 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:45:53,365 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:45:53,365 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:45:53,365 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:53,365 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:45:53,365 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:45:53,365 INFO L132 ssoRankerPreferences]: Filename of dumped script: bh2017-ex1-poly.i_Iteration3_Loop [2024-10-12 00:45:53,365 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:45:53,365 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:45:53,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:53,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:53,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:53,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:53,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:53,425 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:45:53,426 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:45:53,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:53,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:53,429 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:53,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-12 00:45:53,431 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:53,432 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:53,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:53,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:53,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:53,457 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:53,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-12 00:45:53,459 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:45:53,459 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:53,498 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:45:53,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:53,504 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:45:53,505 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:45:53,505 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:45:53,505 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:45:53,505 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:45:53,505 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:53,505 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:45:53,505 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:45:53,505 INFO L132 ssoRankerPreferences]: Filename of dumped script: bh2017-ex1-poly.i_Iteration3_Loop [2024-10-12 00:45:53,505 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:45:53,505 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:45:53,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:53,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:53,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:53,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:53,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:53,551 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:45:53,554 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:45:53,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:53,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:53,557 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:53,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 00:45:53,559 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:45:53,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:53,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:53,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:53,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:53,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:53,573 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:53,573 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:53,574 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:45:53,578 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:45:53,578 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:45:53,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:53,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:53,581 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:53,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-12 00:45:53,583 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:45:53,583 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:45:53,584 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:45:53,584 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-10-12 00:45:53,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:53,597 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:45:53,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:53,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:45:53,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:53,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:45:53,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:53,900 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:53,903 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-10-12 00:45:53,907 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 32 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:45:53,976 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 32 transitions. cyclomatic complexity: 2. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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 87 states and 90 transitions. Complement of second has 7 states. [2024-10-12 00:45:53,977 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-10-12 00:45:53,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:45:53,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2024-10-12 00:45:53,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 2 letters. Loop has 29 letters. [2024-10-12 00:45:53,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:53,980 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:45:53,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:54,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:45:54,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:54,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:45:54,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:54,263 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:54,263 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-10-12 00:45:54,264 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 32 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:45:54,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-12 00:45:54,381 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 32 transitions. cyclomatic complexity: 2. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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 60 states and 63 transitions. Complement of second has 10 states. [2024-10-12 00:45:54,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2024-10-12 00:45:54,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:45:54,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2024-10-12 00:45:54,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 2 letters. Loop has 29 letters. [2024-10-12 00:45:54,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:54,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 31 letters. Loop has 29 letters. [2024-10-12 00:45:54,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:54,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 2 letters. Loop has 58 letters. [2024-10-12 00:45:54,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:54,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 63 transitions. [2024-10-12 00:45:54,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-10-12 00:45:54,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 51 states and 54 transitions. [2024-10-12 00:45:54,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-10-12 00:45:54,394 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2024-10-12 00:45:54,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 54 transitions. [2024-10-12 00:45:54,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:45:54,394 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 54 transitions. [2024-10-12 00:45:54,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 54 transitions. [2024-10-12 00:45:54,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2024-10-12 00:45:54,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:45:54,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2024-10-12 00:45:54,399 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 44 transitions. [2024-10-12 00:45:54,399 INFO L425 stractBuchiCegarLoop]: Abstraction has 41 states and 44 transitions. [2024-10-12 00:45:54,399 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:45:54,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 44 transitions. [2024-10-12 00:45:54,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-10-12 00:45:54,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:45:54,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:45:54,400 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-12 00:45:54,400 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:45:54,400 INFO L745 eck$LassoCheckResult]: Stem: 708#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); 689#L-1 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; 690#L16-2 assume !!(main_~i~0#1 < 4);main_~j~0#1 := 0; 703#L18-2 [2024-10-12 00:45:54,400 INFO L747 eck$LassoCheckResult]: Loop: 703#L18-2 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; 700#L13 assume !(0 == __VERIFIER_assert_~cond#1); 685#L13-3 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; 686#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 694#L13-7 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; 695#L13-8 assume !(0 == __VERIFIER_assert_~cond#1); 698#L13-11 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; 705#L13-12 assume !(0 == __VERIFIER_assert_~cond#1); 710#L13-15 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 703#L18-2 [2024-10-12 00:45:54,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:54,401 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2024-10-12 00:45:54,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:54,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169716809] [2024-10-12 00:45:54,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:54,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:54,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:54,411 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:54,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:54,412 INFO L85 PathProgramCache]: Analyzing trace with hash 507021115, now seen corresponding path program 1 times [2024-10-12 00:45:54,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:54,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088969368] [2024-10-12 00:45:54,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:54,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:54,433 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:54,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:54,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:54,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1050452364, now seen corresponding path program 1 times [2024-10-12 00:45:54,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:54,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856788369] [2024-10-12 00:45:54,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:54,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:54,461 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:54,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:54,555 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:45:54,555 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:45:54,556 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:45:54,556 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:45:54,556 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:45:54,556 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:54,556 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:45:54,556 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:45:54,556 INFO L132 ssoRankerPreferences]: Filename of dumped script: bh2017-ex1-poly.i_Iteration4_Loop [2024-10-12 00:45:54,556 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:45:54,556 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:45:54,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:54,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:54,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:54,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:54,603 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:45:54,603 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:45:54,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:54,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:54,605 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:54,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-12 00:45:54,607 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:54,607 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:54,619 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:45:54,619 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post1#1=0} Honda state: {ULTIMATE.start_main_#t~post1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:45:54,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-12 00:45:54,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:54,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:54,632 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:54,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-12 00:45:54,634 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:54,635 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:54,647 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:45:54,647 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:45:54,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:54,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:54,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:54,661 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:54,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-12 00:45:54,665 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:54,665 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:54,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:54,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:54,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:54,692 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:54,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-12 00:45:54,693 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:45:54,693 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:54,726 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:45:54,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:54,731 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:45:54,731 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:45:54,731 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:45:54,731 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:45:54,731 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:45:54,731 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:54,731 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:45:54,731 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:45:54,732 INFO L132 ssoRankerPreferences]: Filename of dumped script: bh2017-ex1-poly.i_Iteration4_Loop [2024-10-12 00:45:54,732 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:45:54,732 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:45:54,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:54,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:54,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:54,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:54,778 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:45:54,778 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:45:54,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:54,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:54,780 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:54,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-12 00:45:54,782 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:45:54,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:54,793 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:54,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:54,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:54,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:54,794 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:54,794 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:54,795 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:54,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-12 00:45:54,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:54,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:54,808 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:54,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-12 00:45:54,811 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:45:54,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:54,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:54,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:54,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:54,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:54,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:54,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:54,824 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:54,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:54,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:54,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:54,838 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:54,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-12 00:45:54,840 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:45:54,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:54,850 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:54,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:54,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:54,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:54,852 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:54,852 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:54,855 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:45:54,857 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:45:54,858 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:45:54,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:54,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:54,859 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:54,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-12 00:45:54,861 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:45:54,861 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:45:54,861 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:45:54,861 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -1*ULTIMATE.start_main_~j~0#1 + 3 Supporting invariants [] [2024-10-12 00:45:54,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:54,879 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:45:54,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:54,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:45:54,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:54,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:45:54,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:54,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:54,940 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-12 00:45:54,940 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 44 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-10-12 00:45:54,965 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 44 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) Result 112 states and 116 transitions. Complement of second has 5 states. [2024-10-12 00:45:54,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 00:45:54,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-10-12 00:45:54,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2024-10-12 00:45:54,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 3 letters. Loop has 9 letters. [2024-10-12 00:45:54,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:54,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 12 letters. Loop has 9 letters. [2024-10-12 00:45:54,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:54,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 3 letters. Loop has 18 letters. [2024-10-12 00:45:54,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:54,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 116 transitions. [2024-10-12 00:45:54,970 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-10-12 00:45:54,971 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 77 states and 80 transitions. [2024-10-12 00:45:54,971 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-12 00:45:54,971 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-12 00:45:54,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 80 transitions. [2024-10-12 00:45:54,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:45:54,971 INFO L218 hiAutomatonCegarLoop]: Abstraction has 77 states and 80 transitions. [2024-10-12 00:45:54,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 80 transitions. [2024-10-12 00:45:54,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 60. [2024-10-12 00:45:54,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.05) internal successors, (63), 59 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:45:54,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2024-10-12 00:45:54,980 INFO L240 hiAutomatonCegarLoop]: Abstraction has 60 states and 63 transitions. [2024-10-12 00:45:54,980 INFO L425 stractBuchiCegarLoop]: Abstraction has 60 states and 63 transitions. [2024-10-12 00:45:54,981 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:45:54,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 63 transitions. [2024-10-12 00:45:54,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-10-12 00:45:54,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:45:54,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:45:54,982 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:45:54,983 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:45:54,984 INFO L745 eck$LassoCheckResult]: Stem: 917#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); 898#L-1 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; 899#L16-2 assume !!(main_~i~0#1 < 4);main_~j~0#1 := 0; 918#L18-2 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; 910#L13 assume !(0 == __VERIFIER_assert_~cond#1); 896#L13-3 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; 897#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 905#L13-7 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; 906#L13-8 assume !(0 == __VERIFIER_assert_~cond#1); 908#L13-11 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; 915#L13-12 assume !(0 == __VERIFIER_assert_~cond#1); 923#L13-15 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 942#L18-2 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; 939#L13 assume !(0 == __VERIFIER_assert_~cond#1); 940#L13-3 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; 935#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 936#L13-7 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; 931#L13-8 assume !(0 == __VERIFIER_assert_~cond#1); 932#L13-11 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; 927#L13-12 assume !(0 == __VERIFIER_assert_~cond#1); 928#L13-15 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 924#L18-2 assume !(main_~j~0#1 < 3); 916#L18-3 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; 891#L13-16 assume !(0 == __VERIFIER_assert_~cond#1); 889#L13-19 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; 890#L13-20 assume !(0 == __VERIFIER_assert_~cond#1); 892#L13-23 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; 893#L13-24 assume !(0 == __VERIFIER_assert_~cond#1); 919#L13-27 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; 900#L13-28 assume !(0 == __VERIFIER_assert_~cond#1); 901#L13-31 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; 902#L16-2 assume !!(main_~i~0#1 < 4);main_~j~0#1 := 0; 911#L18-2 [2024-10-12 00:45:54,984 INFO L747 eck$LassoCheckResult]: Loop: 911#L18-2 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; 909#L13 assume !(0 == __VERIFIER_assert_~cond#1); 894#L13-3 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; 895#L13-4 assume !(0 == __VERIFIER_assert_~cond#1); 903#L13-7 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; 904#L13-8 assume !(0 == __VERIFIER_assert_~cond#1); 907#L13-11 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; 914#L13-12 assume !(0 == __VERIFIER_assert_~cond#1); 920#L13-15 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 911#L18-2 [2024-10-12 00:45:54,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:54,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1237055979, now seen corresponding path program 2 times [2024-10-12 00:45:54,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:54,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198985577] [2024-10-12 00:45:54,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:54,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:55,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:55,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:55,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:55,018 INFO L85 PathProgramCache]: Analyzing trace with hash 507021115, now seen corresponding path program 2 times [2024-10-12 00:45:55,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:55,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516023344] [2024-10-12 00:45:55,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:55,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:55,023 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:55,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:55,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:55,029 INFO L85 PathProgramCache]: Analyzing trace with hash 47716263, now seen corresponding path program 3 times [2024-10-12 00:45:55,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:45:55,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165507417] [2024-10-12 00:45:55,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:45:55,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:45:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:55,044 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:45:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:45:55,056 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:45:55,137 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:45:55,138 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:45:55,138 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:45:55,138 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:45:55,138 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:45:55,138 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:55,138 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:45:55,138 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:45:55,138 INFO L132 ssoRankerPreferences]: Filename of dumped script: bh2017-ex1-poly.i_Iteration5_Loop [2024-10-12 00:45:55,138 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:45:55,138 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:45:55,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:55,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:55,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:55,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:55,179 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:45:55,181 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:45:55,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:55,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:55,182 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:55,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-12 00:45:55,185 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:55,185 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:55,196 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:45:55,196 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post1#1=0} Honda state: {ULTIMATE.start_main_#t~post1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:45:55,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:55,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:55,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:55,210 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:55,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-12 00:45:55,213 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:55,213 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:55,224 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:45:55,225 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:45:55,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:55,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:55,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:55,238 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:55,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-12 00:45:55,241 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:45:55,241 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:55,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:55,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:55,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:55,266 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:55,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-12 00:45:55,267 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:45:55,267 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:45:55,406 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:45:55,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-10-12 00:45:55,411 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:45:55,411 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:45:55,411 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:45:55,411 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:45:55,411 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:45:55,411 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:55,411 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:45:55,411 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:45:55,412 INFO L132 ssoRankerPreferences]: Filename of dumped script: bh2017-ex1-poly.i_Iteration5_Loop [2024-10-12 00:45:55,412 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:45:55,412 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:45:55,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:55,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:55,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:55,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:45:55,460 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:45:55,460 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:45:55,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:55,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:55,461 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:55,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-12 00:45:55,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:45:55,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:55,473 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:55,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:55,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:55,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:55,474 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:55,474 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:55,475 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:55,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-12 00:45:55,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:55,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:55,486 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:55,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-12 00:45:55,488 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:45:55,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:55,498 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:55,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:55,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:55,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:55,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:55,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:55,500 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:55,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:55,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:55,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:55,511 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:55,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-12 00:45:55,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:45:55,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:55,523 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:55,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:55,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:55,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:55,523 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:55,523 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:55,524 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:45:55,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:55,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:55,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:55,537 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:55,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-12 00:45:55,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:45:55,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:45:55,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:45:55,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:45:55,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:45:55,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:45:55,552 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:45:55,553 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:45:55,555 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:45:55,557 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:45:55,557 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:45:55,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:45:55,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:45:55,559 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:45:55,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-12 00:45:55,560 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:45:55,560 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:45:55,560 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:45:55,561 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-10-12 00:45:55,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:55,573 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:45:55,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:55,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:45:55,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:55,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:45:55,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:55,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-12 00:45:55,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-10-12 00:45:55,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:55,743 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-10-12 00:45:55,744 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 63 transitions. cyclomatic complexity: 6 Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:45:55,797 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 63 transitions. cyclomatic complexity: 6. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 94 states and 98 transitions. Complement of second has 9 states. [2024-10-12 00:45:55,798 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-10-12 00:45:55,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:45:55,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2024-10-12 00:45:55,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 32 letters. Loop has 9 letters. [2024-10-12 00:45:55,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:55,798 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:45:55,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:55,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:55,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:45:55,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:55,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:45:55,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:55,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:55,918 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-10-12 00:45:55,919 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 63 transitions. cyclomatic complexity: 6 Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:45:56,013 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 63 transitions. cyclomatic complexity: 6. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 94 states and 98 transitions. Complement of second has 13 states. [2024-10-12 00:45:56,014 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-10-12 00:45:56,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:45:56,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2024-10-12 00:45:56,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 32 letters. Loop has 9 letters. [2024-10-12 00:45:56,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:56,015 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:45:56,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:45:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:56,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:45:56,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:45:56,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:45:56,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:45:56,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:45:56,165 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-10-12 00:45:56,165 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 63 transitions. cyclomatic complexity: 6 Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:45:56,225 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 63 transitions. cyclomatic complexity: 6. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 111 states and 118 transitions. Complement of second has 8 states. [2024-10-12 00:45:56,226 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-10-12 00:45:56,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:45:56,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2024-10-12 00:45:56,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 32 letters. Loop has 9 letters. [2024-10-12 00:45:56,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:56,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 41 letters. Loop has 9 letters. [2024-10-12 00:45:56,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:56,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 32 letters. Loop has 18 letters. [2024-10-12 00:45:56,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:45:56,230 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 118 transitions. [2024-10-12 00:45:56,231 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:45:56,231 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 0 states and 0 transitions. [2024-10-12 00:45:56,231 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-12 00:45:56,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-12 00:45:56,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-12 00:45:56,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:45:56,231 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:45:56,231 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:45:56,231 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:45:56,231 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 00:45:56,231 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-12 00:45:56,231 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:45:56,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-12 00:45:56,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 12:45:56 BoogieIcfgContainer [2024-10-12 00:45:56,237 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 00:45:56,238 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 00:45:56,238 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 00:45:56,238 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 00:45:56,238 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:45:52" (3/4) ... [2024-10-12 00:45:56,239 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 00:45:56,240 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 00:45:56,240 INFO L158 Benchmark]: Toolchain (without parser) took 4602.47ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 112.9MB in the beginning and 109.0MB in the end (delta: 3.9MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB. [2024-10-12 00:45:56,241 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 104.9MB. Free memory was 72.9MB in the beginning and 72.7MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:45:56,241 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.16ms. Allocated memory is still 178.3MB. Free memory was 112.7MB in the beginning and 100.9MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 00:45:56,241 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.30ms. Allocated memory is still 178.3MB. Free memory was 100.9MB in the beginning and 99.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:45:56,241 INFO L158 Benchmark]: Boogie Preprocessor took 45.40ms. Allocated memory is still 178.3MB. Free memory was 99.2MB in the beginning and 152.0MB in the end (delta: -52.9MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2024-10-12 00:45:56,241 INFO L158 Benchmark]: RCFGBuilder took 261.39ms. Allocated memory is still 178.3MB. Free memory was 152.0MB in the beginning and 139.0MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 00:45:56,242 INFO L158 Benchmark]: BuchiAutomizer took 4083.03ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 139.0MB in the beginning and 110.0MB in the end (delta: 28.9MB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. [2024-10-12 00:45:56,242 INFO L158 Benchmark]: Witness Printer took 2.30ms. Allocated memory is still 213.9MB. Free memory was 110.0MB in the beginning and 109.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:45:56,243 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 104.9MB. Free memory was 72.9MB in the beginning and 72.7MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 182.16ms. Allocated memory is still 178.3MB. Free memory was 112.7MB in the beginning and 100.9MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.30ms. Allocated memory is still 178.3MB. Free memory was 100.9MB in the beginning and 99.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.40ms. Allocated memory is still 178.3MB. Free memory was 99.2MB in the beginning and 152.0MB in the end (delta: -52.9MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. * RCFGBuilder took 261.39ms. Allocated memory is still 178.3MB. Free memory was 152.0MB in the beginning and 139.0MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 4083.03ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 139.0MB in the beginning and 110.0MB in the end (delta: 28.9MB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. * Witness Printer took 2.30ms. Allocated memory is still 213.9MB. Free memory was 110.0MB in the beginning and 109.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * i) + 7) and consists of 6 locations. One deterministic module has affine ranking function (((long long) -1 * j) + 3) and consists of 3 locations. One nondeterministic module has affine ranking function (((long long) -2 * i) + 9) and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.0s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 2.3s. Construction of modules took 0.1s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 27 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/11 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 172 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 166 mSDsluCounter, 329 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 165 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 243 IncrementalHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 164 mSDtfsCounter, 243 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 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: sat Degree: 0 Time: 28ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-12 00:45:56,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 00:45:56,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE