./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/Ex08.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a31fd051 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/Ex08.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 e9f5cf3ddf7f2bce97ea02caa876a19793443837e6b09c62b997f759c9b40cc6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 14:15:15,576 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 14:15:15,578 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 14:15:15,606 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 14:15:15,606 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 14:15:15,608 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 14:15:15,609 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 14:15:15,611 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 14:15:15,613 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 14:15:15,616 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 14:15:15,617 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 14:15:15,619 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 14:15:15,619 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 14:15:15,621 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 14:15:15,622 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 14:15:15,623 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 14:15:15,624 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 14:15:15,625 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 14:15:15,626 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 14:15:15,630 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 14:15:15,631 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 14:15:15,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 14:15:15,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 14:15:15,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 14:15:15,637 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 14:15:15,637 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 14:15:15,637 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 14:15:15,638 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 14:15:15,638 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 14:15:15,638 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 14:15:15,639 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 14:15:15,639 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 14:15:15,639 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 14:15:15,640 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 14:15:15,640 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 14:15:15,640 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 14:15:15,641 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 14:15:15,641 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 14:15:15,641 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 14:15:15,641 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 14:15:15,642 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 14:15:15,644 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-02-15 14:15:15,660 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 14:15:15,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 14:15:15,661 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 14:15:15,661 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 14:15:15,662 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 14:15:15,662 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 14:15:15,662 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 14:15:15,662 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-02-15 14:15:15,662 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-02-15 14:15:15,663 INFO L138 SettingsManager]: * Use old map elimination=false [2023-02-15 14:15:15,663 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2023-02-15 14:15:15,663 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2023-02-15 14:15:15,663 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-02-15 14:15:15,663 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 14:15:15,663 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 14:15:15,663 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 14:15:15,664 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 14:15:15,664 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-02-15 14:15:15,664 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-02-15 14:15:15,664 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-02-15 14:15:15,664 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 14:15:15,664 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-02-15 14:15:15,664 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 14:15:15,664 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-02-15 14:15:15,665 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 14:15:15,665 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 14:15:15,665 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 14:15:15,665 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 14:15:15,666 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-02-15 14:15:15,666 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 -> e9f5cf3ddf7f2bce97ea02caa876a19793443837e6b09c62b997f759c9b40cc6 [2023-02-15 14:15:15,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 14:15:15,868 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 14:15:15,870 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 14:15:15,870 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 14:15:15,871 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 14:15:15,872 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/Ex08.c [2023-02-15 14:15:16,827 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 14:15:17,044 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 14:15:17,044 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Ex08.c [2023-02-15 14:15:17,048 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c763a0633/a8759c813a34438ab226594c19b511fe/FLAG704a14a95 [2023-02-15 14:15:17,423 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c763a0633/a8759c813a34438ab226594c19b511fe [2023-02-15 14:15:17,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 14:15:17,426 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 14:15:17,426 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 14:15:17,427 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 14:15:17,429 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 14:15:17,430 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 02:15:17" (1/1) ... [2023-02-15 14:15:17,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@245b90f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:17, skipping insertion in model container [2023-02-15 14:15:17,431 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 02:15:17" (1/1) ... [2023-02-15 14:15:17,436 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 14:15:17,445 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 14:15:17,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 14:15:17,540 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 14:15:17,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 14:15:17,556 INFO L208 MainTranslator]: Completed translation [2023-02-15 14:15:17,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:17 WrapperNode [2023-02-15 14:15:17,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 14:15:17,557 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 14:15:17,557 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 14:15:17,558 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 14:15:17,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:17" (1/1) ... [2023-02-15 14:15:17,565 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:17" (1/1) ... [2023-02-15 14:15:17,575 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2023-02-15 14:15:17,576 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 14:15:17,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 14:15:17,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 14:15:17,577 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 14:15:17,582 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:17" (1/1) ... [2023-02-15 14:15:17,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:17" (1/1) ... [2023-02-15 14:15:17,582 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:17" (1/1) ... [2023-02-15 14:15:17,582 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:17" (1/1) ... [2023-02-15 14:15:17,583 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:17" (1/1) ... [2023-02-15 14:15:17,586 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:17" (1/1) ... [2023-02-15 14:15:17,587 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:17" (1/1) ... [2023-02-15 14:15:17,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:17" (1/1) ... [2023-02-15 14:15:17,588 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 14:15:17,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 14:15:17,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 14:15:17,588 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 14:15:17,589 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:17" (1/1) ... [2023-02-15 14:15:17,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:17,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:17,609 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-15 14:15:17,613 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-15 14:15:17,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 14:15:17,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 14:15:17,704 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 14:15:17,705 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 14:15:17,764 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 14:15:17,769 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 14:15:17,769 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-15 14:15:17,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:15:17 BoogieIcfgContainer [2023-02-15 14:15:17,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 14:15:17,771 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-02-15 14:15:17,772 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2023-02-15 14:15:17,774 INFO L275 PluginConnector]: BuchiAutomizer initialized [2023-02-15 14:15:17,775 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 14:15:17,775 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.02 02:15:17" (1/3) ... [2023-02-15 14:15:17,776 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5bd88c11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.02 02:15:17, skipping insertion in model container [2023-02-15 14:15:17,776 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 14:15:17,776 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:17" (2/3) ... [2023-02-15 14:15:17,776 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5bd88c11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.02 02:15:17, skipping insertion in model container [2023-02-15 14:15:17,776 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 14:15:17,777 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:15:17" (3/3) ... [2023-02-15 14:15:17,778 INFO L332 chiAutomizerObserver]: Analyzing ICFG Ex08.c [2023-02-15 14:15:17,814 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-02-15 14:15:17,815 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-02-15 14:15:17,815 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-02-15 14:15:17,815 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-02-15 14:15:17,815 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-02-15 14:15:17,815 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-02-15 14:15:17,815 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-02-15 14:15:17,816 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-02-15 14:15:17,818 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-15 14:15:17,829 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-15 14:15:17,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:17,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:17,835 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-15 14:15:17,836 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 14:15:17,836 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-02-15 14:15:17,836 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-15 14:15:17,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-15 14:15:17,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:17,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:17,840 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-15 14:15:17,840 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 14:15:17,846 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-15 14:15:17,847 INFO L750 eck$LassoCheckResult]: Loop: 4#L18-1true assume !!(main_~i~0#1 > 0); 10#L12true assume !(1 == main_~i~0#1); 2#L12-2true assume 10 == main_~i~0#1;main_~up~0#1 := 0; 7#L15-1true assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4#L18-1true [2023-02-15 14:15:17,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:17,851 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-02-15 14:15:17,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:17,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787381251] [2023-02-15 14:15:17,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:17,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:17,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:17,908 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:17,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:17,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:17,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1267244, now seen corresponding path program 1 times [2023-02-15 14:15:17,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:17,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782090013] [2023-02-15 14:15:17,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:17,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:17,976 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-15 14:15:17,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:17,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782090013] [2023-02-15 14:15:17,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782090013] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:15:17,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:15:17,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 14:15:17,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845622737] [2023-02-15 14:15:17,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:15:17,982 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 14:15:17,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:18,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 14:15:18,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 14:15:18,005 INFO L87 Difference]: Start difference. 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 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-15 14:15:18,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:18,022 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2023-02-15 14:15:18,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2023-02-15 14:15:18,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-15 14:15:18,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 10 states and 15 transitions. [2023-02-15 14:15:18,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2023-02-15 14:15:18,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2023-02-15 14:15:18,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 15 transitions. [2023-02-15 14:15:18,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 14:15:18,028 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 15 transitions. [2023-02-15 14:15:18,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 15 transitions. [2023-02-15 14:15:18,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2023-02-15 14:15:18,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 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-15 14:15:18,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2023-02-15 14:15:18,047 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 15 transitions. [2023-02-15 14:15:18,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 14:15:18,051 INFO L428 stractBuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2023-02-15 14:15:18,052 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-02-15 14:15:18,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2023-02-15 14:15:18,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-15 14:15:18,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:18,054 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:18,055 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-15 14:15:18,055 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 14:15:18,055 INFO L748 eck$LassoCheckResult]: Stem: 42#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 43#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; 44#L18-1 [2023-02-15 14:15:18,055 INFO L750 eck$LassoCheckResult]: Loop: 44#L18-1 assume !!(main_~i~0#1 > 0); 46#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 37#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 38#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 44#L18-1 [2023-02-15 14:15:18,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:18,056 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2023-02-15 14:15:18,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:18,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929158385] [2023-02-15 14:15:18,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:18,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:18,060 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:18,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:18,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:18,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1265324, now seen corresponding path program 1 times [2023-02-15 14:15:18,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:18,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183375711] [2023-02-15 14:15:18,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:18,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:18,088 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-15 14:15:18,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:18,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183375711] [2023-02-15 14:15:18,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183375711] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:15:18,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:15:18,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 14:15:18,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126051197] [2023-02-15 14:15:18,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:15:18,090 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 14:15:18,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:18,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 14:15:18,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 14:15:18,091 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:18,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:18,106 INFO L93 Difference]: Finished difference Result 14 states and 21 transitions. [2023-02-15 14:15:18,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 21 transitions. [2023-02-15 14:15:18,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-15 14:15:18,109 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 21 transitions. [2023-02-15 14:15:18,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2023-02-15 14:15:18,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2023-02-15 14:15:18,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 21 transitions. [2023-02-15 14:15:18,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 14:15:18,109 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 21 transitions. [2023-02-15 14:15:18,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 21 transitions. [2023-02-15 14:15:18,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-02-15 14:15:18,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:18,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2023-02-15 14:15:18,112 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 21 transitions. [2023-02-15 14:15:18,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 14:15:18,113 INFO L428 stractBuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2023-02-15 14:15:18,113 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-02-15 14:15:18,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 21 transitions. [2023-02-15 14:15:18,114 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-15 14:15:18,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:18,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:18,114 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-15 14:15:18,114 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 14:15:18,114 INFO L748 eck$LassoCheckResult]: Stem: 71#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 72#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; 74#L18-1 [2023-02-15 14:15:18,115 INFO L750 eck$LassoCheckResult]: Loop: 74#L18-1 assume !!(main_~i~0#1 > 0); 79#L12 assume !(1 == main_~i~0#1); 78#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 73#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 74#L18-1 [2023-02-15 14:15:18,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:18,115 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2023-02-15 14:15:18,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:18,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600938670] [2023-02-15 14:15:18,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:18,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:18,120 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:18,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:18,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:18,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1267246, now seen corresponding path program 1 times [2023-02-15 14:15:18,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:18,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462358882] [2023-02-15 14:15:18,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:18,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:18,129 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:18,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:18,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:18,133 INFO L85 PathProgramCache]: Analyzing trace with hash 889694448, now seen corresponding path program 1 times [2023-02-15 14:15:18,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:18,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564637228] [2023-02-15 14:15:18,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:18,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:18,138 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:18,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:18,219 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:18,219 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:18,219 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:18,219 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:18,219 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:15:18,220 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:18,220 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:18,220 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:18,220 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration3_Loop [2023-02-15 14:15:18,220 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:18,220 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:18,231 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-15 14:15:18,239 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-15 14:15:18,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-15 14:15:18,250 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-15 14:15:18,309 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:18,309 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:15:18,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:18,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:18,314 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-15 14:15:18,316 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-15 14:15:18,317 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:18,317 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:18,333 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:18,334 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-15 14:15:18,337 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-15 14:15:18,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:18,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:18,342 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-15 14:15:18,343 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-15 14:15:18,344 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:18,344 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:18,356 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:18,356 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-15 14:15:18,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-02-15 14:15:18,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:18,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:18,372 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-15 14:15:18,373 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-15 14:15:18,375 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:18,375 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:18,398 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-15 14:15:18,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:18,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:18,400 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-15 14:15:18,404 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-15 14:15:18,405 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:15:18,405 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:18,430 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:15:18,449 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-15 14:15:18,449 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:18,450 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:18,450 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:18,450 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:18,450 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:15:18,450 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:18,450 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:18,450 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:18,450 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration3_Loop [2023-02-15 14:15:18,450 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:18,450 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:18,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-15 14:15:18,458 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-15 14:15:18,463 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-15 14:15:18,467 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-15 14:15:18,516 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:18,519 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:15:18,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:18,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:18,521 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-15 14:15:18,523 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-15 14:15:18,528 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-15 14:15:18,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:18,535 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:18,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:18,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:18,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:18,540 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:18,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:18,555 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:18,558 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-15 14:15:18,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:18,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:18,559 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-15 14:15:18,560 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-15 14:15:18,562 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-15 14:15:18,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:18,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:18,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:18,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:18,573 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:15:18,573 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:15:18,586 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:18,592 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-15 14:15:18,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:18,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:18,593 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-15 14:15:18,596 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-15 14:15:18,605 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-15 14:15:18,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:18,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:18,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:18,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:18,616 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:15:18,616 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:15:18,625 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:18,628 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-15 14:15:18,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:18,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:18,629 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-15 14:15:18,630 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-15 14:15:18,632 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-15 14:15:18,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:18,639 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:18,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:18,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:18,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:18,640 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:18,640 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:18,649 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:15:18,653 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:15:18,653 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 14:15:18,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:18,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:18,655 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-15 14:15:18,656 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-15 14:15:18,658 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:15:18,659 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:15:18,659 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:15:18,659 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-15 14:15:18,664 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-15 14:15:18,666 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:15:18,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:18,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:15:18,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:18,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:15:18,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:18,723 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-15 14:15:18,727 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-15 14:15:18,728 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 21 transitions. cyclomatic complexity: 8 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-15 14:15:18,770 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 21 transitions. cyclomatic complexity: 8. 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 35 states and 51 transitions. Complement of second has 7 states. [2023-02-15 14:15:18,771 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-15 14:15:18,772 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-15 14:15:18,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2023-02-15 14:15:18,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2023-02-15 14:15:18,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:18,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2023-02-15 14:15:18,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:18,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2023-02-15 14:15:18,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:18,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 51 transitions. [2023-02-15 14:15:18,782 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2023-02-15 14:15:18,783 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 30 states and 44 transitions. [2023-02-15 14:15:18,783 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2023-02-15 14:15:18,783 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2023-02-15 14:15:18,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 44 transitions. [2023-02-15 14:15:18,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:18,783 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 44 transitions. [2023-02-15 14:15:18,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 44 transitions. [2023-02-15 14:15:18,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2023-02-15 14:15:18,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.44) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:18,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2023-02-15 14:15:18,786 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 36 transitions. [2023-02-15 14:15:18,786 INFO L428 stractBuchiCegarLoop]: Abstraction has 25 states and 36 transitions. [2023-02-15 14:15:18,786 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-02-15 14:15:18,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 36 transitions. [2023-02-15 14:15:18,786 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2023-02-15 14:15:18,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:18,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:18,787 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-02-15 14:15:18,787 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 14:15:18,787 INFO L748 eck$LassoCheckResult]: Stem: 166#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 167#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; 169#L18-1 assume !!(main_~i~0#1 > 0); 163#L12 [2023-02-15 14:15:18,787 INFO L750 eck$LassoCheckResult]: Loop: 163#L12 assume !(1 == main_~i~0#1); 179#L12-2 assume !(10 == main_~i~0#1); 168#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 162#L18-1 assume !!(main_~i~0#1 > 0); 163#L12 [2023-02-15 14:15:18,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:18,788 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2023-02-15 14:15:18,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:18,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466291053] [2023-02-15 14:15:18,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:18,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:18,792 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:18,793 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:18,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:18,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1422198, now seen corresponding path program 1 times [2023-02-15 14:15:18,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:18,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116756180] [2023-02-15 14:15:18,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:18,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:18,797 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:18,799 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:18,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:18,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1810726045, now seen corresponding path program 1 times [2023-02-15 14:15:18,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:18,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320848940] [2023-02-15 14:15:18,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:18,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:18,804 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:18,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:18,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:18,828 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:18,828 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:18,828 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:18,828 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:18,829 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:15:18,829 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:18,829 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:18,829 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:18,829 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration4_Loop [2023-02-15 14:15:18,829 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:18,829 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:18,830 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-15 14:15:18,832 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-15 14:15:18,838 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-15 14:15:18,841 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-15 14:15:18,890 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:18,890 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:15:18,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:18,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:18,892 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-15 14:15:18,899 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-15 14:15:18,900 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:18,900 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:18,918 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:18,918 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-15 14:15:18,924 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-15 14:15:18,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:18,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:18,925 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-15 14:15:18,928 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-15 14:15:18,929 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:18,929 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:18,956 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-15 14:15:18,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:18,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:18,958 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-15 14:15:18,958 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-15 14:15:18,961 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:15:18,961 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:19,009 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:15:19,023 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-15 14:15:19,023 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:19,023 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:19,023 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:19,023 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:19,023 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:15:19,023 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:19,024 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:19,024 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:19,024 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration4_Loop [2023-02-15 14:15:19,024 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:19,024 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:19,025 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-15 14:15:19,027 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-15 14:15:19,033 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-15 14:15:19,037 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-15 14:15:19,104 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:19,105 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:15:19,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:19,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:19,106 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-15 14:15:19,109 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-15 14:15:19,111 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-15 14:15:19,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:19,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:19,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:19,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:19,121 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:15:19,122 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:15:19,149 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:19,159 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-15 14:15:19,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:19,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:19,161 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-15 14:15:19,163 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-15 14:15:19,165 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-15 14:15:19,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:19,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:19,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:19,171 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-15 14:15:19,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:19,173 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 14:15:19,173 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:19,200 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:15:19,203 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:15:19,203 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 14:15:19,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:19,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:19,206 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-15 14:15:19,207 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-15 14:15:19,208 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:15:19,208 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:15:19,209 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:15:19,209 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-15 14:15:19,214 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-15 14:15:19,215 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:15:19,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:19,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:15:19,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:19,239 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:15:19,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:19,263 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-15 14:15:19,264 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-15 14:15:19,264 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14 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-15 14:15:19,289 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14. 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 41 states and 59 transitions. Complement of second has 7 states. [2023-02-15 14:15:19,289 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-15 14:15:19,290 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-15 14:15:19,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2023-02-15 14:15:19,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 4 letters. [2023-02-15 14:15:19,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:19,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 4 letters. [2023-02-15 14:15:19,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:19,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 8 letters. [2023-02-15 14:15:19,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:19,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 59 transitions. [2023-02-15 14:15:19,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-15 14:15:19,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 32 states and 49 transitions. [2023-02-15 14:15:19,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2023-02-15 14:15:19,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2023-02-15 14:15:19,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 49 transitions. [2023-02-15 14:15:19,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:19,301 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2023-02-15 14:15:19,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 49 transitions. [2023-02-15 14:15:19,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-02-15 14:15:19,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.53125) internal successors, (49), 31 states have internal predecessors, (49), 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-15 14:15:19,324 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-15 14:15:19,341 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-15 14:15:19,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 49 transitions. [2023-02-15 14:15:19,342 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2023-02-15 14:15:19,342 INFO L428 stractBuchiCegarLoop]: Abstraction has 32 states and 49 transitions. [2023-02-15 14:15:19,342 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-02-15 14:15:19,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 49 transitions. [2023-02-15 14:15:19,343 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-15 14:15:19,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:19,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:19,345 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-02-15 14:15:19,345 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 14:15:19,345 INFO L748 eck$LassoCheckResult]: Stem: 275#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 276#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; 279#L18-1 assume !!(main_~i~0#1 > 0); 282#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 284#L12-2 assume !(10 == main_~i~0#1); 289#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 290#L18-1 [2023-02-15 14:15:19,345 INFO L750 eck$LassoCheckResult]: Loop: 290#L18-1 assume !!(main_~i~0#1 > 0); 297#L12 assume !(1 == main_~i~0#1); 291#L12-2 assume !(10 == main_~i~0#1); 292#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 290#L18-1 [2023-02-15 14:15:19,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:19,346 INFO L85 PathProgramCache]: Analyzing trace with hash 889692586, now seen corresponding path program 1 times [2023-02-15 14:15:19,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:19,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143236862] [2023-02-15 14:15:19,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:19,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:19,356 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:19,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:19,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:19,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1267306, now seen corresponding path program 1 times [2023-02-15 14:15:19,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:19,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138110030] [2023-02-15 14:15:19,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:19,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:19,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:19,363 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:19,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:19,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:19,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1068497811, now seen corresponding path program 1 times [2023-02-15 14:15:19,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:19,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496274523] [2023-02-15 14:15:19,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:19,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:19,371 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:19,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:19,391 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:19,392 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:19,392 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:19,392 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:19,392 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:15:19,392 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:19,392 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:19,392 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:19,392 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Loop [2023-02-15 14:15:19,392 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:19,392 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:19,393 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-15 14:15:19,396 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-15 14:15:19,398 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-15 14:15:19,405 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-15 14:15:19,480 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:19,480 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:15:19,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:19,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:19,481 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-15 14:15:19,483 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-15 14:15:19,485 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:19,485 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:19,506 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:19,506 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-15 14:15:19,512 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-15 14:15:19,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:19,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:19,513 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-15 14:15:19,516 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-15 14:15:19,518 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:19,518 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:19,545 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:19,545 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-15 14:15:19,551 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-15 14:15:19,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:19,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:19,565 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-15 14:15:19,568 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-15 14:15:19,569 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:19,570 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:19,601 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-15 14:15:19,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:19,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:19,603 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-15 14:15:19,610 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:15:19,611 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:19,625 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-15 14:15:19,629 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:19,630 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0#1=14} Honda state: {ULTIMATE.start_main_~i~0#1=14} Generalized eigenvectors: [{ULTIMATE.start_main_~i~0#1=0}, {ULTIMATE.start_main_~i~0#1=1}, {ULTIMATE.start_main_~i~0#1=0}] Lambdas: [0, 1, 5] Nus: [0, 1] [2023-02-15 14:15:19,633 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-15 14:15:19,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:19,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:19,634 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-15 14:15:19,636 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-15 14:15:19,638 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:19,638 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:19,652 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:19,652 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 14:15:19,658 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-15 14:15:19,686 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:19,687 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:19,687 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:19,687 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:19,687 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:15:19,687 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:19,687 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:19,687 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:19,687 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Lasso [2023-02-15 14:15:19,687 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:19,687 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:19,688 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-15 14:15:19,692 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-15 14:15:19,700 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-15 14:15:19,701 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-15 14:15:19,703 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-15 14:15:19,706 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-15 14:15:19,784 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:19,784 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:15:19,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:19,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:19,785 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-15 14:15:19,787 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-15 14:15:19,789 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:19,789 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:19,796 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:19,796 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res#1=0} Honda state: {ULTIMATE.start_main_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 14:15:19,801 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-15 14:15:19,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:19,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:19,802 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-15 14:15:19,802 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-15 14:15:19,804 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:19,805 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:19,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2023-02-15 14:15:19,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:19,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:19,838 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:19,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-02-15 14:15:19,841 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:15:19,841 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:19,855 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:15:19,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:19,860 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:19,860 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:19,860 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:19,860 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:19,860 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:15:19,860 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:19,860 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:19,860 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:19,860 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Lasso [2023-02-15 14:15:19,861 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:19,861 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:19,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-15 14:15:19,863 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-15 14:15:19,879 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-15 14:15:19,881 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-15 14:15:19,884 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-15 14:15:19,886 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-15 14:15:19,957 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:19,957 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:15:19,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:19,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:19,959 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-15 14:15:19,961 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-15 14:15:19,991 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-15 14:15:19,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:19,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:19,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:19,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:19,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:19,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:19,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:20,000 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:20,003 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-15 14:15:20,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:20,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:20,009 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-15 14:15:20,015 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-15 14:15:20,015 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-15 14:15:20,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:20,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:20,022 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-15 14:15:20,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:20,027 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-02-15 14:15:20,027 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-02-15 14:15:20,045 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:15:20,061 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2023-02-15 14:15:20,061 INFO L444 ModelExtractionUtils]: 0 out of 11 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-02-15 14:15:20,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:20,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:20,065 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-15 14:15:20,068 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-15 14:15:20,069 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:15:20,102 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2023-02-15 14:15:20,102 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:15:20,102 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 21 Supporting invariants [-1*ULTIMATE.start_main_~i~0#1 + 10 >= 0] [2023-02-15 14:15:20,108 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-15 14:15:20,112 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2023-02-15 14:15:20,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:20,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:15:20,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:20,153 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 14:15:20,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:20,171 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-15 14:15:20,172 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2023-02-15 14:15:20,172 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 49 transitions. cyclomatic complexity: 21 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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-15 14:15:20,219 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 49 transitions. cyclomatic complexity: 21. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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) Result 46 states and 68 transitions. Complement of second has 8 states. [2023-02-15 14:15:20,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-15 14:15:20,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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-15 14:15:20,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2023-02-15 14:15:20,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. [2023-02-15 14:15:20,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:20,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 10 letters. Loop has 4 letters. [2023-02-15 14:15:20,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:20,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 6 letters. Loop has 8 letters. [2023-02-15 14:15:20,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:20,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 68 transitions. [2023-02-15 14:15:20,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-15 14:15:20,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 67 transitions. [2023-02-15 14:15:20,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2023-02-15 14:15:20,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2023-02-15 14:15:20,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 67 transitions. [2023-02-15 14:15:20,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:20,227 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 67 transitions. [2023-02-15 14:15:20,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 67 transitions. [2023-02-15 14:15:20,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2023-02-15 14:15:20,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 41 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:20,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 64 transitions. [2023-02-15 14:15:20,234 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 64 transitions. [2023-02-15 14:15:20,234 INFO L428 stractBuchiCegarLoop]: Abstraction has 42 states and 64 transitions. [2023-02-15 14:15:20,236 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-02-15 14:15:20,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 64 transitions. [2023-02-15 14:15:20,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-15 14:15:20,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:20,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:20,238 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:15:20,238 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 14:15:20,238 INFO L748 eck$LassoCheckResult]: Stem: 418#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 419#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; 423#L18-1 assume !!(main_~i~0#1 > 0); 432#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 429#L12-2 assume !(10 == main_~i~0#1); 428#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 427#L18-1 assume !!(main_~i~0#1 > 0); 424#L12 assume !(1 == main_~i~0#1); 425#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 449#L15-1 [2023-02-15 14:15:20,238 INFO L750 eck$LassoCheckResult]: Loop: 449#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 414#L18-1 assume !!(main_~i~0#1 > 0); 415#L12 assume !(1 == main_~i~0#1); 448#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 449#L15-1 [2023-02-15 14:15:20,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:20,239 INFO L85 PathProgramCache]: Analyzing trace with hash 588656997, now seen corresponding path program 1 times [2023-02-15 14:15:20,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:20,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164863440] [2023-02-15 14:15:20,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:20,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:20,276 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-15 14:15:20,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:20,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164863440] [2023-02-15 14:15:20,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164863440] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:15:20,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090078947] [2023-02-15 14:15:20,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:20,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:20,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:20,278 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:15:20,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-02-15 14:15:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:20,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 14:15:20,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:20,303 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-15 14:15:20,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:15:20,321 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-15 14:15:20,329 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-15 14:15:20,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090078947] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:15:20,329 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:15:20,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-02-15 14:15:20,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394578670] [2023-02-15 14:15:20,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:15:20,330 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 14:15:20,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:20,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1768756, now seen corresponding path program 2 times [2023-02-15 14:15:20,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:20,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045500443] [2023-02-15 14:15:20,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:20,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:20,334 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:20,336 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:20,352 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:20,353 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:20,353 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:20,353 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:20,353 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:15:20,353 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:20,353 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:20,353 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:20,353 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration6_Loop [2023-02-15 14:15:20,354 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:20,354 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:20,354 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-15 14:15:20,358 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-15 14:15:20,361 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-15 14:15:20,363 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-15 14:15:20,395 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:20,395 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:15:20,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:20,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:20,411 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-15 14:15:20,412 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-15 14:15:20,413 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:20,413 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:20,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:20,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:20,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:20,438 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-15 14:15:20,440 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-15 14:15:20,442 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:15:20,442 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:20,509 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:15:20,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2023-02-15 14:15:20,513 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:20,513 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:20,513 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:20,513 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:20,513 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:15:20,513 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:20,514 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:20,514 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:20,514 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration6_Loop [2023-02-15 14:15:20,514 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:20,514 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:20,514 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-15 14:15:20,524 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-15 14:15:20,528 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-15 14:15:20,530 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-15 14:15:20,572 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:20,572 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:15:20,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:20,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:20,573 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-15 14:15:20,576 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-15 14:15:20,577 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-15 14:15:20,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:20,583 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:20,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:20,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:20,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:20,584 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:20,584 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:20,591 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:15:20,593 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:15:20,593 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 14:15:20,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:20,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:20,594 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-15 14:15:20,595 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-15 14:15:20,598 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:15:20,598 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:15:20,598 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:15:20,598 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-15 14:15:20,603 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-15 14:15:20,603 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:15:20,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:20,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:15:20,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:20,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:15:20,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:20,653 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-15 14:15:20,654 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-15 14:15:20,655 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 64 transitions. cyclomatic complexity: 27 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-15 14:15:20,685 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 64 transitions. cyclomatic complexity: 27. 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 105 states and 160 transitions. Complement of second has 7 states. [2023-02-15 14:15:20,687 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-15 14:15:20,687 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-15 14:15:20,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2023-02-15 14:15:20,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2023-02-15 14:15:20,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:20,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 13 letters. Loop has 4 letters. [2023-02-15 14:15:20,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:20,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 8 letters. [2023-02-15 14:15:20,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:20,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 160 transitions. [2023-02-15 14:15:20,692 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2023-02-15 14:15:20,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 87 states and 133 transitions. [2023-02-15 14:15:20,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2023-02-15 14:15:20,693 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2023-02-15 14:15:20,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 133 transitions. [2023-02-15 14:15:20,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:20,693 INFO L218 hiAutomatonCegarLoop]: Abstraction has 87 states and 133 transitions. [2023-02-15 14:15:20,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 133 transitions. [2023-02-15 14:15:20,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2023-02-15 14:15:20,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.548780487804878) internal successors, (127), 81 states have internal predecessors, (127), 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-15 14:15:20,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 127 transitions. [2023-02-15 14:15:20,696 INFO L240 hiAutomatonCegarLoop]: Abstraction has 82 states and 127 transitions. [2023-02-15 14:15:20,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:20,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 14:15:20,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-02-15 14:15:20,697 INFO L87 Difference]: Start difference. First operand 82 states and 127 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-15 14:15:20,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:20,729 INFO L93 Difference]: Finished difference Result 160 states and 239 transitions. [2023-02-15 14:15:20,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 239 transitions. [2023-02-15 14:15:20,731 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2023-02-15 14:15:20,732 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 160 states and 239 transitions. [2023-02-15 14:15:20,732 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2023-02-15 14:15:20,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2023-02-15 14:15:20,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 160 states and 239 transitions. [2023-02-15 14:15:20,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:20,733 INFO L218 hiAutomatonCegarLoop]: Abstraction has 160 states and 239 transitions. [2023-02-15 14:15:20,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states and 239 transitions. [2023-02-15 14:15:20,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 136. [2023-02-15 14:15:20,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 136 states have (on average 1.5220588235294117) internal successors, (207), 135 states have internal predecessors, (207), 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-15 14:15:20,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 207 transitions. [2023-02-15 14:15:20,738 INFO L240 hiAutomatonCegarLoop]: Abstraction has 136 states and 207 transitions. [2023-02-15 14:15:20,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 14:15:20,739 INFO L428 stractBuchiCegarLoop]: Abstraction has 136 states and 207 transitions. [2023-02-15 14:15:20,739 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-02-15 14:15:20,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 207 transitions. [2023-02-15 14:15:20,740 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2023-02-15 14:15:20,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:20,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:20,740 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2023-02-15 14:15:20,740 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 14:15:20,740 INFO L748 eck$LassoCheckResult]: Stem: 920#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 921#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; 926#L18-1 assume !!(main_~i~0#1 > 0); 985#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 945#L12-2 assume !(10 == main_~i~0#1); 946#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 994#L18-1 assume !!(main_~i~0#1 > 0); 991#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 944#L12-2 assume !(10 == main_~i~0#1); 983#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 964#L18-1 [2023-02-15 14:15:20,741 INFO L750 eck$LassoCheckResult]: Loop: 964#L18-1 assume !!(main_~i~0#1 > 0); 978#L12 assume !(1 == main_~i~0#1); 957#L12-2 assume !(10 == main_~i~0#1); 969#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 964#L18-1 [2023-02-15 14:15:20,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:20,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1068495891, now seen corresponding path program 1 times [2023-02-15 14:15:20,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:20,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955002840] [2023-02-15 14:15:20,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:20,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:20,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:15:20,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:20,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955002840] [2023-02-15 14:15:20,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955002840] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:15:20,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:15:20,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 14:15:20,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074220452] [2023-02-15 14:15:20,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:15:20,765 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 14:15:20,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:20,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1267308, now seen corresponding path program 2 times [2023-02-15 14:15:20,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:20,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327513607] [2023-02-15 14:15:20,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:20,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:20,767 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:20,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:20,784 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:20,784 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:20,784 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:20,784 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:20,784 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:15:20,784 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:20,784 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:20,784 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:20,784 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration7_Loop [2023-02-15 14:15:20,784 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:20,784 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:20,785 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-15 14:15:20,789 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-15 14:15:20,791 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-15 14:15:20,793 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-15 14:15:20,859 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:20,859 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:15:20,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:20,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:20,861 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-15 14:15:20,861 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-15 14:15:20,864 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:20,864 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:20,874 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-15 14:15:20,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:20,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:20,876 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-15 14:15:20,876 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-15 14:15:20,879 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:15:20,879 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:20,895 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:15:20,900 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-15 14:15:20,900 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:20,900 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:20,900 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:20,900 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:20,900 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:15:20,900 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:20,900 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:20,900 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:20,900 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration7_Loop [2023-02-15 14:15:20,900 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:20,900 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:20,901 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-15 14:15:20,907 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-15 14:15:20,909 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-15 14:15:20,911 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-15 14:15:20,968 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:20,969 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:15:20,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:20,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:20,970 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-15 14:15:20,972 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-15 14:15:20,973 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-15 14:15:20,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:20,979 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:20,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:20,979 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-15 14:15:20,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:20,980 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 14:15:20,981 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:20,994 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:15:21,010 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:15:21,010 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 14:15:21,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:21,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:21,013 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-15 14:15:21,014 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-15 14:15:21,016 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:15:21,016 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:15:21,016 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:15:21,016 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-15 14:15:21,021 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-15 14:15:21,022 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:15:21,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:21,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:15:21,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:21,061 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:15:21,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:21,077 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-15 14:15:21,078 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-15 14:15:21,078 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 136 states and 207 transitions. cyclomatic complexity: 82 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:21,101 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 136 states and 207 transitions. cyclomatic complexity: 82. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 248 states and 381 transitions. Complement of second has 5 states. [2023-02-15 14:15:21,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-15 14:15:21,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:21,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2023-02-15 14:15:21,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 4 letters. [2023-02-15 14:15:21,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:21,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 4 letters. [2023-02-15 14:15:21,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:21,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 8 letters. [2023-02-15 14:15:21,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:21,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 248 states and 381 transitions. [2023-02-15 14:15:21,104 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2023-02-15 14:15:21,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 248 states to 224 states and 333 transitions. [2023-02-15 14:15:21,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2023-02-15 14:15:21,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112 [2023-02-15 14:15:21,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 224 states and 333 transitions. [2023-02-15 14:15:21,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:21,106 INFO L218 hiAutomatonCegarLoop]: Abstraction has 224 states and 333 transitions. [2023-02-15 14:15:21,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states and 333 transitions. [2023-02-15 14:15:21,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 202. [2023-02-15 14:15:21,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 202 states have (on average 1.504950495049505) internal successors, (304), 201 states have internal predecessors, (304), 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-15 14:15:21,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 304 transitions. [2023-02-15 14:15:21,112 INFO L240 hiAutomatonCegarLoop]: Abstraction has 202 states and 304 transitions. [2023-02-15 14:15:21,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:21,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 14:15:21,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 14:15:21,112 INFO L87 Difference]: Start difference. First operand 202 states and 304 transitions. Second operand has 4 states, 4 states have (on average 2.5) 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-15 14:15:21,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:21,125 INFO L93 Difference]: Finished difference Result 230 states and 313 transitions. [2023-02-15 14:15:21,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 230 states and 313 transitions. [2023-02-15 14:15:21,126 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2023-02-15 14:15:21,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 230 states to 230 states and 313 transitions. [2023-02-15 14:15:21,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2023-02-15 14:15:21,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2023-02-15 14:15:21,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 230 states and 313 transitions. [2023-02-15 14:15:21,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:21,127 INFO L218 hiAutomatonCegarLoop]: Abstraction has 230 states and 313 transitions. [2023-02-15 14:15:21,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states and 313 transitions. [2023-02-15 14:15:21,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 201. [2023-02-15 14:15:21,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 201 states have (on average 1.3830845771144278) internal successors, (278), 200 states have internal predecessors, (278), 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-15 14:15:21,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 278 transitions. [2023-02-15 14:15:21,132 INFO L240 hiAutomatonCegarLoop]: Abstraction has 201 states and 278 transitions. [2023-02-15 14:15:21,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 14:15:21,133 INFO L428 stractBuchiCegarLoop]: Abstraction has 201 states and 278 transitions. [2023-02-15 14:15:21,133 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-02-15 14:15:21,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 201 states and 278 transitions. [2023-02-15 14:15:21,134 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2023-02-15 14:15:21,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:21,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:21,134 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2023-02-15 14:15:21,134 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 14:15:21,134 INFO L748 eck$LassoCheckResult]: Stem: 1798#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1799#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; 1802#L18-1 assume !!(main_~i~0#1 > 0); 1817#L12 assume !(1 == main_~i~0#1); 1820#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 1819#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 1815#L18-1 assume !!(main_~i~0#1 > 0); 1816#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 1949#L12-2 assume !(10 == main_~i~0#1); 1825#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 1805#L18-1 assume !!(main_~i~0#1 > 0); 1806#L12 assume !(1 == main_~i~0#1); 1988#L12-2 assume !(10 == main_~i~0#1); 1809#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 1793#L18-1 [2023-02-15 14:15:21,134 INFO L750 eck$LassoCheckResult]: Loop: 1793#L18-1 assume !!(main_~i~0#1 > 0); 1794#L12 assume !(1 == main_~i~0#1); 1803#L12-2 assume !(10 == main_~i~0#1); 1810#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 1793#L18-1 [2023-02-15 14:15:21,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:21,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1454758974, now seen corresponding path program 1 times [2023-02-15 14:15:21,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:21,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191934179] [2023-02-15 14:15:21,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:21,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:21,157 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 14:15:21,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:21,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191934179] [2023-02-15 14:15:21,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191934179] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:15:21,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:15:21,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 14:15:21,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144773781] [2023-02-15 14:15:21,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:15:21,157 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 14:15:21,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:21,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1267308, now seen corresponding path program 3 times [2023-02-15 14:15:21,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:21,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880636513] [2023-02-15 14:15:21,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:21,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:21,160 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:21,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:21,177 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:21,177 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:21,177 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:21,177 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:21,177 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:15:21,177 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:21,177 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:21,177 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:21,177 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration8_Loop [2023-02-15 14:15:21,177 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:21,177 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:21,178 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-15 14:15:21,180 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-15 14:15:21,181 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-15 14:15:21,183 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-15 14:15:21,236 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:21,236 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:15:21,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:21,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:21,237 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-15 14:15:21,237 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-15 14:15:21,240 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:21,240 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:21,252 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:21,252 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_12=1} Honda state: {v_rep~unnamed0~0~true_12=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 14:15:21,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2023-02-15 14:15:21,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:21,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:21,256 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-15 14:15:21,258 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-15 14:15:21,259 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:21,259 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:21,272 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:21,272 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=4} Honda state: {ULTIMATE.start_main_~up~0#1=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 14:15:21,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2023-02-15 14:15:21,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:21,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:21,276 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-15 14:15:21,277 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-15 14:15:21,279 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:21,279 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:21,291 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:21,291 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_12=0} Honda state: {v_rep~unnamed0~0~false_12=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 14:15:21,296 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-15 14:15:21,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:21,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:21,297 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-15 14:15:21,300 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-15 14:15:21,312 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:21,313 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:21,342 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-15 14:15:21,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:21,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:21,343 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-15 14:15:21,345 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-15 14:15:21,400 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:15:21,400 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:21,414 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:15:21,419 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-15 14:15:21,420 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:21,420 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:21,420 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:21,420 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:21,420 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:15:21,420 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:21,420 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:21,420 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:21,420 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration8_Loop [2023-02-15 14:15:21,420 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:21,420 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:21,421 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-15 14:15:21,425 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-15 14:15:21,427 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-15 14:15:21,429 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-15 14:15:21,498 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:21,498 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:15:21,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:21,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:21,499 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-15 14:15:21,502 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-15 14:15:21,502 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-15 14:15:21,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:21,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:21,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:21,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:21,510 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:15:21,510 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:15:21,525 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:21,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2023-02-15 14:15:21,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:21,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:21,541 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-15 14:15:21,541 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-15 14:15:21,544 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-15 14:15:21,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:21,550 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:21,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:21,550 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-15 14:15:21,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:21,551 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 14:15:21,551 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:21,552 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:21,555 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-15 14:15:21,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:21,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:21,556 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-15 14:15:21,572 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-15 14:15:21,576 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-15 14:15:21,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:21,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:21,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:21,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:21,580 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:15:21,580 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:15:21,589 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:21,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2023-02-15 14:15:21,595 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-15 14:15:21,595 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-15 14:15:21,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:21,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:21,596 INFO L229 MonitoredProcess]: Starting monitored process 45 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-15 14:15:21,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2023-02-15 14:15:21,600 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-15 14:15:21,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:21,606 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:21,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:21,606 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-15 14:15:21,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:21,608 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 14:15:21,608 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:21,614 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:15:21,616 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-02-15 14:15:21,616 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 14:15:21,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:21,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:21,617 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-15 14:15:21,618 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-15 14:15:21,620 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:15:21,621 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:15:21,621 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:15:21,621 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-15 14:15:21,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2023-02-15 14:15:21,624 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:15:21,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:21,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:15:21,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:21,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:21,667 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:15:21,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:21,680 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-15 14:15:21,680 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-15 14:15:21,681 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 201 states and 278 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-15 14:15:21,696 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 201 states and 278 transitions. cyclomatic complexity: 94. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 280 states and 401 transitions. Complement of second has 5 states. [2023-02-15 14:15:21,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-15 14:15:21,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-15 14:15:21,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2023-02-15 14:15:21,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 4 letters. [2023-02-15 14:15:21,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:21,697 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 14:15:21,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:21,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:21,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:15:21,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:21,731 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:15:21,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:21,742 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-15 14:15:21,743 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-15 14:15:21,743 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 201 states and 278 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-15 14:15:21,752 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 201 states and 278 transitions. cyclomatic complexity: 94. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 280 states and 401 transitions. Complement of second has 5 states. [2023-02-15 14:15:21,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-15 14:15:21,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-15 14:15:21,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2023-02-15 14:15:21,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 4 letters. [2023-02-15 14:15:21,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:21,753 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 14:15:21,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:21,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:15:21,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:21,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:21,778 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:15:21,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:21,792 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-15 14:15:21,792 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-15 14:15:21,793 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 201 states and 278 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-15 14:15:21,808 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 201 states and 278 transitions. cyclomatic complexity: 94. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 334 states and 496 transitions. Complement of second has 4 states. [2023-02-15 14:15:21,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-15 14:15:21,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-15 14:15:21,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2023-02-15 14:15:21,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2023-02-15 14:15:21,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:21,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 18 letters. Loop has 4 letters. [2023-02-15 14:15:21,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:21,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 8 letters. [2023-02-15 14:15:21,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:21,809 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 334 states and 496 transitions. [2023-02-15 14:15:21,811 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2023-02-15 14:15:21,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 334 states to 268 states and 378 transitions. [2023-02-15 14:15:21,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2023-02-15 14:15:21,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2023-02-15 14:15:21,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 268 states and 378 transitions. [2023-02-15 14:15:21,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:21,813 INFO L218 hiAutomatonCegarLoop]: Abstraction has 268 states and 378 transitions. [2023-02-15 14:15:21,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states and 378 transitions. [2023-02-15 14:15:21,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 167. [2023-02-15 14:15:21,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 167 states have (on average 1.401197604790419) internal successors, (234), 166 states have internal predecessors, (234), 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-15 14:15:21,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 234 transitions. [2023-02-15 14:15:21,816 INFO L240 hiAutomatonCegarLoop]: Abstraction has 167 states and 234 transitions. [2023-02-15 14:15:21,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:21,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 14:15:21,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 14:15:21,817 INFO L87 Difference]: Start difference. First operand 167 states and 234 transitions. 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-15 14:15:21,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:21,844 INFO L93 Difference]: Finished difference Result 179 states and 246 transitions. [2023-02-15 14:15:21,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 179 states and 246 transitions. [2023-02-15 14:15:21,845 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 92 [2023-02-15 14:15:21,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 179 states to 177 states and 243 transitions. [2023-02-15 14:15:21,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2023-02-15 14:15:21,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 93 [2023-02-15 14:15:21,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 177 states and 243 transitions. [2023-02-15 14:15:21,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:21,846 INFO L218 hiAutomatonCegarLoop]: Abstraction has 177 states and 243 transitions. [2023-02-15 14:15:21,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states and 243 transitions. [2023-02-15 14:15:21,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 170. [2023-02-15 14:15:21,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 170 states have (on average 1.3764705882352941) internal successors, (234), 169 states have internal predecessors, (234), 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-15 14:15:21,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 234 transitions. [2023-02-15 14:15:21,849 INFO L240 hiAutomatonCegarLoop]: Abstraction has 170 states and 234 transitions. [2023-02-15 14:15:21,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 14:15:21,849 INFO L428 stractBuchiCegarLoop]: Abstraction has 170 states and 234 transitions. [2023-02-15 14:15:21,849 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-02-15 14:15:21,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 170 states and 234 transitions. [2023-02-15 14:15:21,850 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 90 [2023-02-15 14:15:21,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:21,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:21,850 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2023-02-15 14:15:21,850 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1] [2023-02-15 14:15:21,850 INFO L748 eck$LassoCheckResult]: Stem: 3429#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 3430#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; 3434#L18-1 assume !!(main_~i~0#1 > 0); 3555#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 3533#L12-2 assume !(10 == main_~i~0#1); 3437#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3438#L18-1 assume !!(main_~i~0#1 > 0); 3560#L12 assume !(1 == main_~i~0#1); 3558#L12-2 assume !(10 == main_~i~0#1); 3556#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3442#L18-1 [2023-02-15 14:15:21,851 INFO L750 eck$LassoCheckResult]: Loop: 3442#L18-1 assume !!(main_~i~0#1 > 0); 3536#L12 assume !(1 == main_~i~0#1); 3475#L12-2 assume !(10 == main_~i~0#1); 3525#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3523#L18-1 assume !!(main_~i~0#1 > 0); 3520#L12 assume !(1 == main_~i~0#1); 3516#L12-2 assume !(10 == main_~i~0#1); 3440#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3442#L18-1 [2023-02-15 14:15:21,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:21,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1068497813, now seen corresponding path program 1 times [2023-02-15 14:15:21,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:21,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831050473] [2023-02-15 14:15:21,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:21,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:21,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 14:15:21,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:21,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831050473] [2023-02-15 14:15:21,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831050473] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:15:21,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:15:21,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 14:15:21,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061692051] [2023-02-15 14:15:21,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:15:21,876 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 14:15:21,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:21,876 INFO L85 PathProgramCache]: Analyzing trace with hash -2142023595, now seen corresponding path program 1 times [2023-02-15 14:15:21,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:21,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076342084] [2023-02-15 14:15:21,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:21,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:21,891 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:15:21,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:21,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076342084] [2023-02-15 14:15:21,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076342084] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:15:21,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:15:21,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 14:15:21,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010463990] [2023-02-15 14:15:21,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:15:21,893 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 14:15:21,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:21,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 14:15:21,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 14:15:21,894 INFO L87 Difference]: Start difference. First operand 170 states and 234 transitions. cyclomatic complexity: 73 Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:21,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:21,899 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2023-02-15 14:15:21,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 118 transitions. [2023-02-15 14:15:21,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2023-02-15 14:15:21,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 84 states and 95 transitions. [2023-02-15 14:15:21,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2023-02-15 14:15:21,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2023-02-15 14:15:21,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 95 transitions. [2023-02-15 14:15:21,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:21,900 INFO L218 hiAutomatonCegarLoop]: Abstraction has 84 states and 95 transitions. [2023-02-15 14:15:21,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 95 transitions. [2023-02-15 14:15:21,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2023-02-15 14:15:21,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 81 states have internal predecessors, (93), 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-15 14:15:21,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2023-02-15 14:15:21,903 INFO L240 hiAutomatonCegarLoop]: Abstraction has 82 states and 93 transitions. [2023-02-15 14:15:21,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 14:15:21,903 INFO L428 stractBuchiCegarLoop]: Abstraction has 82 states and 93 transitions. [2023-02-15 14:15:21,904 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-02-15 14:15:21,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 93 transitions. [2023-02-15 14:15:21,904 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2023-02-15 14:15:21,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:21,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:21,905 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 5, 4, 2, 1, 1, 1, 1] [2023-02-15 14:15:21,905 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 5, 5, 4, 2, 1, 1] [2023-02-15 14:15:21,905 INFO L748 eck$LassoCheckResult]: Stem: 3711#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 3712#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; 3714#L18-1 assume !!(main_~i~0#1 > 0); 3739#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 3735#L12-2 assume !(10 == main_~i~0#1); 3734#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3733#L18-1 assume !!(main_~i~0#1 > 0); 3732#L12 assume !(1 == main_~i~0#1); 3731#L12-2 assume !(10 == main_~i~0#1); 3730#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3729#L18-1 assume !!(main_~i~0#1 > 0); 3728#L12 assume !(1 == main_~i~0#1); 3727#L12-2 assume !(10 == main_~i~0#1); 3726#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3725#L18-1 assume !!(main_~i~0#1 > 0); 3722#L12 assume !(1 == main_~i~0#1); 3724#L12-2 assume !(10 == main_~i~0#1); 3723#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3721#L18-1 assume !!(main_~i~0#1 > 0); 3720#L12 assume !(1 == main_~i~0#1); 3719#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 3713#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3709#L18-1 assume !!(main_~i~0#1 > 0); 3710#L12 assume !(1 == main_~i~0#1); 3704#L12-2 assume !(10 == main_~i~0#1); 3706#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3783#L18-1 assume !!(main_~i~0#1 > 0); 3782#L12 [2023-02-15 14:15:21,905 INFO L750 eck$LassoCheckResult]: Loop: 3782#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 3702#L12-2 assume !(10 == main_~i~0#1); 3703#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3707#L18-1 assume !!(main_~i~0#1 > 0); 3708#L12 assume !(1 == main_~i~0#1); 3715#L12-2 assume !(10 == main_~i~0#1); 3781#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3780#L18-1 assume !!(main_~i~0#1 > 0); 3779#L12 assume !(1 == main_~i~0#1); 3778#L12-2 assume !(10 == main_~i~0#1); 3777#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3776#L18-1 assume !!(main_~i~0#1 > 0); 3775#L12 assume !(1 == main_~i~0#1); 3774#L12-2 assume !(10 == main_~i~0#1); 3749#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3745#L18-1 assume !!(main_~i~0#1 > 0); 3737#L12 assume !(1 == main_~i~0#1); 3738#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 3716#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3717#L18-1 assume !!(main_~i~0#1 > 0); 3710#L12 assume !(1 == main_~i~0#1); 3704#L12-2 assume !(10 == main_~i~0#1); 3706#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3783#L18-1 assume !!(main_~i~0#1 > 0); 3782#L12 [2023-02-15 14:15:21,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:21,906 INFO L85 PathProgramCache]: Analyzing trace with hash -608617554, now seen corresponding path program 2 times [2023-02-15 14:15:21,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:21,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198519641] [2023-02-15 14:15:21,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:21,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:21,985 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 14:15:21,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:21,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198519641] [2023-02-15 14:15:21,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198519641] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:15:21,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281009656] [2023-02-15 14:15:21,985 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 14:15:21,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:21,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:21,986 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:15:21,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2023-02-15 14:15:22,008 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 14:15:22,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 14:15:22,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 14:15:22,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:22,033 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 14:15:22,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:15:22,083 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 14:15:22,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281009656] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:15:22,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:15:22,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-15 14:15:22,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915505180] [2023-02-15 14:15:22,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:15:22,084 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 14:15:22,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:22,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1118663673, now seen corresponding path program 1 times [2023-02-15 14:15:22,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:22,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870073008] [2023-02-15 14:15:22,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:22,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:22,123 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 14:15:22,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:22,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870073008] [2023-02-15 14:15:22,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870073008] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:15:22,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406660802] [2023-02-15 14:15:22,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:22,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:22,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:22,125 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:15:22,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2023-02-15 14:15:22,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:22,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 14:15:22,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:22,166 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 14:15:22,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:15:22,206 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 14:15:22,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406660802] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:15:22,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:15:22,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2023-02-15 14:15:22,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662367962] [2023-02-15 14:15:22,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:15:22,207 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 14:15:22,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:22,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 14:15:22,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2023-02-15 14:15:22,207 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. cyclomatic complexity: 17 Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 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-15 14:15:22,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:22,242 INFO L93 Difference]: Finished difference Result 169 states and 180 transitions. [2023-02-15 14:15:22,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 180 transitions. [2023-02-15 14:15:22,243 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2023-02-15 14:15:22,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 149 states and 160 transitions. [2023-02-15 14:15:22,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2023-02-15 14:15:22,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2023-02-15 14:15:22,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 160 transitions. [2023-02-15 14:15:22,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:22,244 INFO L218 hiAutomatonCegarLoop]: Abstraction has 149 states and 160 transitions. [2023-02-15 14:15:22,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 160 transitions. [2023-02-15 14:15:22,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 142. [2023-02-15 14:15:22,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 142 states have (on average 1.0774647887323943) internal successors, (153), 141 states have internal predecessors, (153), 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-15 14:15:22,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2023-02-15 14:15:22,246 INFO L240 hiAutomatonCegarLoop]: Abstraction has 142 states and 153 transitions. [2023-02-15 14:15:22,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 14:15:22,246 INFO L428 stractBuchiCegarLoop]: Abstraction has 142 states and 153 transitions. [2023-02-15 14:15:22,246 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-02-15 14:15:22,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 153 transitions. [2023-02-15 14:15:22,247 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 46 [2023-02-15 14:15:22,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:22,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:22,248 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 10, 10, 9, 2, 1, 1, 1, 1] [2023-02-15 14:15:22,248 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [11, 10, 10, 9, 2, 1, 1] [2023-02-15 14:15:22,248 INFO L748 eck$LassoCheckResult]: Stem: 4278#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4279#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; 4282#L18-1 assume !!(main_~i~0#1 > 0); 4384#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 4270#L12-2 assume !(10 == main_~i~0#1); 4271#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4370#L18-1 assume !!(main_~i~0#1 > 0); 4369#L12 assume !(1 == main_~i~0#1); 4368#L12-2 assume !(10 == main_~i~0#1); 4367#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4366#L18-1 assume !!(main_~i~0#1 > 0); 4365#L12 assume !(1 == main_~i~0#1); 4364#L12-2 assume !(10 == main_~i~0#1); 4363#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4362#L18-1 assume !!(main_~i~0#1 > 0); 4361#L12 assume !(1 == main_~i~0#1); 4360#L12-2 assume !(10 == main_~i~0#1); 4359#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4358#L18-1 assume !!(main_~i~0#1 > 0); 4357#L12 assume !(1 == main_~i~0#1); 4356#L12-2 assume !(10 == main_~i~0#1); 4355#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4354#L18-1 assume !!(main_~i~0#1 > 0); 4353#L12 assume !(1 == main_~i~0#1); 4352#L12-2 assume !(10 == main_~i~0#1); 4351#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4350#L18-1 assume !!(main_~i~0#1 > 0); 4349#L12 assume !(1 == main_~i~0#1); 4348#L12-2 assume !(10 == main_~i~0#1); 4347#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4346#L18-1 assume !!(main_~i~0#1 > 0); 4345#L12 assume !(1 == main_~i~0#1); 4344#L12-2 assume !(10 == main_~i~0#1); 4343#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4342#L18-1 assume !!(main_~i~0#1 > 0); 4292#L12 assume !(1 == main_~i~0#1); 4296#L12-2 assume !(10 == main_~i~0#1); 4293#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4291#L18-1 assume !!(main_~i~0#1 > 0); 4290#L12 assume !(1 == main_~i~0#1); 4289#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 4280#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4281#L18-1 assume !!(main_~i~0#1 > 0); 4338#L12 assume !(1 == main_~i~0#1); 4340#L12-2 assume !(10 == main_~i~0#1); 4339#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4337#L18-1 assume !!(main_~i~0#1 > 0); 4336#L12 [2023-02-15 14:15:22,248 INFO L750 eck$LassoCheckResult]: Loop: 4336#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 4335#L12-2 assume !(10 == main_~i~0#1); 4334#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4333#L18-1 assume !!(main_~i~0#1 > 0); 4332#L12 assume !(1 == main_~i~0#1); 4331#L12-2 assume !(10 == main_~i~0#1); 4330#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4329#L18-1 assume !!(main_~i~0#1 > 0); 4328#L12 assume !(1 == main_~i~0#1); 4327#L12-2 assume !(10 == main_~i~0#1); 4326#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4325#L18-1 assume !!(main_~i~0#1 > 0); 4324#L12 assume !(1 == main_~i~0#1); 4323#L12-2 assume !(10 == main_~i~0#1); 4322#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4321#L18-1 assume !!(main_~i~0#1 > 0); 4320#L12 assume !(1 == main_~i~0#1); 4319#L12-2 assume !(10 == main_~i~0#1); 4318#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4317#L18-1 assume !!(main_~i~0#1 > 0); 4316#L12 assume !(1 == main_~i~0#1); 4315#L12-2 assume !(10 == main_~i~0#1); 4314#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4313#L18-1 assume !!(main_~i~0#1 > 0); 4312#L12 assume !(1 == main_~i~0#1); 4311#L12-2 assume !(10 == main_~i~0#1); 4310#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4309#L18-1 assume !!(main_~i~0#1 > 0); 4308#L12 assume !(1 == main_~i~0#1); 4307#L12-2 assume !(10 == main_~i~0#1); 4306#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4305#L18-1 assume !!(main_~i~0#1 > 0); 4304#L12 assume !(1 == main_~i~0#1); 4303#L12-2 assume !(10 == main_~i~0#1); 4301#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4297#L18-1 assume !!(main_~i~0#1 > 0); 4294#L12 assume !(1 == main_~i~0#1); 4295#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 4286#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4287#L18-1 assume !!(main_~i~0#1 > 0); 4338#L12 assume !(1 == main_~i~0#1); 4340#L12-2 assume !(10 == main_~i~0#1); 4339#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4337#L18-1 assume !!(main_~i~0#1 > 0); 4336#L12 [2023-02-15 14:15:22,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:22,248 INFO L85 PathProgramCache]: Analyzing trace with hash -733322943, now seen corresponding path program 3 times [2023-02-15 14:15:22,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:22,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985242502] [2023-02-15 14:15:22,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:22,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:22,254 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:22,258 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:22,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:22,259 INFO L85 PathProgramCache]: Analyzing trace with hash 491326234, now seen corresponding path program 2 times [2023-02-15 14:15:22,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:22,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608012565] [2023-02-15 14:15:22,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:22,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:22,263 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:22,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:22,271 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:22,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:22,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1133081510, now seen corresponding path program 4 times [2023-02-15 14:15:22,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:22,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037160115] [2023-02-15 14:15:22,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:22,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:22,327 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-15 14:15:22,336 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 562 proven. 3 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2023-02-15 14:15:22,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:22,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037160115] [2023-02-15 14:15:22,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037160115] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:15:22,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552973610] [2023-02-15 14:15:22,337 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 14:15:22,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:22,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:22,338 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:15:22,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2023-02-15 14:15:22,424 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 14:15:22,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 14:15:22,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:15:22,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:22,438 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 562 proven. 3 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2023-02-15 14:15:22,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:15:22,456 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 562 proven. 3 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2023-02-15 14:15:22,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552973610] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:15:22,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:15:22,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-02-15 14:15:22,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958667150] [2023-02-15 14:15:22,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:15:22,556 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:22,557 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:22,557 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:22,557 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:22,557 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:15:22,557 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:22,557 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:22,557 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:22,557 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration11_Loop [2023-02-15 14:15:22,557 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:22,557 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:22,557 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-15 14:15:22,561 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-15 14:15:22,562 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-15 14:15:22,564 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-15 14:15:22,588 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:22,589 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:15:22,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:22,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:22,590 INFO L229 MonitoredProcess]: Starting monitored process 50 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-15 14:15:22,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2023-02-15 14:15:22,592 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:22,593 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:22,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:22,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:22,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:22,603 INFO L229 MonitoredProcess]: Starting monitored process 51 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-15 14:15:22,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2023-02-15 14:15:22,609 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:15:22,609 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:22,616 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:15:22,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2023-02-15 14:15:22,619 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:22,619 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:22,619 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:22,619 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:22,619 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:15:22,619 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:22,619 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:22,619 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:22,619 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration11_Loop [2023-02-15 14:15:22,619 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:22,619 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:22,620 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-15 14:15:22,621 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-15 14:15:22,624 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-15 14:15:22,626 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-15 14:15:22,662 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:22,662 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:15:22,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:22,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:22,663 INFO L229 MonitoredProcess]: Starting monitored process 52 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-15 14:15:22,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2023-02-15 14:15:22,666 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-15 14:15:22,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:22,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:22,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:22,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:22,673 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:15:22,674 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:15:22,676 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:22,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:22,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:22,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:22,679 INFO L229 MonitoredProcess]: Starting monitored process 53 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-15 14:15:22,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2023-02-15 14:15:22,682 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-15 14:15:22,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:22,688 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:22,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:22,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:22,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:22,689 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:22,689 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:22,691 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:15:22,692 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:15:22,692 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 14:15:22,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:22,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:22,694 INFO L229 MonitoredProcess]: Starting monitored process 54 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-15 14:15:22,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2023-02-15 14:15:22,696 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:15:22,696 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:15:22,696 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:15:22,697 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 9 Supporting invariants [] [2023-02-15 14:15:22,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:22,700 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:15:22,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:22,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:15:22,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:22,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 14:15:22,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:22,841 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-15 14:15:22,842 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2023-02-15 14:15:22,842 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 142 states and 153 transitions. cyclomatic complexity: 17 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:22,864 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 142 states and 153 transitions. cyclomatic complexity: 17. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 228 states and 242 transitions. Complement of second has 7 states. [2023-02-15 14:15:22,864 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-15 14:15:22,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:22,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2023-02-15 14:15:22,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 47 letters. Loop has 44 letters. [2023-02-15 14:15:22,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:22,865 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 14:15:22,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:22,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:22,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:15:22,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:22,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 14:15:22,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:22,992 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-15 14:15:22,993 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2023-02-15 14:15:22,993 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 142 states and 153 transitions. cyclomatic complexity: 17 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:23,037 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 142 states and 153 transitions. cyclomatic complexity: 17. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 238 states and 253 transitions. Complement of second has 11 states. [2023-02-15 14:15:23,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2023-02-15 14:15:23,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:23,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2023-02-15 14:15:23,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 47 letters. Loop has 44 letters. [2023-02-15 14:15:23,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:23,038 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 14:15:23,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:23,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:15:23,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:23,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:23,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 14:15:23,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:23,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:23,195 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-15 14:15:23,196 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 5 loop predicates [2023-02-15 14:15:23,197 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 142 states and 153 transitions. cyclomatic complexity: 17 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:23,218 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 142 states and 153 transitions. cyclomatic complexity: 17. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 268 states and 284 transitions. Complement of second has 9 states. [2023-02-15 14:15:23,218 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-15 14:15:23,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:23,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2023-02-15 14:15:23,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 47 letters. Loop has 44 letters. [2023-02-15 14:15:23,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:23,220 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 14:15:23,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:23,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:15:23,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:23,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 14:15:23,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:23,341 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-15 14:15:23,342 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2023-02-15 14:15:23,342 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 142 states and 153 transitions. cyclomatic complexity: 17 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:23,397 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 142 states and 153 transitions. cyclomatic complexity: 17. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 380 states and 401 transitions. Complement of second has 19 states. [2023-02-15 14:15:23,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2023-02-15 14:15:23,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:23,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2023-02-15 14:15:23,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 47 letters. Loop has 44 letters. [2023-02-15 14:15:23,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:23,400 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 14:15:23,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:23,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:15:23,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:23,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:23,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 14:15:23,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:23,505 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-15 14:15:23,506 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2023-02-15 14:15:23,506 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 142 states and 153 transitions. cyclomatic complexity: 17 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:23,621 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 142 states and 153 transitions. cyclomatic complexity: 17 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1899 states and 2480 transitions. Complement of second has 166 states 20 powerset states146 rank states. The highest rank that occured is 5 [2023-02-15 14:15:23,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2023-02-15 14:15:23,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:23,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2023-02-15 14:15:23,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 70 transitions. Stem has 47 letters. Loop has 44 letters. [2023-02-15 14:15:23,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:23,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 70 transitions. Stem has 91 letters. Loop has 44 letters. [2023-02-15 14:15:23,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:23,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 70 transitions. Stem has 47 letters. Loop has 88 letters. [2023-02-15 14:15:23,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:23,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1899 states and 2480 transitions. [2023-02-15 14:15:23,641 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 96 [2023-02-15 14:15:23,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1899 states to 956 states and 1245 transitions. [2023-02-15 14:15:23,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2023-02-15 14:15:23,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 224 [2023-02-15 14:15:23,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 956 states and 1245 transitions. [2023-02-15 14:15:23,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:23,645 INFO L218 hiAutomatonCegarLoop]: Abstraction has 956 states and 1245 transitions. [2023-02-15 14:15:23,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states and 1245 transitions. [2023-02-15 14:15:23,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 564. [2023-02-15 14:15:23,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 564 states have (on average 1.3953900709219857) internal successors, (787), 563 states have internal predecessors, (787), 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-15 14:15:23,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 787 transitions. [2023-02-15 14:15:23,652 INFO L240 hiAutomatonCegarLoop]: Abstraction has 564 states and 787 transitions. [2023-02-15 14:15:23,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:23,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 14:15:23,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2023-02-15 14:15:23,653 INFO L87 Difference]: Start difference. First operand 564 states and 787 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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-15 14:15:23,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:23,679 INFO L93 Difference]: Finished difference Result 692 states and 978 transitions. [2023-02-15 14:15:23,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 692 states and 978 transitions. [2023-02-15 14:15:23,682 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 98 [2023-02-15 14:15:23,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 692 states to 675 states and 954 transitions. [2023-02-15 14:15:23,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2023-02-15 14:15:23,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2023-02-15 14:15:23,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 675 states and 954 transitions. [2023-02-15 14:15:23,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:23,685 INFO L218 hiAutomatonCegarLoop]: Abstraction has 675 states and 954 transitions. [2023-02-15 14:15:23,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states and 954 transitions. [2023-02-15 14:15:23,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 634. [2023-02-15 14:15:23,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 634 states have (on average 1.411671924290221) internal successors, (895), 633 states have internal predecessors, (895), 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-15 14:15:23,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 895 transitions. [2023-02-15 14:15:23,698 INFO L240 hiAutomatonCegarLoop]: Abstraction has 634 states and 895 transitions. [2023-02-15 14:15:23,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 14:15:23,699 INFO L428 stractBuchiCegarLoop]: Abstraction has 634 states and 895 transitions. [2023-02-15 14:15:23,699 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-02-15 14:15:23,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 634 states and 895 transitions. [2023-02-15 14:15:23,701 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 90 [2023-02-15 14:15:23,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:23,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:23,702 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 14, 14, 9, 6, 1, 1, 1, 1] [2023-02-15 14:15:23,702 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 14, 14, 9, 6, 1, 1] [2023-02-15 14:15:23,702 INFO L748 eck$LassoCheckResult]: Stem: 10860#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 10861#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; 10865#L18-1 assume !!(main_~i~0#1 > 0); 11067#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 11202#L12-2 assume !(10 == main_~i~0#1); 11203#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11353#L18-1 assume !!(main_~i~0#1 > 0); 11352#L12 assume !(1 == main_~i~0#1); 11351#L12-2 assume !(10 == main_~i~0#1); 11350#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11349#L18-1 assume !!(main_~i~0#1 > 0); 11348#L12 assume !(1 == main_~i~0#1); 11347#L12-2 assume !(10 == main_~i~0#1); 11346#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11345#L18-1 assume !!(main_~i~0#1 > 0); 11344#L12 assume !(1 == main_~i~0#1); 11343#L12-2 assume !(10 == main_~i~0#1); 11342#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11341#L18-1 assume !!(main_~i~0#1 > 0); 11340#L12 assume !(1 == main_~i~0#1); 11339#L12-2 assume !(10 == main_~i~0#1); 11338#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11337#L18-1 assume !!(main_~i~0#1 > 0); 11336#L12 assume !(1 == main_~i~0#1); 11335#L12-2 assume !(10 == main_~i~0#1); 11334#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11333#L18-1 assume !!(main_~i~0#1 > 0); 11332#L12 assume !(1 == main_~i~0#1); 11331#L12-2 assume !(10 == main_~i~0#1); 11330#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11329#L18-1 assume !!(main_~i~0#1 > 0); 11328#L12 assume !(1 == main_~i~0#1); 11327#L12-2 assume !(10 == main_~i~0#1); 11326#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11325#L18-1 assume !!(main_~i~0#1 > 0); 11319#L12 assume !(1 == main_~i~0#1); 11324#L12-2 assume !(10 == main_~i~0#1); 11322#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11318#L18-1 assume !!(main_~i~0#1 > 0); 11320#L12 assume !(1 == main_~i~0#1); 11419#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 11294#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11418#L18-1 assume !!(main_~i~0#1 > 0); 11417#L12 assume !(1 == main_~i~0#1); 11416#L12-2 assume !(10 == main_~i~0#1); 11415#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11414#L18-1 assume !!(main_~i~0#1 > 0); 11413#L12 assume !(1 == main_~i~0#1); 11412#L12-2 assume !(10 == main_~i~0#1); 11411#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11410#L18-1 assume !!(main_~i~0#1 > 0); 11409#L12 assume !(1 == main_~i~0#1); 11369#L12-2 assume !(10 == main_~i~0#1); 11368#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11366#L18-1 assume !!(main_~i~0#1 > 0); 11363#L12 assume !(1 == main_~i~0#1); 11364#L12-2 assume !(10 == main_~i~0#1); 11371#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11372#L18-1 assume !!(main_~i~0#1 > 0); 11422#L12 assume !(1 == main_~i~0#1); 11355#L12-2 assume !(10 == main_~i~0#1); 11316#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11317#L18-1 assume !!(main_~i~0#1 > 0); 11193#L12 [2023-02-15 14:15:23,702 INFO L750 eck$LassoCheckResult]: Loop: 11193#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 11296#L12-2 assume !(10 == main_~i~0#1); 11321#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 10871#L18-1 assume !!(main_~i~0#1 > 0); 10866#L12 assume !(1 == main_~i~0#1); 10867#L12-2 assume !(10 == main_~i~0#1); 11483#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11481#L18-1 assume !!(main_~i~0#1 > 0); 11479#L12 assume !(1 == main_~i~0#1); 11477#L12-2 assume !(10 == main_~i~0#1); 11475#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11473#L18-1 assume !!(main_~i~0#1 > 0); 11471#L12 assume !(1 == main_~i~0#1); 11469#L12-2 assume !(10 == main_~i~0#1); 11467#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11465#L18-1 assume !!(main_~i~0#1 > 0); 11463#L12 assume !(1 == main_~i~0#1); 11461#L12-2 assume !(10 == main_~i~0#1); 11459#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11457#L18-1 assume !!(main_~i~0#1 > 0); 11455#L12 assume !(1 == main_~i~0#1); 11453#L12-2 assume !(10 == main_~i~0#1); 11451#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11449#L18-1 assume !!(main_~i~0#1 > 0); 11447#L12 assume !(1 == main_~i~0#1); 11445#L12-2 assume !(10 == main_~i~0#1); 11443#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11441#L18-1 assume !!(main_~i~0#1 > 0); 11439#L12 assume !(1 == main_~i~0#1); 11437#L12-2 assume !(10 == main_~i~0#1); 11435#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11433#L18-1 assume !!(main_~i~0#1 > 0); 11432#L12 assume !(1 == main_~i~0#1); 11431#L12-2 assume !(10 == main_~i~0#1); 11427#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11428#L18-1 assume !!(main_~i~0#1 > 0); 11420#L12 assume !(1 == main_~i~0#1); 11421#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 11294#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11418#L18-1 assume !!(main_~i~0#1 > 0); 11417#L12 assume !(1 == main_~i~0#1); 11416#L12-2 assume !(10 == main_~i~0#1); 11415#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11414#L18-1 assume !!(main_~i~0#1 > 0); 11413#L12 assume !(1 == main_~i~0#1); 11412#L12-2 assume !(10 == main_~i~0#1); 11411#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11410#L18-1 assume !!(main_~i~0#1 > 0); 11409#L12 assume !(1 == main_~i~0#1); 11369#L12-2 assume !(10 == main_~i~0#1); 11368#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11366#L18-1 assume !!(main_~i~0#1 > 0); 11363#L12 assume !(1 == main_~i~0#1); 11364#L12-2 assume !(10 == main_~i~0#1); 11371#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11372#L18-1 assume !!(main_~i~0#1 > 0); 11358#L12 assume !(1 == main_~i~0#1); 11354#L12-2 assume !(10 == main_~i~0#1); 11316#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11317#L18-1 assume !!(main_~i~0#1 > 0); 11193#L12 [2023-02-15 14:15:23,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:23,703 INFO L85 PathProgramCache]: Analyzing trace with hash 912728085, now seen corresponding path program 5 times [2023-02-15 14:15:23,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:23,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675188001] [2023-02-15 14:15:23,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:23,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:23,709 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:23,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:23,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:23,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1190197230, now seen corresponding path program 3 times [2023-02-15 14:15:23,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:23,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231920024] [2023-02-15 14:15:23,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:23,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:23,719 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:23,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:23,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:23,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:23,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1444454914, now seen corresponding path program 6 times [2023-02-15 14:15:23,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:23,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920285382] [2023-02-15 14:15:23,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:23,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:23,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 1138 proven. 55 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2023-02-15 14:15:23,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:23,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920285382] [2023-02-15 14:15:23,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920285382] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:15:23,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519861020] [2023-02-15 14:15:23,836 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-15 14:15:23,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:23,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:23,840 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:15:23,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2023-02-15 14:15:23,876 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2023-02-15 14:15:23,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 14:15:23,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 14:15:23,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:23,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 1138 proven. 55 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2023-02-15 14:15:23,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:15:23,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 1138 proven. 55 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2023-02-15 14:15:23,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519861020] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:15:23,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:15:23,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2023-02-15 14:15:23,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086220097] [2023-02-15 14:15:23,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:15:24,117 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:24,118 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:24,118 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:24,118 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:24,118 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:15:24,118 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:24,118 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:24,118 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:24,118 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration12_Loop [2023-02-15 14:15:24,118 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:24,118 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:24,118 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-15 14:15:24,120 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-15 14:15:24,124 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-15 14:15:24,127 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-15 14:15:24,154 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:24,154 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:15:24,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:24,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:24,155 INFO L229 MonitoredProcess]: Starting monitored process 56 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-15 14:15:24,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2023-02-15 14:15:24,159 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:24,159 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:24,169 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:24,170 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_16=1} Honda state: {v_rep~unnamed0~0~true_16=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 14:15:24,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:24,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:24,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:24,173 INFO L229 MonitoredProcess]: Starting monitored process 57 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-15 14:15:24,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2023-02-15 14:15:24,176 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:24,176 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:24,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2023-02-15 14:15:24,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:24,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:24,187 INFO L229 MonitoredProcess]: Starting monitored process 58 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-15 14:15:24,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2023-02-15 14:15:24,190 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:15:24,190 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:24,197 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:15:24,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:24,200 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:24,200 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:24,200 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:24,200 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:24,200 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:15:24,200 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:24,201 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:24,201 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:24,201 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration12_Loop [2023-02-15 14:15:24,201 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:24,201 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:24,201 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-15 14:15:24,205 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-15 14:15:24,215 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-15 14:15:24,216 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-15 14:15:24,253 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:24,253 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:15:24,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:24,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:24,254 INFO L229 MonitoredProcess]: Starting monitored process 59 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-15 14:15:24,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2023-02-15 14:15:24,257 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-15 14:15:24,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:24,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:24,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:24,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:24,264 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:15:24,264 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:15:24,266 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:24,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:24,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:24,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:24,269 INFO L229 MonitoredProcess]: Starting monitored process 60 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-15 14:15:24,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2023-02-15 14:15:24,272 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-15 14:15:24,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:24,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:24,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:24,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:24,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:24,278 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:24,278 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:24,280 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:15:24,281 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:15:24,281 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 14:15:24,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:24,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:24,282 INFO L229 MonitoredProcess]: Starting monitored process 61 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-15 14:15:24,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2023-02-15 14:15:24,285 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:15:24,285 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:15:24,285 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:15:24,285 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 5 Supporting invariants [] [2023-02-15 14:15:24,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:24,288 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:15:24,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:24,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:15:24,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:24,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 14:15:24,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:24,513 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-15 14:15:24,514 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2023-02-15 14:15:24,514 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 634 states and 895 transitions. cyclomatic complexity: 279 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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-15 14:15:24,546 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 634 states and 895 transitions. cyclomatic complexity: 279. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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 1120 states and 1472 transitions. Complement of second has 7 states. [2023-02-15 14:15:24,546 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-15 14:15:24,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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-15 14:15:24,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2023-02-15 14:15:24,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 63 letters. Loop has 60 letters. [2023-02-15 14:15:24,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:24,547 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 14:15:24,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:24,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:15:24,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:24,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 14:15:24,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:24,759 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-15 14:15:24,759 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 9 loop predicates [2023-02-15 14:15:24,760 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 634 states and 895 transitions. cyclomatic complexity: 279 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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-15 14:15:24,797 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 634 states and 895 transitions. cyclomatic complexity: 279. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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 1179 states and 1565 transitions. Complement of second has 11 states. [2023-02-15 14:15:24,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2023-02-15 14:15:24,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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-15 14:15:24,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2023-02-15 14:15:24,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 63 letters. Loop has 60 letters. [2023-02-15 14:15:24,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:24,798 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 14:15:24,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:24,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:15:24,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:24,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 14:15:24,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:24,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2023-02-15 14:15:24,993 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-15 14:15:24,994 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 9 loop predicates [2023-02-15 14:15:24,994 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 634 states and 895 transitions. cyclomatic complexity: 279 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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-15 14:15:25,018 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 634 states and 895 transitions. cyclomatic complexity: 279. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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 1301 states and 1787 transitions. Complement of second has 9 states. [2023-02-15 14:15:25,018 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-15 14:15:25,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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-15 14:15:25,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2023-02-15 14:15:25,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 63 letters. Loop has 60 letters. [2023-02-15 14:15:25,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:25,019 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 14:15:25,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:15:25,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 14:15:25,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:25,206 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-15 14:15:25,206 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 9 loop predicates [2023-02-15 14:15:25,207 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 634 states and 895 transitions. cyclomatic complexity: 279 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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-15 14:15:25,259 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 634 states and 895 transitions. cyclomatic complexity: 279. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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 1866 states and 2535 transitions. Complement of second has 19 states. [2023-02-15 14:15:25,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2023-02-15 14:15:25,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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-15 14:15:25,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2023-02-15 14:15:25,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 63 letters. Loop has 60 letters. [2023-02-15 14:15:25,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:25,261 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 14:15:25,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:25,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:15:25,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 14:15:25,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:25,466 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-15 14:15:25,467 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2023-02-15 14:15:25,467 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 634 states and 895 transitions. cyclomatic complexity: 279 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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-15 14:15:25,827 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 634 states and 895 transitions. cyclomatic complexity: 279 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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 11129 states and 19734 transitions. Complement of second has 282 states 36 powerset states246 rank states. The highest rank that occured is 5 [2023-02-15 14:15:25,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2023-02-15 14:15:25,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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-15 14:15:25,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 110 transitions. [2023-02-15 14:15:25,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 110 transitions. Stem has 63 letters. Loop has 60 letters. [2023-02-15 14:15:25,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:25,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 110 transitions. Stem has 123 letters. Loop has 60 letters. [2023-02-15 14:15:25,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:25,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 110 transitions. Stem has 63 letters. Loop has 120 letters. [2023-02-15 14:15:25,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:25,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11129 states and 19734 transitions. [2023-02-15 14:15:25,907 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 248 [2023-02-15 14:15:25,929 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11129 states to 4882 states and 8741 transitions. [2023-02-15 14:15:25,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 330 [2023-02-15 14:15:25,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 575 [2023-02-15 14:15:25,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4882 states and 8741 transitions. [2023-02-15 14:15:25,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:25,931 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4882 states and 8741 transitions. [2023-02-15 14:15:25,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4882 states and 8741 transitions. [2023-02-15 14:15:25,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4882 to 3014. [2023-02-15 14:15:25,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3014 states, 3014 states have (on average 1.813868613138686) internal successors, (5467), 3013 states have internal predecessors, (5467), 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-15 14:15:26,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3014 states to 3014 states and 5467 transitions. [2023-02-15 14:15:26,003 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3014 states and 5467 transitions. [2023-02-15 14:15:26,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:26,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 14:15:26,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2023-02-15 14:15:26,004 INFO L87 Difference]: Start difference. First operand 3014 states and 5467 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 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-15 14:15:26,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:26,054 INFO L93 Difference]: Finished difference Result 3401 states and 6312 transitions. [2023-02-15 14:15:26,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3401 states and 6312 transitions. [2023-02-15 14:15:26,072 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 168 [2023-02-15 14:15:26,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3401 states to 3369 states and 6221 transitions. [2023-02-15 14:15:26,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 238 [2023-02-15 14:15:26,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 238 [2023-02-15 14:15:26,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3369 states and 6221 transitions. [2023-02-15 14:15:26,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:26,088 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3369 states and 6221 transitions. [2023-02-15 14:15:26,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3369 states and 6221 transitions. [2023-02-15 14:15:26,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3369 to 3222. [2023-02-15 14:15:26,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3222 states, 3222 states have (on average 1.8395406579764122) internal successors, (5927), 3221 states have internal predecessors, (5927), 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-15 14:15:26,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3222 states to 3222 states and 5927 transitions. [2023-02-15 14:15:26,131 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3222 states and 5927 transitions. [2023-02-15 14:15:26,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 14:15:26,132 INFO L428 stractBuchiCegarLoop]: Abstraction has 3222 states and 5927 transitions. [2023-02-15 14:15:26,132 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-02-15 14:15:26,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3222 states and 5927 transitions. [2023-02-15 14:15:26,141 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 152 [2023-02-15 14:15:26,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:26,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:26,142 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [19, 17, 17, 9, 9, 1, 1, 1, 1] [2023-02-15 14:15:26,142 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 17, 17, 9, 9, 1, 1] [2023-02-15 14:15:26,143 INFO L748 eck$LassoCheckResult]: Stem: 37491#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 37492#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; 37496#L18-1 assume !!(main_~i~0#1 > 0); 37760#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 37738#L12-2 assume !(10 == main_~i~0#1); 37736#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 37734#L18-1 assume !!(main_~i~0#1 > 0); 37732#L12 assume !(1 == main_~i~0#1); 37730#L12-2 assume !(10 == main_~i~0#1); 37728#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 37726#L18-1 assume !!(main_~i~0#1 > 0); 37724#L12 assume !(1 == main_~i~0#1); 37722#L12-2 assume !(10 == main_~i~0#1); 37720#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 37718#L18-1 assume !!(main_~i~0#1 > 0); 37716#L12 assume !(1 == main_~i~0#1); 37714#L12-2 assume !(10 == main_~i~0#1); 37712#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 37710#L18-1 assume !!(main_~i~0#1 > 0); 37708#L12 assume !(1 == main_~i~0#1); 37706#L12-2 assume !(10 == main_~i~0#1); 37704#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 37702#L18-1 assume !!(main_~i~0#1 > 0); 37700#L12 assume !(1 == main_~i~0#1); 37698#L12-2 assume !(10 == main_~i~0#1); 37696#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 37694#L18-1 assume !!(main_~i~0#1 > 0); 37692#L12 assume !(1 == main_~i~0#1); 37690#L12-2 assume !(10 == main_~i~0#1); 37688#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 37686#L18-1 assume !!(main_~i~0#1 > 0); 37684#L12 assume !(1 == main_~i~0#1); 37682#L12-2 assume !(10 == main_~i~0#1); 37680#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 37678#L18-1 assume !!(main_~i~0#1 > 0); 37666#L12 assume !(1 == main_~i~0#1); 37673#L12-2 assume !(10 == main_~i~0#1); 37669#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 37665#L18-1 assume !!(main_~i~0#1 > 0); 37661#L12 assume !(1 == main_~i~0#1); 37660#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 37606#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 37656#L18-1 assume !!(main_~i~0#1 > 0); 37655#L12 assume !(1 == main_~i~0#1); 37654#L12-2 assume !(10 == main_~i~0#1); 37650#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 37649#L18-1 assume !!(main_~i~0#1 > 0); 37648#L12 assume !(1 == main_~i~0#1); 37647#L12-2 assume !(10 == main_~i~0#1); 37643#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 37642#L18-1 assume !!(main_~i~0#1 > 0); 37641#L12 assume !(1 == main_~i~0#1); 37640#L12-2 assume !(10 == main_~i~0#1); 37636#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 37635#L18-1 assume !!(main_~i~0#1 > 0); 37634#L12 assume !(1 == main_~i~0#1); 37633#L12-2 assume !(10 == main_~i~0#1); 37629#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 37632#L18-1 assume !!(main_~i~0#1 > 0); 38664#L12 assume !(1 == main_~i~0#1); 38661#L12-2 assume !(10 == main_~i~0#1); 38580#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 37624#L18-1 assume !!(main_~i~0#1 > 0); 38569#L12 assume !(1 == main_~i~0#1); 38570#L12-2 assume !(10 == main_~i~0#1); 38561#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 37616#L18-1 assume !!(main_~i~0#1 > 0); 38556#L12 assume !(1 == main_~i~0#1); 38557#L12-2 assume !(10 == main_~i~0#1); 38541#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 37610#L18-1 assume !!(main_~i~0#1 > 0); 38548#L12 assume !(1 == main_~i~0#1); 38657#L12-2 assume !(10 == main_~i~0#1); 38300#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 37604#L18-1 assume !!(main_~i~0#1 > 0); 37504#L12 [2023-02-15 14:15:26,143 INFO L750 eck$LassoCheckResult]: Loop: 37504#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 37482#L12-2 assume !(10 == main_~i~0#1); 37483#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 40653#L18-1 assume !!(main_~i~0#1 > 0); 37497#L12 assume !(1 == main_~i~0#1); 37498#L12-2 assume !(10 == main_~i~0#1); 40698#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 40696#L18-1 assume !!(main_~i~0#1 > 0); 40694#L12 assume !(1 == main_~i~0#1); 40692#L12-2 assume !(10 == main_~i~0#1); 40690#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 40688#L18-1 assume !!(main_~i~0#1 > 0); 40686#L12 assume !(1 == main_~i~0#1); 40684#L12-2 assume !(10 == main_~i~0#1); 40682#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 40680#L18-1 assume !!(main_~i~0#1 > 0); 40678#L12 assume !(1 == main_~i~0#1); 40676#L12-2 assume !(10 == main_~i~0#1); 40674#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 40672#L18-1 assume !!(main_~i~0#1 > 0); 40670#L12 assume !(1 == main_~i~0#1); 40668#L12-2 assume !(10 == main_~i~0#1); 40666#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 40664#L18-1 assume !!(main_~i~0#1 > 0); 40662#L12 assume !(1 == main_~i~0#1); 40660#L12-2 assume !(10 == main_~i~0#1); 40659#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 40657#L18-1 assume !!(main_~i~0#1 > 0); 40656#L12 assume !(1 == main_~i~0#1); 40655#L12-2 assume !(10 == main_~i~0#1); 40654#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 40652#L18-1 assume !!(main_~i~0#1 > 0); 40651#L12 assume !(1 == main_~i~0#1); 40648#L12-2 assume !(10 == main_~i~0#1); 40647#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 40642#L18-1 assume !!(main_~i~0#1 > 0); 40643#L12 assume !(1 == main_~i~0#1); 40646#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 39526#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 40460#L18-1 assume !!(main_~i~0#1 > 0); 40459#L12 assume !(1 == main_~i~0#1); 40458#L12-2 assume !(10 == main_~i~0#1); 40457#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 40456#L18-1 assume !!(main_~i~0#1 > 0); 40455#L12 assume !(1 == main_~i~0#1); 40454#L12-2 assume !(10 == main_~i~0#1); 40453#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 40452#L18-1 assume !!(main_~i~0#1 > 0); 40451#L12 assume !(1 == main_~i~0#1); 40410#L12-2 assume !(10 == main_~i~0#1); 40411#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 40402#L18-1 assume !!(main_~i~0#1 > 0); 40403#L12 assume !(1 == main_~i~0#1); 40389#L12-2 assume !(10 == main_~i~0#1); 40386#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 40383#L18-1 assume !!(main_~i~0#1 > 0); 40384#L12 assume !(1 == main_~i~0#1); 40373#L12-2 assume !(10 == main_~i~0#1); 40369#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 40367#L18-1 assume !!(main_~i~0#1 > 0); 40363#L12 assume !(1 == main_~i~0#1); 40359#L12-2 assume !(10 == main_~i~0#1); 40356#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 40357#L18-1 assume !!(main_~i~0#1 > 0); 40348#L12 assume !(1 == main_~i~0#1); 40345#L12-2 assume !(10 == main_~i~0#1); 40346#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 40342#L18-1 assume !!(main_~i~0#1 > 0); 37506#L12 assume !(1 == main_~i~0#1); 39528#L12-2 assume !(10 == main_~i~0#1); 39529#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 37505#L18-1 assume !!(main_~i~0#1 > 0); 37504#L12 [2023-02-15 14:15:26,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:26,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1568126196, now seen corresponding path program 7 times [2023-02-15 14:15:26,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:26,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202335969] [2023-02-15 14:15:26,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:26,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:26,149 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:26,154 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:26,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:26,154 INFO L85 PathProgramCache]: Analyzing trace with hash 537366349, now seen corresponding path program 4 times [2023-02-15 14:15:26,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:26,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56119154] [2023-02-15 14:15:26,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:26,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:26,159 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:26,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:26,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:26,163 INFO L85 PathProgramCache]: Analyzing trace with hash 758614336, now seen corresponding path program 8 times [2023-02-15 14:15:26,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:26,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220663966] [2023-02-15 14:15:26,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:26,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:26,171 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:26,179 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:26,655 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:26,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.02 02:15:26 BoogieIcfgContainer [2023-02-15 14:15:26,730 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-02-15 14:15:26,730 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 14:15:26,730 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 14:15:26,731 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 14:15:26,731 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:15:17" (3/4) ... [2023-02-15 14:15:26,733 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-02-15 14:15:26,772 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 14:15:26,772 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 14:15:26,772 INFO L158 Benchmark]: Toolchain (without parser) took 9346.94ms. Allocated memory was 144.7MB in the beginning and 209.7MB in the end (delta: 65.0MB). Free memory was 112.6MB in the beginning and 116.1MB in the end (delta: -3.5MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. [2023-02-15 14:15:26,773 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 107.0MB. Free memory is still 61.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 14:15:26,773 INFO L158 Benchmark]: CACSL2BoogieTranslator took 130.30ms. Allocated memory is still 144.7MB. Free memory was 112.3MB in the beginning and 103.2MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-15 14:15:26,773 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.45ms. Allocated memory is still 144.7MB. Free memory was 103.2MB in the beginning and 102.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 14:15:26,773 INFO L158 Benchmark]: Boogie Preprocessor took 11.40ms. Allocated memory is still 144.7MB. Free memory was 102.1MB in the beginning and 101.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 14:15:26,774 INFO L158 Benchmark]: RCFGBuilder took 182.58ms. Allocated memory is still 144.7MB. Free memory was 101.0MB in the beginning and 92.4MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-15 14:15:26,774 INFO L158 Benchmark]: BuchiAutomizer took 8958.32ms. Allocated memory was 144.7MB in the beginning and 209.7MB in the end (delta: 65.0MB). Free memory was 92.4MB in the beginning and 121.4MB in the end (delta: -29.0MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. [2023-02-15 14:15:26,775 INFO L158 Benchmark]: Witness Printer took 41.78ms. Allocated memory is still 209.7MB. Free memory was 120.3MB in the beginning and 116.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-15 14:15:26,776 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.18ms. Allocated memory is still 107.0MB. Free memory is still 61.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 130.30ms. Allocated memory is still 144.7MB. Free memory was 112.3MB in the beginning and 103.2MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.45ms. Allocated memory is still 144.7MB. Free memory was 103.2MB in the beginning and 102.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 11.40ms. Allocated memory is still 144.7MB. Free memory was 102.1MB in the beginning and 101.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 182.58ms. Allocated memory is still 144.7MB. Free memory was 101.0MB in the beginning and 92.4MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 8958.32ms. Allocated memory was 144.7MB in the beginning and 209.7MB in the end (delta: 65.0MB). Free memory was 92.4MB in the beginning and 121.4MB in the end (delta: -29.0MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. * Witness Printer took 41.78ms. Allocated memory is still 209.7MB. Free memory was 120.3MB in the beginning and 116.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 17 terminating modules (9 trivial, 5 deterministic, 3 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i 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 -2 * i + 21 and consists of 5 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function i and consists of 3 locations. One nondeterministic module has affine ranking function i and consists of 3 locations. One nondeterministic module has affine ranking function -2 * i + 9 and consists of 9 locations. One nondeterministic module has affine ranking function -2 * i + 5 and consists of 13 locations. 9 modules have a trivial ranking function, the largest among these consists of 11 locations. The remainder module has 3222 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.8s and 13 iterations. TraceHistogramMax:19. Analysis of lassos took 4.9s. Construction of modules took 0.3s. Büchi inclusion checks took 3.1s. Highest rank in rank-based complementation 5. Minimization of det autom 2. Minimization of nondet autom 15. Automata minimization 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 2653 StatesRemovedByMinimization, 14 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 1, 0, 2]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 570/640 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 420 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 387 mSDsluCounter, 232 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 768 IncrementalHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 201 mSDtfsCounter, 768 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT2 conc0 concLT2 SILN0 SILU0 SILI2 SILT3 lasso1 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax174 hnf100 lsp44 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq188 hnf100 smp90 dnf130 smp95 tf107 neg95 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 98ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 12]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 VAL [up=0] [L11] COND TRUE i > 0 VAL [i=1, up=0] [L12] COND TRUE i == 1 [L13] up = 1 VAL [i=1, up=1] [L15] COND FALSE !(i == 10) VAL [i=1, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=2, up=1] [L11] COND TRUE i > 0 VAL [i=2, up=1] [L12] COND FALSE !(i == 1) VAL [i=2, up=1] [L15] COND FALSE !(i == 10) VAL [i=2, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=3, up=1] [L11] COND TRUE i > 0 VAL [i=3, up=1] [L12] COND FALSE !(i == 1) VAL [i=3, up=1] [L15] COND FALSE !(i == 10) VAL [i=3, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=4, up=1] [L11] COND TRUE i > 0 VAL [i=4, up=1] [L12] COND FALSE !(i == 1) VAL [i=4, up=1] [L15] COND FALSE !(i == 10) VAL [i=4, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=5, up=1] [L11] COND TRUE i > 0 VAL [i=5, up=1] [L12] COND FALSE !(i == 1) VAL [i=5, up=1] [L15] COND FALSE !(i == 10) VAL [i=5, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=6, up=1] [L11] COND TRUE i > 0 VAL [i=6, up=1] [L12] COND FALSE !(i == 1) VAL [i=6, up=1] [L15] COND FALSE !(i == 10) VAL [i=6, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=7, up=1] [L11] COND TRUE i > 0 VAL [i=7, up=1] [L12] COND FALSE !(i == 1) VAL [i=7, up=1] [L15] COND FALSE !(i == 10) VAL [i=7, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=8, up=1] [L11] COND TRUE i > 0 VAL [i=8, up=1] [L12] COND FALSE !(i == 1) VAL [i=8, up=1] [L15] COND FALSE !(i == 10) VAL [i=8, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=9, up=1] [L11] COND TRUE i > 0 VAL [i=9, up=1] [L12] COND FALSE !(i == 1) VAL [i=9, up=1] [L15] COND FALSE !(i == 10) VAL [i=9, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=10, up=1] [L11] COND TRUE i > 0 VAL [i=10, up=1] [L12] COND FALSE !(i == 1) VAL [i=10, up=1] [L15] COND TRUE i == 10 [L16] up = 0 VAL [i=10, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=9, up=0] [L11] COND TRUE i > 0 VAL [i=9, up=0] [L12] COND FALSE !(i == 1) VAL [i=9, up=0] [L15] COND FALSE !(i == 10) VAL [i=9, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=8, up=0] [L11] COND TRUE i > 0 VAL [i=8, up=0] [L12] COND FALSE !(i == 1) VAL [i=8, up=0] [L15] COND FALSE !(i == 10) VAL [i=8, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=7, up=0] [L11] COND TRUE i > 0 VAL [i=7, up=0] [L12] COND FALSE !(i == 1) VAL [i=7, up=0] [L15] COND FALSE !(i == 10) VAL [i=7, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=6, up=0] [L11] COND TRUE i > 0 VAL [i=6, up=0] [L12] COND FALSE !(i == 1) VAL [i=6, up=0] [L15] COND FALSE !(i == 10) VAL [i=6, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=5, up=0] [L11] COND TRUE i > 0 VAL [i=5, up=0] [L12] COND FALSE !(i == 1) VAL [i=5, up=0] [L15] COND FALSE !(i == 10) VAL [i=5, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=4, up=0] [L11] COND TRUE i > 0 VAL [i=4, up=0] [L12] COND FALSE !(i == 1) VAL [i=4, up=0] [L15] COND FALSE !(i == 10) VAL [i=4, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=3, up=0] [L11] COND TRUE i > 0 VAL [i=3, up=0] [L12] COND FALSE !(i == 1) VAL [i=3, up=0] [L15] COND FALSE !(i == 10) VAL [i=3, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=2, up=0] [L11] COND TRUE i > 0 VAL [i=2, up=0] [L12] COND FALSE !(i == 1) VAL [i=2, up=0] [L15] COND FALSE !(i == 10) VAL [i=2, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=1, up=0] [L11] COND TRUE i > 0 VAL [i=1, up=0] Loop: [L12] COND TRUE i == 1 [L13] up = 1 [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 12]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 VAL [up=0] [L11] COND TRUE i > 0 VAL [i=1, up=0] [L12] COND TRUE i == 1 [L13] up = 1 VAL [i=1, up=1] [L15] COND FALSE !(i == 10) VAL [i=1, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=2, up=1] [L11] COND TRUE i > 0 VAL [i=2, up=1] [L12] COND FALSE !(i == 1) VAL [i=2, up=1] [L15] COND FALSE !(i == 10) VAL [i=2, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=3, up=1] [L11] COND TRUE i > 0 VAL [i=3, up=1] [L12] COND FALSE !(i == 1) VAL [i=3, up=1] [L15] COND FALSE !(i == 10) VAL [i=3, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=4, up=1] [L11] COND TRUE i > 0 VAL [i=4, up=1] [L12] COND FALSE !(i == 1) VAL [i=4, up=1] [L15] COND FALSE !(i == 10) VAL [i=4, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=5, up=1] [L11] COND TRUE i > 0 VAL [i=5, up=1] [L12] COND FALSE !(i == 1) VAL [i=5, up=1] [L15] COND FALSE !(i == 10) VAL [i=5, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=6, up=1] [L11] COND TRUE i > 0 VAL [i=6, up=1] [L12] COND FALSE !(i == 1) VAL [i=6, up=1] [L15] COND FALSE !(i == 10) VAL [i=6, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=7, up=1] [L11] COND TRUE i > 0 VAL [i=7, up=1] [L12] COND FALSE !(i == 1) VAL [i=7, up=1] [L15] COND FALSE !(i == 10) VAL [i=7, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=8, up=1] [L11] COND TRUE i > 0 VAL [i=8, up=1] [L12] COND FALSE !(i == 1) VAL [i=8, up=1] [L15] COND FALSE !(i == 10) VAL [i=8, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=9, up=1] [L11] COND TRUE i > 0 VAL [i=9, up=1] [L12] COND FALSE !(i == 1) VAL [i=9, up=1] [L15] COND FALSE !(i == 10) VAL [i=9, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=10, up=1] [L11] COND TRUE i > 0 VAL [i=10, up=1] [L12] COND FALSE !(i == 1) VAL [i=10, up=1] [L15] COND TRUE i == 10 [L16] up = 0 VAL [i=10, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=9, up=0] [L11] COND TRUE i > 0 VAL [i=9, up=0] [L12] COND FALSE !(i == 1) VAL [i=9, up=0] [L15] COND FALSE !(i == 10) VAL [i=9, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=8, up=0] [L11] COND TRUE i > 0 VAL [i=8, up=0] [L12] COND FALSE !(i == 1) VAL [i=8, up=0] [L15] COND FALSE !(i == 10) VAL [i=8, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=7, up=0] [L11] COND TRUE i > 0 VAL [i=7, up=0] [L12] COND FALSE !(i == 1) VAL [i=7, up=0] [L15] COND FALSE !(i == 10) VAL [i=7, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=6, up=0] [L11] COND TRUE i > 0 VAL [i=6, up=0] [L12] COND FALSE !(i == 1) VAL [i=6, up=0] [L15] COND FALSE !(i == 10) VAL [i=6, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=5, up=0] [L11] COND TRUE i > 0 VAL [i=5, up=0] [L12] COND FALSE !(i == 1) VAL [i=5, up=0] [L15] COND FALSE !(i == 10) VAL [i=5, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=4, up=0] [L11] COND TRUE i > 0 VAL [i=4, up=0] [L12] COND FALSE !(i == 1) VAL [i=4, up=0] [L15] COND FALSE !(i == 10) VAL [i=4, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=3, up=0] [L11] COND TRUE i > 0 VAL [i=3, up=0] [L12] COND FALSE !(i == 1) VAL [i=3, up=0] [L15] COND FALSE !(i == 10) VAL [i=3, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=2, up=0] [L11] COND TRUE i > 0 VAL [i=2, up=0] [L12] COND FALSE !(i == 1) VAL [i=2, up=0] [L15] COND FALSE !(i == 10) VAL [i=2, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=1, up=0] [L11] COND TRUE i > 0 VAL [i=1, up=0] Loop: [L12] COND TRUE i == 1 [L13] up = 1 [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-02-15 14:15:26,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:27,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:27,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:27,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:27,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2023-02-15 14:15:27,826 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)