./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version b5317dae Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7c4ca36c34c25cccb97ec2e65527d2a743b4e62b95f1f396c9f281ef44a01670 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 04:33:51,551 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 04:33:51,554 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 04:33:51,593 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 04:33:51,593 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 04:33:51,596 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 04:33:51,599 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 04:33:51,601 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 04:33:51,603 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 04:33:51,608 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 04:33:51,610 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 04:33:51,612 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 04:33:51,613 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 04:33:51,615 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 04:33:51,616 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 04:33:51,617 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 04:33:51,618 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 04:33:51,620 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 04:33:51,621 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 04:33:51,627 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 04:33:51,629 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 04:33:51,630 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 04:33:51,631 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 04:33:51,631 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 04:33:51,638 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 04:33:51,639 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 04:33:51,639 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 04:33:51,640 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 04:33:51,641 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 04:33:51,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 04:33:51,642 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 04:33:51,642 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 04:33:51,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 04:33:51,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 04:33:51,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 04:33:51,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 04:33:51,649 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 04:33:51,649 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 04:33:51,649 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 04:33:51,650 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 04:33:51,651 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 04:33:51,652 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-02-16 04:33:51,681 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 04:33:51,681 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 04:33:51,682 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 04:33:51,682 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 04:33:51,683 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 04:33:51,683 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 04:33:51,683 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 04:33:51,684 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-02-16 04:33:51,684 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-02-16 04:33:51,684 INFO L138 SettingsManager]: * Use old map elimination=false [2023-02-16 04:33:51,685 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2023-02-16 04:33:51,685 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2023-02-16 04:33:51,685 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-02-16 04:33:51,685 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 04:33:51,686 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 04:33:51,686 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 04:33:51,686 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 04:33:51,686 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-02-16 04:33:51,686 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-02-16 04:33:51,686 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-02-16 04:33:51,687 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 04:33:51,687 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-02-16 04:33:51,687 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 04:33:51,687 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-02-16 04:33:51,687 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 04:33:51,687 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 04:33:51,688 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 04:33:51,688 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 04:33:51,689 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-02-16 04:33:51,690 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7c4ca36c34c25cccb97ec2e65527d2a743b4e62b95f1f396c9f281ef44a01670 [2023-02-16 04:33:51,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 04:33:51,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 04:33:51,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 04:33:51,932 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 04:33:51,933 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 04:33:51,934 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.c [2023-02-16 04:33:53,132 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 04:33:53,311 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 04:33:53,312 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.c [2023-02-16 04:33:53,316 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e67367c47/5dcaf87db0984ea595fb9c757715605e/FLAG1b9f593b8 [2023-02-16 04:33:53,328 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e67367c47/5dcaf87db0984ea595fb9c757715605e [2023-02-16 04:33:53,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 04:33:53,331 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 04:33:53,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 04:33:53,332 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 04:33:53,335 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 04:33:53,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 04:33:53" (1/1) ... [2023-02-16 04:33:53,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7889a811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:33:53, skipping insertion in model container [2023-02-16 04:33:53,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 04:33:53" (1/1) ... [2023-02-16 04:33:53,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 04:33:53,354 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 04:33:53,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 04:33:53,502 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 04:33:53,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 04:33:53,527 INFO L208 MainTranslator]: Completed translation [2023-02-16 04:33:53,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:33:53 WrapperNode [2023-02-16 04:33:53,529 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 04:33:53,530 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 04:33:53,530 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 04:33:53,530 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 04:33:53,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:33:53" (1/1) ... [2023-02-16 04:33:53,542 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:33:53" (1/1) ... [2023-02-16 04:33:53,555 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2023-02-16 04:33:53,556 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 04:33:53,557 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 04:33:53,557 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 04:33:53,558 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 04:33:53,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:33:53" (1/1) ... [2023-02-16 04:33:53,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:33:53" (1/1) ... [2023-02-16 04:33:53,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:33:53" (1/1) ... [2023-02-16 04:33:53,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:33:53" (1/1) ... [2023-02-16 04:33:53,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:33:53" (1/1) ... [2023-02-16 04:33:53,572 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:33:53" (1/1) ... [2023-02-16 04:33:53,573 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:33:53" (1/1) ... [2023-02-16 04:33:53,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:33:53" (1/1) ... [2023-02-16 04:33:53,575 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 04:33:53,576 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 04:33:53,576 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 04:33:53,576 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 04:33:53,577 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:33:53" (1/1) ... [2023-02-16 04:33:53,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:53,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:53,608 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:53,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-02-16 04:33:53,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 04:33:53,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 04:33:53,713 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 04:33:53,716 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 04:33:53,800 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 04:33:53,805 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 04:33:53,805 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-16 04:33:53,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 04:33:53 BoogieIcfgContainer [2023-02-16 04:33:53,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 04:33:53,809 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-02-16 04:33:53,809 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2023-02-16 04:33:53,812 INFO L275 PluginConnector]: BuchiAutomizer initialized [2023-02-16 04:33:53,813 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-16 04:33:53,813 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.02 04:33:53" (1/3) ... [2023-02-16 04:33:53,814 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6da0d7f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.02 04:33:53, skipping insertion in model container [2023-02-16 04:33:53,814 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-16 04:33:53,815 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:33:53" (2/3) ... [2023-02-16 04:33:53,815 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6da0d7f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.02 04:33:53, skipping insertion in model container [2023-02-16 04:33:53,815 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-16 04:33:53,815 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 04:33:53" (3/3) ... [2023-02-16 04:33:53,817 INFO L332 chiAutomizerObserver]: Analyzing ICFG UpAndDownIneq.c [2023-02-16 04:33:53,875 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-02-16 04:33:53,875 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-02-16 04:33:53,876 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-02-16 04:33:53,876 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-02-16 04:33:53,876 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-02-16 04:33:53,876 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-02-16 04:33:53,876 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-02-16 04:33:53,876 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-02-16 04:33:53,880 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:33:53,893 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-16 04:33:53,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-16 04:33:53,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-16 04:33:53,898 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-16 04:33:53,898 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-16 04:33:53,898 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-02-16 04:33:53,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:33:53,900 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-16 04:33:53,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-16 04:33:53,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-16 04:33:53,900 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-16 04:33:53,900 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-16 04:33:53,907 INFO L748 eck$LassoCheckResult]: Stem: 6#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 4#L18-1true [2023-02-16 04:33:53,907 INFO L750 eck$LassoCheckResult]: Loop: 4#L18-1true assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 10#L12true assume !(main_~i~0#1 >= 10); 2#L12-2true assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 7#L15-1true assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4#L18-1true [2023-02-16 04:33:53,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:53,913 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-02-16 04:33:53,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:53,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792920509] [2023-02-16 04:33:53,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:53,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:53,995 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:33:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:54,015 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:33:54,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:54,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1267244, now seen corresponding path program 1 times [2023-02-16 04:33:54,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:54,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426897150] [2023-02-16 04:33:54,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:54,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:54,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:54,044 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:33:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:54,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:33:54,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:54,066 INFO L85 PathProgramCache]: Analyzing trace with hash 889694446, now seen corresponding path program 1 times [2023-02-16 04:33:54,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:54,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749750144] [2023-02-16 04:33:54,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:54,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:54,080 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:33:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:54,088 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:33:54,212 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:33:54,213 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:33:54,213 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:33:54,213 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:33:54,214 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-16 04:33:54,214 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:54,214 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:33:54,214 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:33:54,214 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration1_Loop [2023-02-16 04:33:54,214 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:33:54,215 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:33:54,242 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:54,266 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:54,271 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:54,280 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:54,347 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:33:54,348 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-16 04:33:54,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:54,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:54,355 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:54,361 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:33:54,361 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:54,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-02-16 04:33:54,390 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-16 04:33:54,390 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-16 04:33:54,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:54,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:54,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:54,401 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:54,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-02-16 04:33:54,408 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:33:54,408 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:54,437 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-16 04:33:54,437 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-16 04:33:54,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:54,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:54,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:54,444 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:54,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-02-16 04:33:54,449 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:33:54,449 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:54,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:54,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:54,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:54,489 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:54,496 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-16 04:33:54,496 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:54,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-02-16 04:33:54,526 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-16 04:33:54,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:54,535 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:33:54,535 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:33:54,535 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:33:54,535 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:33:54,535 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-16 04:33:54,536 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:54,536 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:33:54,536 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:33:54,536 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration1_Loop [2023-02-16 04:33:54,536 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:33:54,536 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:33:54,538 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:54,546 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:54,560 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:54,563 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:54,629 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:33:54,632 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-16 04:33:54,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:54,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:54,637 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:54,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-02-16 04:33:54,645 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 [2023-02-16 04:33:54,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:33:54,653 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-16 04:33:54,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:33:54,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-16 04:33:54,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:33:54,657 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-16 04:33:54,657 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-16 04:33:54,673 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-16 04:33:54,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:54,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:54,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:54,682 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:54,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-02-16 04:33:54,687 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 [2023-02-16 04:33:54,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:33:54,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:33:54,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-16 04:33:54,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:33:54,698 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-16 04:33:54,698 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-16 04:33:54,717 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-16 04:33:54,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:54,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:54,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:54,725 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:54,732 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 [2023-02-16 04:33:54,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:33:54,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:33:54,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-16 04:33:54,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:33:54,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-02-16 04:33:54,761 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-16 04:33:54,761 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-16 04:33:54,770 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-16 04:33:54,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:54,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:54,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:54,779 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:54,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-02-16 04:33:54,783 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 [2023-02-16 04:33:54,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:33:54,790 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-16 04:33:54,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:33:54,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-16 04:33:54,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:33:54,792 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-16 04:33:54,793 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-16 04:33:54,809 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-16 04:33:54,813 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-16 04:33:54,814 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-16 04:33:54,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:54,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:54,839 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:54,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-02-16 04:33:54,842 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-16 04:33:54,842 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-16 04:33:54,842 INFO L513 LassoAnalysis]: Proved termination. [2023-02-16 04:33:54,843 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 1 Supporting invariants [] [2023-02-16 04:33:54,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:54,852 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-16 04:33:54,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:54,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:33:54,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:54,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 04:33:54,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33: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. [2023-02-16 04:33:54,974 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 [2023-02-16 04:33:54,976 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:33:55,055 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 36 states and 54 transitions. Complement of second has 8 states. [2023-02-16 04:33:55,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-16 04:33:55,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:33:55,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2023-02-16 04:33:55,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 4 letters. [2023-02-16 04:33:55,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:55,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 6 letters. Loop has 4 letters. [2023-02-16 04:33:55,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:55,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2023-02-16 04:33:55,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:55,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 54 transitions. [2023-02-16 04:33:55,087 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2023-02-16 04:33:55,091 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 19 states and 30 transitions. [2023-02-16 04:33:55,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2023-02-16 04:33:55,092 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2023-02-16 04:33:55,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 30 transitions. [2023-02-16 04:33:55,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:33:55,093 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 30 transitions. [2023-02-16 04:33:55,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 30 transitions. [2023-02-16 04:33:55,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2023-02-16 04:33:55,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:33:55,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2023-02-16 04:33:55,136 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 28 transitions. [2023-02-16 04:33:55,136 INFO L428 stractBuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2023-02-16 04:33:55,136 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-02-16 04:33:55,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. [2023-02-16 04:33:55,137 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2023-02-16 04:33:55,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-16 04:33:55,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-16 04:33:55,138 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-02-16 04:33:55,138 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-16 04:33:55,138 INFO L748 eck$LassoCheckResult]: Stem: 100#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 101#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 105#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 97#L12 [2023-02-16 04:33:55,138 INFO L750 eck$LassoCheckResult]: Loop: 97#L12 assume !(main_~i~0#1 >= 10); 106#L12-2 assume !(main_~i~0#1 <= 0); 107#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 96#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 97#L12 [2023-02-16 04:33:55,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:55,139 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2023-02-16 04:33:55,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:55,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239341858] [2023-02-16 04:33:55,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:55,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:55,147 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:33:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:55,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:33:55,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:55,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1422136, now seen corresponding path program 1 times [2023-02-16 04:33:55,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:55,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107092112] [2023-02-16 04:33:55,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:55,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:55,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:55,166 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:33:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:55,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:33:55,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:55,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1810725983, now seen corresponding path program 1 times [2023-02-16 04:33:55,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:55,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813252757] [2023-02-16 04:33:55,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:55,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:55,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:55,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:33:55,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813252757] [2023-02-16 04:33:55,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813252757] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:33:55,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:33:55,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 04:33:55,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177403239] [2023-02-16 04:33:55,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:33:55,263 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:33:55,263 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:33:55,263 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:33:55,263 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:33:55,263 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-16 04:33:55,264 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:55,264 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:33:55,264 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:33:55,264 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration2_Loop [2023-02-16 04:33:55,264 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:33:55,264 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:33:55,266 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:55,270 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:55,277 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:55,281 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:55,323 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:33:55,323 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-16 04:33:55,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:55,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:55,325 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:55,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-02-16 04:33:55,333 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:33:55,333 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:55,346 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-16 04:33:55,346 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-16 04:33:55,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:55,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:55,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:55,352 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:55,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-02-16 04:33:55,359 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:33:55,359 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:55,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:55,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:55,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:55,371 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:55,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-02-16 04:33:55,384 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-16 04:33:55,384 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:55,425 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-16 04:33:55,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:55,433 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:33:55,433 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:33:55,433 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:33:55,433 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:33:55,433 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-16 04:33:55,433 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:55,433 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:33:55,433 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:33:55,433 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration2_Loop [2023-02-16 04:33:55,434 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:33:55,434 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:33:55,435 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:55,439 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:55,447 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:55,451 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:55,493 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:33:55,494 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-16 04:33:55,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:55,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:55,497 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:55,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-02-16 04:33:55,537 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 [2023-02-16 04:33:55,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:33:55,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:33:55,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-16 04:33:55,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:33:55,550 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-16 04:33:55,551 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-16 04:33:55,569 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-16 04:33:55,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:55,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:55,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:55,578 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:55,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-02-16 04:33:55,582 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 [2023-02-16 04:33:55,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:33:55,590 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-16 04:33:55,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:33:55,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-16 04:33:55,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:33:55,591 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-16 04:33:55,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-16 04:33:55,609 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-16 04:33:55,614 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-16 04:33:55,614 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-16 04:33:55,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:55,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:55,617 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:55,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-02-16 04:33:55,619 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-16 04:33:55,619 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-16 04:33:55,619 INFO L513 LassoAnalysis]: Proved termination. [2023-02-16 04:33:55,619 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 19 Supporting invariants [] [2023-02-16 04:33:55,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:55,634 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-16 04:33:55,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:55,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:33:55,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:55,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 04:33:55,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:55,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:55,707 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-02-16 04:33:55,707 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:33:55,736 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 13. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 44 states and 73 transitions. Complement of second has 7 states. [2023-02-16 04:33:55,736 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 [2023-02-16 04:33:55,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:33:55,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2023-02-16 04:33:55,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 3 letters. Loop has 4 letters. [2023-02-16 04:33:55,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:55,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 4 letters. [2023-02-16 04:33:55,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:55,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 3 letters. Loop has 8 letters. [2023-02-16 04:33:55,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:55,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 73 transitions. [2023-02-16 04:33:55,741 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2023-02-16 04:33:55,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 36 states and 59 transitions. [2023-02-16 04:33:55,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2023-02-16 04:33:55,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2023-02-16 04:33:55,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 59 transitions. [2023-02-16 04:33:55,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:33:55,742 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 59 transitions. [2023-02-16 04:33:55,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 59 transitions. [2023-02-16 04:33:55,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2023-02-16 04:33:55,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 27 states have internal predecessors, (46), 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) [2023-02-16 04:33:55,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 46 transitions. [2023-02-16 04:33:55,746 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 46 transitions. [2023-02-16 04:33:55,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:33:55,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 04:33:55,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 04:33:55,749 INFO L87 Difference]: Start difference. First operand 28 states and 46 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:33:55,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:33:55,760 INFO L93 Difference]: Finished difference Result 37 states and 56 transitions. [2023-02-16 04:33:55,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 56 transitions. [2023-02-16 04:33:55,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-16 04:33:55,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 32 states and 49 transitions. [2023-02-16 04:33:55,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2023-02-16 04:33:55,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2023-02-16 04:33:55,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 49 transitions. [2023-02-16 04:33:55,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:33:55,763 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2023-02-16 04:33:55,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 49 transitions. [2023-02-16 04:33:55,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2023-02-16 04:33:55,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 25 states have internal predecessors, (40), 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) [2023-02-16 04:33:55,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2023-02-16 04:33:55,766 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 40 transitions. [2023-02-16 04:33:55,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 04:33:55,767 INFO L428 stractBuchiCegarLoop]: Abstraction has 26 states and 40 transitions. [2023-02-16 04:33:55,767 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-02-16 04:33:55,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 40 transitions. [2023-02-16 04:33:55,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-16 04:33:55,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-16 04:33:55,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-16 04:33:55,768 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-16 04:33:55,768 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-16 04:33:55,769 INFO L748 eck$LassoCheckResult]: Stem: 272#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 273#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 276#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 277#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 264#L12-2 assume !(main_~i~0#1 <= 0); 265#L15-1 [2023-02-16 04:33:55,769 INFO L750 eck$LassoCheckResult]: Loop: 265#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 274#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 283#L12 assume !(main_~i~0#1 >= 10); 281#L12-2 assume !(main_~i~0#1 <= 0); 265#L15-1 [2023-02-16 04:33:55,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:55,769 INFO L85 PathProgramCache]: Analyzing trace with hash 28699760, now seen corresponding path program 1 times [2023-02-16 04:33:55,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:55,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827911825] [2023-02-16 04:33:55,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:55,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:55,774 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:33:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:55,777 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:33:55,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:55,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1768758, now seen corresponding path program 1 times [2023-02-16 04:33:55,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:55,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529301400] [2023-02-16 04:33:55,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:55,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:55,787 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:33:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:55,794 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:33:55,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:55,795 INFO L85 PathProgramCache]: Analyzing trace with hash 588716581, now seen corresponding path program 1 times [2023-02-16 04:33:55,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:55,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220413292] [2023-02-16 04:33:55,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:55,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:55,807 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:33:55,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:55,817 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:33:55,850 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:33:55,851 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:33:55,851 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:33:55,851 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:33:55,851 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-16 04:33:55,851 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:55,852 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:33:55,852 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:33:55,852 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration3_Loop [2023-02-16 04:33:55,852 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:33:55,852 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:33:55,861 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:55,872 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:55,876 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:55,882 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:55,915 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:33:55,915 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-16 04:33:55,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:55,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:55,917 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:55,928 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:33:55,928 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:55,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-02-16 04:33:55,994 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-16 04:33:55,995 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-16 04:33:56,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:56,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:56,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:56,004 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:56,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-02-16 04:33:56,008 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:33:56,008 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:56,022 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-16 04:33:56,022 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=0} Honda state: {ULTIMATE.start_main_~up~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-16 04:33:56,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:56,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:56,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:56,027 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:56,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-02-16 04:33:56,030 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:33:56,031 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:56,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:56,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:56,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:56,055 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:56,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-02-16 04:33:56,062 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-16 04:33:56,062 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:56,132 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-16 04:33:56,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:56,136 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:33:56,136 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:33:56,136 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:33:56,136 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:33:56,136 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-16 04:33:56,136 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:56,136 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:33:56,136 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:33:56,136 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration3_Loop [2023-02-16 04:33:56,136 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:33:56,136 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:33:56,137 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:56,148 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:56,156 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:56,159 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:56,202 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:33:56,202 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-16 04:33:56,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:56,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:56,205 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:56,214 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 [2023-02-16 04:33:56,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:33:56,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-16 04:33:56,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:33:56,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-16 04:33:56,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:33:56,223 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-16 04:33:56,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-16 04:33:56,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-02-16 04:33:56,233 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-16 04:33:56,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:56,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:56,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:56,242 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:56,252 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 [2023-02-16 04:33:56,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-02-16 04:33:56,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:33:56,259 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-16 04:33:56,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:33:56,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-16 04:33:56,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:33:56,261 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-16 04:33:56,261 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-16 04:33:56,266 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-16 04:33:56,268 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-16 04:33:56,268 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-16 04:33:56,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:56,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:56,270 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:56,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-02-16 04:33:56,273 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-16 04:33:56,273 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-16 04:33:56,273 INFO L513 LassoAnalysis]: Proved termination. [2023-02-16 04:33:56,273 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2023-02-16 04:33:56,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:56,278 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-16 04:33:56,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:56,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:33:56,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:56,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 04:33:56,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:56,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:56,325 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 [2023-02-16 04:33:56,326 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 40 transitions. cyclomatic complexity: 17 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:33:56,363 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 40 transitions. cyclomatic complexity: 17. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 58 states and 90 transitions. Complement of second has 7 states. [2023-02-16 04:33:56,363 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 [2023-02-16 04:33:56,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:33:56,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2023-02-16 04:33:56,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 4 letters. [2023-02-16 04:33:56,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:56,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2023-02-16 04:33:56,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:56,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 8 letters. [2023-02-16 04:33:56,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:56,369 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 90 transitions. [2023-02-16 04:33:56,374 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2023-02-16 04:33:56,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 55 states and 85 transitions. [2023-02-16 04:33:56,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2023-02-16 04:33:56,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2023-02-16 04:33:56,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 85 transitions. [2023-02-16 04:33:56,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:33:56,376 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 85 transitions. [2023-02-16 04:33:56,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 85 transitions. [2023-02-16 04:33:56,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2023-02-16 04:33:56,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 48 states have internal predecessors, (79), 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) [2023-02-16 04:33:56,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 79 transitions. [2023-02-16 04:33:56,380 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 79 transitions. [2023-02-16 04:33:56,380 INFO L428 stractBuchiCegarLoop]: Abstraction has 49 states and 79 transitions. [2023-02-16 04:33:56,380 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-02-16 04:33:56,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 79 transitions. [2023-02-16 04:33:56,381 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2023-02-16 04:33:56,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-16 04:33:56,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-16 04:33:56,382 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-02-16 04:33:56,382 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-16 04:33:56,382 INFO L748 eck$LassoCheckResult]: Stem: 406#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 407#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 412#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 425#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 418#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 419#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 433#L18-1 [2023-02-16 04:33:56,382 INFO L750 eck$LassoCheckResult]: Loop: 433#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 420#L12 assume !(main_~i~0#1 >= 10); 421#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 432#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 433#L18-1 [2023-02-16 04:33:56,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:56,383 INFO L85 PathProgramCache]: Analyzing trace with hash 889692526, now seen corresponding path program 1 times [2023-02-16 04:33:56,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:56,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310544308] [2023-02-16 04:33:56,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:56,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:56,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:56,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:33:56,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310544308] [2023-02-16 04:33:56,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310544308] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:33:56,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:33:56,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 04:33:56,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943899488] [2023-02-16 04:33:56,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:33:56,424 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-16 04:33:56,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:56,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1267246, now seen corresponding path program 1 times [2023-02-16 04:33:56,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:56,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888377418] [2023-02-16 04:33:56,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:56,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:56,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:56,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:33:56,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888377418] [2023-02-16 04:33:56,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888377418] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:33:56,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:33:56,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 04:33:56,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867076783] [2023-02-16 04:33:56,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:33:56,453 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-16 04:33:56,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:33:56,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 04:33:56,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 04:33:56,454 INFO L87 Difference]: Start difference. First operand 49 states and 79 transitions. cyclomatic complexity: 36 Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:33:56,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:33:56,469 INFO L93 Difference]: Finished difference Result 47 states and 69 transitions. [2023-02-16 04:33:56,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 69 transitions. [2023-02-16 04:33:56,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-16 04:33:56,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 41 states and 60 transitions. [2023-02-16 04:33:56,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2023-02-16 04:33:56,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2023-02-16 04:33:56,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 60 transitions. [2023-02-16 04:33:56,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:33:56,475 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 60 transitions. [2023-02-16 04:33:56,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 60 transitions. [2023-02-16 04:33:56,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2023-02-16 04:33:56,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.475) internal successors, (59), 39 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:33:56,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2023-02-16 04:33:56,478 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 59 transitions. [2023-02-16 04:33:56,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 04:33:56,484 INFO L428 stractBuchiCegarLoop]: Abstraction has 40 states and 59 transitions. [2023-02-16 04:33:56,484 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-02-16 04:33:56,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 59 transitions. [2023-02-16 04:33:56,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-16 04:33:56,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-16 04:33:56,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-16 04:33:56,486 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2023-02-16 04:33:56,486 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-16 04:33:56,486 INFO L748 eck$LassoCheckResult]: Stem: 509#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 510#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 514#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 521#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 519#L12-2 assume !(main_~i~0#1 <= 0); 511#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 512#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 531#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 501#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 502#L15-1 [2023-02-16 04:33:56,486 INFO L750 eck$LassoCheckResult]: Loop: 502#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 517#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 530#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 528#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 502#L15-1 [2023-02-16 04:33:56,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:56,487 INFO L85 PathProgramCache]: Analyzing trace with hash 588716517, now seen corresponding path program 1 times [2023-02-16 04:33:56,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:56,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035920212] [2023-02-16 04:33:56,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:56,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:56,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:56,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:33:56,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035920212] [2023-02-16 04:33:56,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035920212] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:33:56,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:33:56,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 04:33:56,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323508311] [2023-02-16 04:33:56,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:33:56,534 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-16 04:33:56,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:56,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1709112, now seen corresponding path program 1 times [2023-02-16 04:33:56,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:56,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970052852] [2023-02-16 04:33:56,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:56,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:56,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:56,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:33:56,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970052852] [2023-02-16 04:33:56,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970052852] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:33:56,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:33:56,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 04:33:56,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23951607] [2023-02-16 04:33:56,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:33:56,588 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-16 04:33:56,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:33:56,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 04:33:56,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 04:33:56,589 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. cyclomatic complexity: 24 Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:33:56,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:56,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:56,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:33:56,611 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2023-02-16 04:33:56,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 64 transitions. [2023-02-16 04:33:56,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:56,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2023-02-16 04:33:56,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 45 states and 60 transitions. [2023-02-16 04:33:56,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2023-02-16 04:33:56,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2023-02-16 04:33:56,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 60 transitions. [2023-02-16 04:33:56,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:33:56,617 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 60 transitions. [2023-02-16 04:33:56,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 60 transitions. [2023-02-16 04:33:56,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2023-02-16 04:33:56,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 38 states have internal predecessors, (54), 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) [2023-02-16 04:33:56,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2023-02-16 04:33:56,620 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 54 transitions. [2023-02-16 04:33:56,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 04:33:56,625 INFO L428 stractBuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2023-02-16 04:33:56,625 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-02-16 04:33:56,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 54 transitions. [2023-02-16 04:33:56,626 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2023-02-16 04:33:56,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-16 04:33:56,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-16 04:33:56,627 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:33:56,627 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-16 04:33:56,627 INFO L748 eck$LassoCheckResult]: Stem: 606#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 607#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 601#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 602#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 597#L12-2 assume !(main_~i~0#1 <= 0); 598#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 608#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 623#L12 assume !(main_~i~0#1 >= 10); 618#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 614#L15-1 [2023-02-16 04:33:56,627 INFO L750 eck$LassoCheckResult]: Loop: 614#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 615#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 620#L12 assume !(main_~i~0#1 >= 10); 619#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 614#L15-1 [2023-02-16 04:33:56,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:56,627 INFO L85 PathProgramCache]: Analyzing trace with hash 588716579, now seen corresponding path program 1 times [2023-02-16 04:33:56,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:56,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916695422] [2023-02-16 04:33:56,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:56,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:56,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:56,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:33:56,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916695422] [2023-02-16 04:33:56,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916695422] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:33:56,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431775802] [2023-02-16 04:33:56,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:56,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:33:56,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:56,681 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:33:56,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-02-16 04:33:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:56,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 04:33:56,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:56,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:56,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:33:56,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:56,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431775802] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:33:56,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:33:56,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-02-16 04:33:56,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875817317] [2023-02-16 04:33:56,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:33:56,742 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-16 04:33:56,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:56,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1709174, now seen corresponding path program 2 times [2023-02-16 04:33:56,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:56,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799982079] [2023-02-16 04:33:56,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:56,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:56,754 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:33:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:56,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:33:56,794 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:33:56,794 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:33:56,794 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:33:56,794 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:33:56,794 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-16 04:33:56,794 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:56,795 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:33:56,795 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:33:56,795 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration6_Loop [2023-02-16 04:33:56,795 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:33:56,795 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:33:56,799 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:56,801 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:56,806 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:56,811 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:56,860 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:33:56,860 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-16 04:33:56,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:56,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:56,862 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:56,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-02-16 04:33:56,866 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:33:56,866 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:56,887 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-16 04:33:56,887 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-16 04:33:56,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:56,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:56,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:56,897 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:56,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-02-16 04:33:56,901 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:33:56,901 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:56,908 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-16 04:33:56,909 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=1} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-16 04:33:56,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:56,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:56,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:56,919 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:56,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-02-16 04:33:56,923 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:33:56,923 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:56,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:56,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:56,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:56,946 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:56,953 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-16 04:33:56,953 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:56,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-02-16 04:33:57,015 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-16 04:33:57,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2023-02-16 04:33:57,018 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:33:57,018 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:33:57,018 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:33:57,018 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:33:57,018 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-16 04:33:57,018 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:57,018 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:33:57,019 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:33:57,019 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration6_Loop [2023-02-16 04:33:57,019 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:33:57,019 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:33:57,020 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:57,026 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:57,035 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:57,039 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:57,085 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:33:57,085 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-16 04:33:57,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:57,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:57,087 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:57,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-02-16 04:33:57,090 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 [2023-02-16 04:33:57,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:33:57,096 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-16 04:33:57,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:33:57,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-16 04:33:57,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:33:57,097 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-16 04:33:57,097 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-16 04:33:57,099 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-16 04:33:57,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2023-02-16 04:33:57,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:57,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:57,102 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:57,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-02-16 04:33:57,106 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 [2023-02-16 04:33:57,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:33:57,112 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-16 04:33:57,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:33:57,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-16 04:33:57,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:33:57,113 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-16 04:33:57,113 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-16 04:33:57,137 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-16 04:33:57,140 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-16 04:33:57,140 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-16 04:33:57,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:57,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:57,145 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:57,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-02-16 04:33:57,149 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-16 04:33:57,149 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-16 04:33:57,149 INFO L513 LassoAnalysis]: Proved termination. [2023-02-16 04:33:57,150 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2023-02-16 04:33:57,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:57,157 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-16 04:33:57,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:57,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:33:57,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:57,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 04:33:57,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:57,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:57,216 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 [2023-02-16 04:33:57,216 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 54 transitions. cyclomatic complexity: 20 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) [2023-02-16 04:33:57,243 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 54 transitions. cyclomatic complexity: 20. 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 101 states and 136 transitions. Complement of second has 7 states. [2023-02-16 04:33:57,245 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 [2023-02-16 04:33:57,245 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) [2023-02-16 04:33:57,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2023-02-16 04:33:57,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 9 letters. Loop has 4 letters. [2023-02-16 04:33:57,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:57,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 13 letters. Loop has 4 letters. [2023-02-16 04:33:57,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:57,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 9 letters. Loop has 8 letters. [2023-02-16 04:33:57,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:57,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 136 transitions. [2023-02-16 04:33:57,248 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2023-02-16 04:33:57,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 91 states and 122 transitions. [2023-02-16 04:33:57,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2023-02-16 04:33:57,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2023-02-16 04:33:57,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 122 transitions. [2023-02-16 04:33:57,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:33:57,252 INFO L218 hiAutomatonCegarLoop]: Abstraction has 91 states and 122 transitions. [2023-02-16 04:33:57,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 122 transitions. [2023-02-16 04:33:57,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 78. [2023-02-16 04:33:57,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 77 states have internal predecessors, (109), 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) [2023-02-16 04:33:57,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 109 transitions. [2023-02-16 04:33:57,257 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78 states and 109 transitions. [2023-02-16 04:33:57,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:33:57,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 04:33:57,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-02-16 04:33:57,258 INFO L87 Difference]: Start difference. First operand 78 states and 109 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:33:57,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:33:57,304 INFO L93 Difference]: Finished difference Result 139 states and 174 transitions. [2023-02-16 04:33:57,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 174 transitions. [2023-02-16 04:33:57,307 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2023-02-16 04:33:57,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 108 states and 137 transitions. [2023-02-16 04:33:57,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2023-02-16 04:33:57,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2023-02-16 04:33:57,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 137 transitions. [2023-02-16 04:33:57,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:33:57,309 INFO L218 hiAutomatonCegarLoop]: Abstraction has 108 states and 137 transitions. [2023-02-16 04:33:57,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 137 transitions. [2023-02-16 04:33:57,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 86. [2023-02-16 04:33:57,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 85 states have internal predecessors, (111), 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) [2023-02-16 04:33:57,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 111 transitions. [2023-02-16 04:33:57,317 INFO L240 hiAutomatonCegarLoop]: Abstraction has 86 states and 111 transitions. [2023-02-16 04:33:57,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 04:33:57,318 INFO L428 stractBuchiCegarLoop]: Abstraction has 86 states and 111 transitions. [2023-02-16 04:33:57,318 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-02-16 04:33:57,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 111 transitions. [2023-02-16 04:33:57,319 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2023-02-16 04:33:57,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-16 04:33:57,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-16 04:33:57,320 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2023-02-16 04:33:57,320 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-16 04:33:57,320 INFO L748 eck$LassoCheckResult]: Stem: 1075#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1076#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 1079#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1088#L12 assume !(main_~i~0#1 >= 10); 1098#L12-2 assume !(main_~i~0#1 <= 0); 1097#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 1095#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1092#L12 assume !(main_~i~0#1 >= 10); 1091#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 1090#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 1070#L18-1 [2023-02-16 04:33:57,320 INFO L750 eck$LassoCheckResult]: Loop: 1070#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1071#L12 assume !(main_~i~0#1 >= 10); 1120#L12-2 assume !(main_~i~0#1 <= 0); 1081#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 1070#L18-1 [2023-02-16 04:33:57,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:57,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1449615143, now seen corresponding path program 1 times [2023-02-16 04:33:57,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:57,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94586015] [2023-02-16 04:33:57,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:57,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:57,326 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:33:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:57,328 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:33:57,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:57,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1267306, now seen corresponding path program 2 times [2023-02-16 04:33:57,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:57,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339927450] [2023-02-16 04:33:57,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:57,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:57,332 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:33:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:57,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:33:57,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:57,335 INFO L85 PathProgramCache]: Analyzing trace with hash -130036926, now seen corresponding path program 2 times [2023-02-16 04:33:57,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:57,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883081438] [2023-02-16 04:33:57,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:57,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:57,339 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:33:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:57,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:33:57,364 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:33:57,364 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:33:57,364 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:33:57,365 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:33:57,365 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-16 04:33:57,365 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:57,365 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:33:57,365 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:33:57,365 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration7_Loop [2023-02-16 04:33:57,365 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:33:57,365 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:33:57,366 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:57,371 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:57,373 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:57,376 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:57,403 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:33:57,404 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-16 04:33:57,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:57,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:57,406 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:57,413 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:33:57,414 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:57,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-02-16 04:33:57,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:57,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:57,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:57,426 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:57,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-02-16 04:33:57,429 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-16 04:33:57,429 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:57,457 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-16 04:33:57,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:57,461 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:33:57,461 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:33:57,461 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:33:57,461 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:33:57,461 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-16 04:33:57,461 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:57,461 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:33:57,461 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:33:57,461 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration7_Loop [2023-02-16 04:33:57,461 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:33:57,461 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:33:57,462 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:57,468 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:57,471 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:57,473 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:57,504 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:33:57,504 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-16 04:33:57,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:57,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:57,506 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:57,517 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 [2023-02-16 04:33:57,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:33:57,524 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-16 04:33:57,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:33:57,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-16 04:33:57,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:33:57,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-02-16 04:33:57,526 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-16 04:33:57,526 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-16 04:33:57,538 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-16 04:33:57,553 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-16 04:33:57,554 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-16 04:33:57,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:57,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:57,555 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:57,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2023-02-16 04:33:57,559 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-16 04:33:57,559 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-16 04:33:57,559 INFO L513 LassoAnalysis]: Proved termination. [2023-02-16 04:33:57,559 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 19 Supporting invariants [] [2023-02-16 04:33:57,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:57,567 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-16 04:33:57,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:57,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:33:57,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:57,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 04:33:57,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:57,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:57,629 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 [2023-02-16 04:33:57,629 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 111 transitions. cyclomatic complexity: 31 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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) [2023-02-16 04:33:57,654 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 111 transitions. cyclomatic complexity: 31. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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 115 states and 145 transitions. Complement of second has 7 states. [2023-02-16 04:33:57,654 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 [2023-02-16 04:33:57,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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) [2023-02-16 04:33:57,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2023-02-16 04:33:57,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 4 letters. [2023-02-16 04:33:57,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:57,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2023-02-16 04:33:57,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:57,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 8 letters. [2023-02-16 04:33:57,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:57,660 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 145 transitions. [2023-02-16 04:33:57,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2023-02-16 04:33:57,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 97 states and 125 transitions. [2023-02-16 04:33:57,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2023-02-16 04:33:57,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2023-02-16 04:33:57,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 125 transitions. [2023-02-16 04:33:57,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:33:57,664 INFO L218 hiAutomatonCegarLoop]: Abstraction has 97 states and 125 transitions. [2023-02-16 04:33:57,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 125 transitions. [2023-02-16 04:33:57,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 86. [2023-02-16 04:33:57,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.302325581395349) internal successors, (112), 85 states have internal predecessors, (112), 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) [2023-02-16 04:33:57,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 112 transitions. [2023-02-16 04:33:57,685 INFO L240 hiAutomatonCegarLoop]: Abstraction has 86 states and 112 transitions. [2023-02-16 04:33:57,685 INFO L428 stractBuchiCegarLoop]: Abstraction has 86 states and 112 transitions. [2023-02-16 04:33:57,685 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-02-16 04:33:57,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 112 transitions. [2023-02-16 04:33:57,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2023-02-16 04:33:57,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-16 04:33:57,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-16 04:33:57,687 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:33:57,687 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-16 04:33:57,687 INFO L748 eck$LassoCheckResult]: Stem: 1341#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1342#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 1347#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1370#L12 assume !(main_~i~0#1 >= 10); 1368#L12-2 assume !(main_~i~0#1 <= 0); 1367#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 1365#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1362#L12 assume !(main_~i~0#1 >= 10); 1361#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 1348#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 1336#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1338#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 1332#L12-2 [2023-02-16 04:33:57,687 INFO L750 eck$LassoCheckResult]: Loop: 1332#L12-2 assume !(main_~i~0#1 <= 0); 1333#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 1351#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1416#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 1332#L12-2 [2023-02-16 04:33:57,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:57,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1510748164, now seen corresponding path program 1 times [2023-02-16 04:33:57,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:57,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525927998] [2023-02-16 04:33:57,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:57,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:57,728 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 04:33:57,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:33:57,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525927998] [2023-02-16 04:33:57,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525927998] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:33:57,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:33:57,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 04:33:57,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218573313] [2023-02-16 04:33:57,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:33:57,730 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-16 04:33:57,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:57,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1606186, now seen corresponding path program 1 times [2023-02-16 04:33:57,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:57,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448962163] [2023-02-16 04:33:57,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:57,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:57,734 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:33:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:57,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:33:57,765 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:33:57,766 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:33:57,766 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:33:57,766 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:33:57,766 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-16 04:33:57,766 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:57,766 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:33:57,766 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:33:57,766 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration8_Loop [2023-02-16 04:33:57,767 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:33:57,767 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:33:57,767 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:57,773 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:57,776 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:57,779 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:57,823 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:33:57,823 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-16 04:33:57,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:57,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:57,825 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:57,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2023-02-16 04:33:57,834 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:33:57,834 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:57,851 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-16 04:33:57,851 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=0} Honda state: {ULTIMATE.start_main_~up~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-16 04:33:57,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:57,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:57,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:57,859 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:57,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2023-02-16 04:33:57,863 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:33:57,863 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:57,885 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-16 04:33:57,885 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-16 04:33:57,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:57,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:57,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:57,891 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:57,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2023-02-16 04:33:57,899 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:33:57,899 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:57,909 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-16 04:33:57,909 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-16 04:33:57,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:57,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:57,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:57,913 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:57,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2023-02-16 04:33:57,917 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:33:57,917 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:57,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:57,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:57,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:57,929 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:57,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2023-02-16 04:33:57,938 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-16 04:33:57,938 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:58,039 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-16 04:33:58,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:58,048 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:33:58,048 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:33:58,048 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:33:58,048 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:33:58,048 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-16 04:33:58,048 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:58,048 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:33:58,048 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:33:58,048 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration8_Loop [2023-02-16 04:33:58,048 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:33:58,048 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:33:58,049 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:58,054 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:58,058 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:58,063 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:58,101 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:33:58,101 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-16 04:33:58,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:58,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:58,103 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:58,110 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 [2023-02-16 04:33:58,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:33:58,117 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-16 04:33:58,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:33:58,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-16 04:33:58,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:33:58,118 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-16 04:33:58,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-16 04:33:58,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2023-02-16 04:33:58,133 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-16 04:33:58,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:58,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:58,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:58,138 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:58,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2023-02-16 04:33:58,141 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 [2023-02-16 04:33:58,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:33:58,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:33:58,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-16 04:33:58,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:33:58,148 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-16 04:33:58,148 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-16 04:33:58,158 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-16 04:33:58,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:58,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:58,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:58,170 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:58,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2023-02-16 04:33:58,174 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 [2023-02-16 04:33:58,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:33:58,181 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-16 04:33:58,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:33:58,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-16 04:33:58,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:33:58,182 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-16 04:33:58,182 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-16 04:33:58,193 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-16 04:33:58,195 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-02-16 04:33:58,195 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-16 04:33:58,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:58,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:58,196 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:58,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2023-02-16 04:33:58,199 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-16 04:33:58,199 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-16 04:33:58,199 INFO L513 LassoAnalysis]: Proved termination. [2023-02-16 04:33:58,199 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2023-02-16 04:33:58,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:58,204 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-16 04:33:58,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:58,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:33:58,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:58,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 04:33:58,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:58,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:58,259 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 [2023-02-16 04:33:58,260 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 112 transitions. cyclomatic complexity: 32 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:33:58,283 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 112 transitions. cyclomatic complexity: 32. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 188 states and 256 transitions. Complement of second has 7 states. [2023-02-16 04:33:58,284 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 [2023-02-16 04:33:58,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:33:58,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2023-02-16 04:33:58,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 12 letters. Loop has 4 letters. [2023-02-16 04:33:58,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:58,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 16 letters. Loop has 4 letters. [2023-02-16 04:33:58,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:58,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 12 letters. Loop has 8 letters. [2023-02-16 04:33:58,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:58,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 188 states and 256 transitions. [2023-02-16 04:33:58,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2023-02-16 04:33:58,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 188 states to 140 states and 182 transitions. [2023-02-16 04:33:58,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2023-02-16 04:33:58,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2023-02-16 04:33:58,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 182 transitions. [2023-02-16 04:33:58,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:33:58,289 INFO L218 hiAutomatonCegarLoop]: Abstraction has 140 states and 182 transitions. [2023-02-16 04:33:58,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 182 transitions. [2023-02-16 04:33:58,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 94. [2023-02-16 04:33:58,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 93 states have internal predecessors, (124), 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) [2023-02-16 04:33:58,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 124 transitions. [2023-02-16 04:33:58,293 INFO L240 hiAutomatonCegarLoop]: Abstraction has 94 states and 124 transitions. [2023-02-16 04:33:58,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:33:58,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:33:58,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:33:58,294 INFO L87 Difference]: Start difference. First operand 94 states and 124 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:33:58,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:33:58,309 INFO L93 Difference]: Finished difference Result 105 states and 132 transitions. [2023-02-16 04:33:58,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 132 transitions. [2023-02-16 04:33:58,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2023-02-16 04:33:58,311 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 103 states and 130 transitions. [2023-02-16 04:33:58,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2023-02-16 04:33:58,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2023-02-16 04:33:58,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 130 transitions. [2023-02-16 04:33:58,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:33:58,312 INFO L218 hiAutomatonCegarLoop]: Abstraction has 103 states and 130 transitions. [2023-02-16 04:33:58,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 130 transitions. [2023-02-16 04:33:58,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 94. [2023-02-16 04:33:58,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.2872340425531914) internal successors, (121), 93 states have internal predecessors, (121), 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) [2023-02-16 04:33:58,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 121 transitions. [2023-02-16 04:33:58,315 INFO L240 hiAutomatonCegarLoop]: Abstraction has 94 states and 121 transitions. [2023-02-16 04:33:58,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:33:58,321 INFO L428 stractBuchiCegarLoop]: Abstraction has 94 states and 121 transitions. [2023-02-16 04:33:58,321 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-02-16 04:33:58,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 121 transitions. [2023-02-16 04:33:58,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2023-02-16 04:33:58,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-16 04:33:58,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-16 04:33:58,323 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 5, 4, 2, 2, 1, 1, 1] [2023-02-16 04:33:58,323 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-16 04:33:58,323 INFO L748 eck$LassoCheckResult]: Stem: 1885#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1886#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 1890#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1899#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 1900#L12-2 assume !(main_~i~0#1 <= 0); 1921#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 1920#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1919#L12 assume !(main_~i~0#1 >= 10); 1918#L12-2 assume !(main_~i~0#1 <= 0); 1917#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 1916#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1915#L12 assume !(main_~i~0#1 >= 10); 1914#L12-2 assume !(main_~i~0#1 <= 0); 1913#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 1912#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1911#L12 assume !(main_~i~0#1 >= 10); 1907#L12-2 assume !(main_~i~0#1 <= 0); 1910#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 1909#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1906#L12 assume !(main_~i~0#1 >= 10); 1905#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 1904#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 1892#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1883#L12 assume !(main_~i~0#1 >= 10); 1962#L12-2 assume !(main_~i~0#1 <= 0); 1889#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 1882#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1884#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 1876#L12-2 [2023-02-16 04:33:58,323 INFO L750 eck$LassoCheckResult]: Loop: 1876#L12-2 assume !(main_~i~0#1 <= 0); 1877#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 1896#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1956#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 1876#L12-2 [2023-02-16 04:33:58,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:58,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1054469156, now seen corresponding path program 2 times [2023-02-16 04:33:58,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:58,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33666426] [2023-02-16 04:33:58,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:58,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:58,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:58,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:58,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:58,418 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 04:33:58,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:33:58,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33666426] [2023-02-16 04:33:58,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33666426] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:33:58,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615104523] [2023-02-16 04:33:58,419 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 04:33:58,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:33:58,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:58,421 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:33:58,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2023-02-16 04:33:58,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 04:33:58,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 04:33:58,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 04:33:58,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:58,476 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 04:33:58,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:33:58,531 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 04:33:58,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615104523] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:33:58,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:33:58,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2023-02-16 04:33:58,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913412069] [2023-02-16 04:33:58,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:33:58,532 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-16 04:33:58,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:58,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1606186, now seen corresponding path program 2 times [2023-02-16 04:33:58,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:58,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706869358] [2023-02-16 04:33:58,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:58,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:58,536 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:33:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:58,538 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:33:58,563 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:33:58,564 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:33:58,564 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:33:58,564 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:33:58,564 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-16 04:33:58,564 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:58,564 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:33:58,564 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:33:58,564 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration9_Loop [2023-02-16 04:33:58,564 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:33:58,564 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:33:58,565 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:58,569 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:58,571 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:58,574 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:58,622 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:33:58,622 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-16 04:33:58,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:58,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:58,625 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:58,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2023-02-16 04:33:58,630 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:33:58,630 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:58,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:58,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:58,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:58,658 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:58,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2023-02-16 04:33:58,662 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-16 04:33:58,662 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:33:58,739 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-16 04:33:58,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:58,742 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:33:58,743 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:33:58,743 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:33:58,743 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:33:58,743 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-16 04:33:58,743 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:58,743 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:33:58,743 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:33:58,743 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration9_Loop [2023-02-16 04:33:58,743 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:33:58,743 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:33:58,744 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:58,749 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:58,753 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:58,764 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:33:58,795 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:33:58,796 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-16 04:33:58,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:58,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:58,797 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:58,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2023-02-16 04:33:58,801 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 [2023-02-16 04:33:58,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:33:58,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-16 04:33:58,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:33:58,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-16 04:33:58,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:33:58,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-16 04:33:58,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-16 04:33:58,812 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-16 04:33:58,814 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-02-16 04:33:58,814 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-16 04:33:58,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:33:58,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:58,817 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-16 04:33:58,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2023-02-16 04:33:58,826 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-16 04:33:58,826 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-16 04:33:58,826 INFO L513 LassoAnalysis]: Proved termination. [2023-02-16 04:33:58,827 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2023-02-16 04:33:58,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:58,830 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-16 04:33:58,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:58,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:33:58,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:58,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 04:33:58,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:58,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:58,891 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 [2023-02-16 04:33:58,891 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 121 transitions. cyclomatic complexity: 35 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:33:58,909 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 121 transitions. cyclomatic complexity: 35. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 148 states and 200 transitions. Complement of second has 7 states. [2023-02-16 04:33:58,912 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 [2023-02-16 04:33:58,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:33:58,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2023-02-16 04:33:58,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 28 letters. Loop has 4 letters. [2023-02-16 04:33:58,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:58,914 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-16 04:33:58,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:58,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:33:58,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:58,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 04:33:58,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:58,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:58,980 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-16 04:33:58,980 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 121 transitions. cyclomatic complexity: 35 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:33:59,029 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 121 transitions. cyclomatic complexity: 35. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 173 states and 212 transitions. Complement of second has 7 states. [2023-02-16 04:33:59,031 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 [2023-02-16 04:33:59,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:33:59,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2023-02-16 04:33:59,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 28 letters. Loop has 4 letters. [2023-02-16 04:33:59,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:59,032 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-16 04:33:59,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:59,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:33:59,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:59,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 04:33:59,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:59,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:33:59,106 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-16 04:33:59,106 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 121 transitions. cyclomatic complexity: 35 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:33:59,131 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 121 transitions. cyclomatic complexity: 35. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 163 states and 221 transitions. Complement of second has 8 states. [2023-02-16 04:33:59,133 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 [2023-02-16 04:33:59,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:33:59,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2023-02-16 04:33:59,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 28 letters. Loop has 4 letters. [2023-02-16 04:33:59,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:59,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 32 letters. Loop has 4 letters. [2023-02-16 04:33:59,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:59,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 28 letters. Loop has 8 letters. [2023-02-16 04:33:59,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:33:59,135 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 163 states and 221 transitions. [2023-02-16 04:33:59,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2023-02-16 04:33:59,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 163 states to 115 states and 147 transitions. [2023-02-16 04:33:59,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2023-02-16 04:33:59,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2023-02-16 04:33:59,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 147 transitions. [2023-02-16 04:33:59,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:33:59,138 INFO L218 hiAutomatonCegarLoop]: Abstraction has 115 states and 147 transitions. [2023-02-16 04:33:59,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 147 transitions. [2023-02-16 04:33:59,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 61. [2023-02-16 04:33:59,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.278688524590164) internal successors, (78), 60 states have internal predecessors, (78), 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) [2023-02-16 04:33:59,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2023-02-16 04:33:59,140 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 78 transitions. [2023-02-16 04:33:59,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:33:59,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 04:33:59,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-02-16 04:33:59,140 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 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) [2023-02-16 04:33:59,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:33:59,224 INFO L93 Difference]: Finished difference Result 195 states and 238 transitions. [2023-02-16 04:33:59,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 195 states and 238 transitions. [2023-02-16 04:33:59,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 82 [2023-02-16 04:33:59,227 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 195 states to 182 states and 225 transitions. [2023-02-16 04:33:59,227 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2023-02-16 04:33:59,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2023-02-16 04:33:59,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 182 states and 225 transitions. [2023-02-16 04:33:59,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:33:59,227 INFO L218 hiAutomatonCegarLoop]: Abstraction has 182 states and 225 transitions. [2023-02-16 04:33:59,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states and 225 transitions. [2023-02-16 04:33:59,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 168. [2023-02-16 04:33:59,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 168 states have (on average 1.255952380952381) internal successors, (211), 167 states have internal predecessors, (211), 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) [2023-02-16 04:33:59,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 211 transitions. [2023-02-16 04:33:59,231 INFO L240 hiAutomatonCegarLoop]: Abstraction has 168 states and 211 transitions. [2023-02-16 04:33:59,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 04:33:59,231 INFO L428 stractBuchiCegarLoop]: Abstraction has 168 states and 211 transitions. [2023-02-16 04:33:59,231 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-02-16 04:33:59,231 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 168 states and 211 transitions. [2023-02-16 04:33:59,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2023-02-16 04:33:59,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-16 04:33:59,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-16 04:33:59,233 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1] [2023-02-16 04:33:59,234 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2023-02-16 04:33:59,234 INFO L748 eck$LassoCheckResult]: Stem: 3216#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 3217#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 3220#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3224#L12 assume !(main_~i~0#1 >= 10); 3229#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 3227#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3212#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3213#L12 assume !(main_~i~0#1 >= 10); 3320#L12-2 assume !(main_~i~0#1 <= 0); 3321#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3316#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3274#L12 [2023-02-16 04:33:59,234 INFO L750 eck$LassoCheckResult]: Loop: 3274#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 3273#L12-2 assume !(main_~i~0#1 <= 0); 3211#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3214#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3215#L12 assume !(main_~i~0#1 >= 10); 3223#L12-2 assume !(main_~i~0#1 <= 0); 3315#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3314#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3313#L12 assume !(main_~i~0#1 >= 10); 3312#L12-2 assume !(main_~i~0#1 <= 0); 3311#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3310#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3309#L12 assume !(main_~i~0#1 >= 10); 3308#L12-2 assume !(main_~i~0#1 <= 0); 3307#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3306#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3305#L12 assume !(main_~i~0#1 >= 10); 3304#L12-2 assume !(main_~i~0#1 <= 0); 3303#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3302#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3301#L12 assume !(main_~i~0#1 >= 10); 3300#L12-2 assume !(main_~i~0#1 <= 0); 3299#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3298#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3297#L12 assume !(main_~i~0#1 >= 10); 3296#L12-2 assume !(main_~i~0#1 <= 0); 3295#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3294#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3293#L12 assume !(main_~i~0#1 >= 10); 3292#L12-2 assume !(main_~i~0#1 <= 0); 3291#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3290#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3289#L12 assume !(main_~i~0#1 >= 10); 3288#L12-2 assume !(main_~i~0#1 <= 0); 3287#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3286#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3285#L12 assume !(main_~i~0#1 >= 10); 3282#L12-2 assume !(main_~i~0#1 <= 0); 3284#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3283#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3281#L12 assume !(main_~i~0#1 >= 10); 3278#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 3276#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3277#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3279#L12 assume !(main_~i~0#1 >= 10); 3280#L12-2 assume !(main_~i~0#1 <= 0); 3375#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3374#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3347#L12 assume !(main_~i~0#1 >= 10); 3208#L12-2 assume !(main_~i~0#1 <= 0); 3209#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3226#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3348#L12 assume !(main_~i~0#1 >= 10); 3373#L12-2 assume !(main_~i~0#1 <= 0); 3372#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3371#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3370#L12 assume !(main_~i~0#1 >= 10); 3369#L12-2 assume !(main_~i~0#1 <= 0); 3368#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3367#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3366#L12 assume !(main_~i~0#1 >= 10); 3365#L12-2 assume !(main_~i~0#1 <= 0); 3364#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3363#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3362#L12 assume !(main_~i~0#1 >= 10); 3361#L12-2 assume !(main_~i~0#1 <= 0); 3360#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3359#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3358#L12 assume !(main_~i~0#1 >= 10); 3357#L12-2 assume !(main_~i~0#1 <= 0); 3356#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3355#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3354#L12 assume !(main_~i~0#1 >= 10); 3353#L12-2 assume !(main_~i~0#1 <= 0); 3352#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3351#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3350#L12 assume !(main_~i~0#1 >= 10); 3222#L12-2 assume !(main_~i~0#1 <= 0); 3349#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3275#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3274#L12 [2023-02-16 04:33:59,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:59,234 INFO L85 PathProgramCache]: Analyzing trace with hash 474307092, now seen corresponding path program 1 times [2023-02-16 04:33:59,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:59,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969752119] [2023-02-16 04:33:59,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:59,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:59,238 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:33:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:59,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:33:59,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:59,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1617023097, now seen corresponding path program 1 times [2023-02-16 04:33:59,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:59,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683467142] [2023-02-16 04:33:59,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:59,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:59,253 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:33:59,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:59,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:33:59,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:59,265 INFO L85 PathProgramCache]: Analyzing trace with hash -68907892, now seen corresponding path program 3 times [2023-02-16 04:33:59,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:59,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395355337] [2023-02-16 04:33:59,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:59,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:33:59,337 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 202 proven. 3 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2023-02-16 04:33:59,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:33:59,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395355337] [2023-02-16 04:33:59,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395355337] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:33:59,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027180328] [2023-02-16 04:33:59,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 04:33:59,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:33:59,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:33:59,339 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:33:59,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2023-02-16 04:33:59,385 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-02-16 04:33:59,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 04:33:59,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 04:33:59,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:33:59,408 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 202 proven. 3 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2023-02-16 04:33:59,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:33:59,440 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 202 proven. 3 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2023-02-16 04:33:59,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027180328] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:33:59,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:33:59,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-02-16 04:33:59,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971634840] [2023-02-16 04:33:59,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:33:59,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2023-02-16 04:33:59,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:33:59,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 04:33:59,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2023-02-16 04:33:59,888 INFO L87 Difference]: Start difference. First operand 168 states and 211 transitions. cyclomatic complexity: 46 Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:33:59,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:33:59,934 INFO L93 Difference]: Finished difference Result 179 states and 197 transitions. [2023-02-16 04:33:59,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 179 states and 197 transitions. [2023-02-16 04:33:59,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2023-02-16 04:33:59,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 179 states to 175 states and 193 transitions. [2023-02-16 04:33:59,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2023-02-16 04:33:59,936 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2023-02-16 04:33:59,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 175 states and 193 transitions. [2023-02-16 04:33:59,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:33:59,937 INFO L218 hiAutomatonCegarLoop]: Abstraction has 175 states and 193 transitions. [2023-02-16 04:33:59,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states and 193 transitions. [2023-02-16 04:33:59,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2023-02-16 04:33:59,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 168 states have (on average 1.1011904761904763) internal successors, (185), 167 states have internal predecessors, (185), 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) [2023-02-16 04:33:59,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 185 transitions. [2023-02-16 04:33:59,940 INFO L240 hiAutomatonCegarLoop]: Abstraction has 168 states and 185 transitions. [2023-02-16 04:33:59,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 04:33:59,941 INFO L428 stractBuchiCegarLoop]: Abstraction has 168 states and 185 transitions. [2023-02-16 04:33:59,941 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-02-16 04:33:59,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 168 states and 185 transitions. [2023-02-16 04:33:59,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2023-02-16 04:33:59,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-16 04:33:59,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-16 04:33:59,943 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 5, 1, 1, 1] [2023-02-16 04:33:59,943 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2023-02-16 04:33:59,943 INFO L748 eck$LassoCheckResult]: Stem: 4116#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4117#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 4121#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4133#L12 assume !(main_~i~0#1 >= 10); 4129#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 4126#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4127#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4262#L12 assume !(main_~i~0#1 >= 10); 4261#L12-2 assume !(main_~i~0#1 <= 0); 4124#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4125#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4260#L12 assume !(main_~i~0#1 >= 10); 4258#L12-2 assume !(main_~i~0#1 <= 0); 4259#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4253#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4122#L12 assume !(main_~i~0#1 >= 10); 4108#L12-2 assume !(main_~i~0#1 <= 0); 4109#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4257#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4256#L12 assume !(main_~i~0#1 >= 10); 4255#L12-2 assume !(main_~i~0#1 <= 0); 4254#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4112#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4113#L12 assume !(main_~i~0#1 >= 10); 4275#L12-2 assume !(main_~i~0#1 <= 0); 4274#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4263#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4176#L12 [2023-02-16 04:33:59,944 INFO L750 eck$LassoCheckResult]: Loop: 4176#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 4175#L12-2 assume !(main_~i~0#1 <= 0); 4120#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4114#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4115#L12 assume !(main_~i~0#1 >= 10); 4110#L12-2 assume !(main_~i~0#1 <= 0); 4111#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4252#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4251#L12 assume !(main_~i~0#1 >= 10); 4250#L12-2 assume !(main_~i~0#1 <= 0); 4249#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4248#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4247#L12 assume !(main_~i~0#1 >= 10); 4246#L12-2 assume !(main_~i~0#1 <= 0); 4245#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4244#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4243#L12 assume !(main_~i~0#1 >= 10); 4242#L12-2 assume !(main_~i~0#1 <= 0); 4241#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4240#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4239#L12 assume !(main_~i~0#1 >= 10); 4238#L12-2 assume !(main_~i~0#1 <= 0); 4237#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4236#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4235#L12 assume !(main_~i~0#1 >= 10); 4234#L12-2 assume !(main_~i~0#1 <= 0); 4233#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4232#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4231#L12 assume !(main_~i~0#1 >= 10); 4230#L12-2 assume !(main_~i~0#1 <= 0); 4229#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4228#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4227#L12 assume !(main_~i~0#1 >= 10); 4226#L12-2 assume !(main_~i~0#1 <= 0); 4225#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4224#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4223#L12 assume !(main_~i~0#1 >= 10); 4220#L12-2 assume !(main_~i~0#1 <= 0); 4222#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4221#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4219#L12 assume !(main_~i~0#1 >= 10); 4218#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 4215#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4217#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4216#L12 assume !(main_~i~0#1 >= 10); 4214#L12-2 assume !(main_~i~0#1 <= 0); 4213#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4212#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4211#L12 assume !(main_~i~0#1 >= 10); 4210#L12-2 assume !(main_~i~0#1 <= 0); 4209#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4207#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4205#L12 assume !(main_~i~0#1 >= 10); 4203#L12-2 assume !(main_~i~0#1 <= 0); 4201#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4199#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4197#L12 assume !(main_~i~0#1 >= 10); 4195#L12-2 assume !(main_~i~0#1 <= 0); 4193#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4191#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4189#L12 assume !(main_~i~0#1 >= 10); 4187#L12-2 assume !(main_~i~0#1 <= 0); 4186#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4177#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4178#L12 assume !(main_~i~0#1 >= 10); 4188#L12-2 assume !(main_~i~0#1 <= 0); 4208#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4206#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4204#L12 assume !(main_~i~0#1 >= 10); 4202#L12-2 assume !(main_~i~0#1 <= 0); 4200#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4198#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4196#L12 assume !(main_~i~0#1 >= 10); 4194#L12-2 assume !(main_~i~0#1 <= 0); 4192#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4190#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4183#L12 assume !(main_~i~0#1 >= 10); 4184#L12-2 assume !(main_~i~0#1 <= 0); 4264#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4185#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4176#L12 [2023-02-16 04:33:59,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:59,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1514411024, now seen corresponding path program 2 times [2023-02-16 04:33:59,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:59,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086303186] [2023-02-16 04:33:59,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:59,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:59,950 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:33:59,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:59,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:33:59,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:59,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1617023097, now seen corresponding path program 2 times [2023-02-16 04:33:59,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:59,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857648825] [2023-02-16 04:33:59,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:59,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:59,965 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:33:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:33:59,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:33:59,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:33:59,974 INFO L85 PathProgramCache]: Analyzing trace with hash -883489176, now seen corresponding path program 4 times [2023-02-16 04:33:59,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:33:59,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150116407] [2023-02-16 04:33:59,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:33:59,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:33:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:34:00,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 530 proven. 55 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2023-02-16 04:34:00,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:34:00,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150116407] [2023-02-16 04:34:00,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150116407] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:34:00,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623944955] [2023-02-16 04:34:00,118 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-16 04:34:00,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:34:00,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:34:00,119 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:34:00,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2023-02-16 04:34:00,168 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-16 04:34:00,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 04:34:00,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-16 04:34:00,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:34:00,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 530 proven. 55 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2023-02-16 04:34:00,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:34:00,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 530 proven. 55 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2023-02-16 04:34:00,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623944955] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:34:00,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:34:00,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2023-02-16 04:34:00,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778292018] [2023-02-16 04:34:00,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:34:00,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:34:00,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 04:34:00,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-02-16 04:34:00,751 INFO L87 Difference]: Start difference. First operand 168 states and 185 transitions. cyclomatic complexity: 21 Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 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) [2023-02-16 04:34:00,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:34:00,840 INFO L93 Difference]: Finished difference Result 214 states and 229 transitions. [2023-02-16 04:34:00,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 229 transitions. [2023-02-16 04:34:00,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2023-02-16 04:34:00,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 208 states and 223 transitions. [2023-02-16 04:34:00,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2023-02-16 04:34:00,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 194 [2023-02-16 04:34:00,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 208 states and 223 transitions. [2023-02-16 04:34:00,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:34:00,844 INFO L218 hiAutomatonCegarLoop]: Abstraction has 208 states and 223 transitions. [2023-02-16 04:34:00,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states and 223 transitions. [2023-02-16 04:34:00,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 167. [2023-02-16 04:34:00,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 167 states have (on average 1.089820359281437) internal successors, (182), 166 states have internal predecessors, (182), 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) [2023-02-16 04:34:00,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 182 transitions. [2023-02-16 04:34:00,847 INFO L240 hiAutomatonCegarLoop]: Abstraction has 167 states and 182 transitions. [2023-02-16 04:34:00,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 04:34:00,847 INFO L428 stractBuchiCegarLoop]: Abstraction has 167 states and 182 transitions. [2023-02-16 04:34:00,848 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-02-16 04:34:00,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 182 transitions. [2023-02-16 04:34:00,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2023-02-16 04:34:00,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-16 04:34:00,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-16 04:34:00,849 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2023-02-16 04:34:00,849 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2023-02-16 04:34:00,850 INFO L748 eck$LassoCheckResult]: Stem: 5151#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 5152#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 5153#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5166#L12 assume !(main_~i~0#1 >= 10); 5164#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 5162#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 5161#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5204#L12 assume !(main_~i~0#1 >= 10); 5203#L12-2 assume !(main_~i~0#1 <= 0); 5202#L15-1 [2023-02-16 04:34:00,853 INFO L750 eck$LassoCheckResult]: Loop: 5202#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 5201#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5200#L12 assume !(main_~i~0#1 >= 10); 5199#L12-2 assume !(main_~i~0#1 <= 0); 5198#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 5197#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5196#L12 assume !(main_~i~0#1 >= 10); 5195#L12-2 assume !(main_~i~0#1 <= 0); 5194#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 5193#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5192#L12 assume !(main_~i~0#1 >= 10); 5191#L12-2 assume !(main_~i~0#1 <= 0); 5190#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 5189#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5188#L12 assume !(main_~i~0#1 >= 10); 5187#L12-2 assume !(main_~i~0#1 <= 0); 5186#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 5185#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5184#L12 assume !(main_~i~0#1 >= 10); 5183#L12-2 assume !(main_~i~0#1 <= 0); 5182#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 5181#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5180#L12 assume !(main_~i~0#1 >= 10); 5179#L12-2 assume !(main_~i~0#1 <= 0); 5178#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 5177#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5176#L12 assume !(main_~i~0#1 >= 10); 5175#L12-2 assume !(main_~i~0#1 <= 0); 5174#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 5173#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5172#L12 assume !(main_~i~0#1 >= 10); 5171#L12-2 assume !(main_~i~0#1 <= 0); 5170#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 5169#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5168#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 5165#L12-2 assume !(main_~i~0#1 <= 0); 5146#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 5149#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5150#L12 assume !(main_~i~0#1 >= 10); 5245#L12-2 assume !(main_~i~0#1 <= 0); 5244#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 5243#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5242#L12 assume !(main_~i~0#1 >= 10); 5241#L12-2 assume !(main_~i~0#1 <= 0); 5240#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 5239#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5238#L12 assume !(main_~i~0#1 >= 10); 5237#L12-2 assume !(main_~i~0#1 <= 0); 5236#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 5235#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5234#L12 assume !(main_~i~0#1 >= 10); 5233#L12-2 assume !(main_~i~0#1 <= 0); 5232#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 5231#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5230#L12 assume !(main_~i~0#1 >= 10); 5229#L12-2 assume !(main_~i~0#1 <= 0); 5228#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 5227#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5226#L12 assume !(main_~i~0#1 >= 10); 5225#L12-2 assume !(main_~i~0#1 <= 0); 5224#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 5223#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5222#L12 assume !(main_~i~0#1 >= 10); 5221#L12-2 assume !(main_~i~0#1 <= 0); 5220#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 5219#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5218#L12 assume !(main_~i~0#1 >= 10); 5217#L12-2 assume !(main_~i~0#1 <= 0); 5216#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 5215#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5214#L12 assume !(main_~i~0#1 >= 10); 5213#L12-2 assume !(main_~i~0#1 <= 0); 5212#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 5211#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5210#L12 assume !(main_~i~0#1 >= 10); 5208#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 5207#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 5205#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5206#L12 assume !(main_~i~0#1 >= 10); 5209#L12-2 assume !(main_~i~0#1 <= 0); 5202#L15-1 [2023-02-16 04:34:00,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:34:00,854 INFO L85 PathProgramCache]: Analyzing trace with hash 644068259, now seen corresponding path program 3 times [2023-02-16 04:34:00,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:34:00,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121401375] [2023-02-16 04:34:00,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:34:00,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:34:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:34:00,858 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:34:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:34:00,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:34:00,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:34:00,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1888138361, now seen corresponding path program 3 times [2023-02-16 04:34:00,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:34:00,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104768272] [2023-02-16 04:34:00,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:34:00,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:34:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:34:00,871 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:34:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:34:00,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:34:00,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:34:00,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1126640613, now seen corresponding path program 5 times [2023-02-16 04:34:00,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:34:00,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145862809] [2023-02-16 04:34:00,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:34:00,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:34:00,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:34:00,891 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:34:00,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:34:00,898 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:34:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:34:01,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:34:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:34:01,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.02 04:34:01 BoogieIcfgContainer [2023-02-16 04:34:01,409 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-02-16 04:34:01,412 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 04:34:01,412 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 04:34:01,412 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 04:34:01,413 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 04:33:53" (3/4) ... [2023-02-16 04:34:01,414 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-02-16 04:34:01,451 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-16 04:34:01,451 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 04:34:01,452 INFO L158 Benchmark]: Toolchain (without parser) took 8120.66ms. Allocated memory was 153.1MB in the beginning and 190.8MB in the end (delta: 37.7MB). Free memory was 112.3MB in the beginning and 127.5MB in the end (delta: -15.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-02-16 04:34:01,452 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 102.8MB. Free memory is still 51.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 04:34:01,452 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.94ms. Allocated memory is still 153.1MB. Free memory was 112.3MB in the beginning and 103.2MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-16 04:34:01,452 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.01ms. Allocated memory is still 153.1MB. Free memory was 103.2MB in the beginning and 101.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 04:34:01,453 INFO L158 Benchmark]: Boogie Preprocessor took 17.68ms. Allocated memory is still 153.1MB. Free memory was 101.8MB in the beginning and 101.2MB in the end (delta: 601.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 04:34:01,453 INFO L158 Benchmark]: RCFGBuilder took 231.29ms. Allocated memory is still 153.1MB. Free memory was 101.2MB in the beginning and 92.2MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-16 04:34:01,453 INFO L158 Benchmark]: BuchiAutomizer took 7600.58ms. Allocated memory was 153.1MB in the beginning and 190.8MB in the end (delta: 37.7MB). Free memory was 92.2MB in the beginning and 130.7MB in the end (delta: -38.4MB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. [2023-02-16 04:34:01,453 INFO L158 Benchmark]: Witness Printer took 39.35ms. Allocated memory is still 190.8MB. Free memory was 130.7MB in the beginning and 127.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 04:34:01,455 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 102.8MB. Free memory is still 51.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 196.94ms. Allocated memory is still 153.1MB. Free memory was 112.3MB in the beginning and 103.2MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.01ms. Allocated memory is still 153.1MB. Free memory was 103.2MB in the beginning and 101.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.68ms. Allocated memory is still 153.1MB. Free memory was 101.8MB in the beginning and 101.2MB in the end (delta: 601.0kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 231.29ms. Allocated memory is still 153.1MB. Free memory was 101.2MB in the beginning and 92.2MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 7600.58ms. Allocated memory was 153.1MB in the beginning and 190.8MB in the end (delta: 37.7MB). Free memory was 92.2MB in the beginning and 130.7MB in the end (delta: -38.4MB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. * Witness Printer took 39.35ms. Allocated memory is still 190.8MB. Free memory was 130.7MB in the beginning and 127.5MB in the end (delta: 3.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 15 terminating modules (8 trivial, 6 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -2 * i + 1 and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 19 and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function -1 * i and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 19 and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One nondeterministic module has affine ranking function i and consists of 4 locations. 8 modules have a trivial ranking function, the largest among these consists of 12 locations. The remainder module has 167 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.5s and 12 iterations. TraceHistogramMax:20. Analysis of lassos took 5.9s. Construction of modules took 0.3s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 15. Automata minimization 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 245 StatesRemovedByMinimization, 15 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 [6, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 172 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 163 mSDsluCounter, 164 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 538 IncrementalHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 135 mSDtfsCounter, 538 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT3 conc2 concLT1 SILN0 SILU0 SILI2 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax165 hnf100 lsp45 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq143 hnf94 smp100 dnf100 smp100 tf110 neg96 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 36ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 18]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 VAL [up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=0, up=0] [L12] COND FALSE !(i >= 10) VAL [i=0, up=0] [L15] COND TRUE i <= 0 [L16] up = 1 VAL [i=0, up=1] [L18] COND TRUE up >= 1 [L19] i = i+1 VAL [i=1, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=1, up=1] [L12] COND FALSE !(i >= 10) VAL [i=1, up=1] [L15] COND FALSE !(i <= 0) VAL [i=1, up=1] Loop: [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i >= 10 [L13] up = 0 [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND TRUE i <= 0 [L16] up = 1 [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 18]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 VAL [up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=0, up=0] [L12] COND FALSE !(i >= 10) VAL [i=0, up=0] [L15] COND TRUE i <= 0 [L16] up = 1 VAL [i=0, up=1] [L18] COND TRUE up >= 1 [L19] i = i+1 VAL [i=1, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=1, up=1] [L12] COND FALSE !(i >= 10) VAL [i=1, up=1] [L15] COND FALSE !(i <= 0) VAL [i=1, up=1] Loop: [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i >= 10 [L13] up = 0 [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND TRUE i <= 0 [L16] up = 1 [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-02-16 04:34:01,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2023-02-16 04:34:01,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2023-02-16 04:34:01,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2023-02-16 04:34:02,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-02-16 04:34:02,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)