./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 7e1ff0e6 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-?-7e1ff0e [2023-02-15 02:24:49,395 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 02:24:49,396 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 02:24:49,428 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 02:24:49,429 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 02:24:49,431 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 02:24:49,432 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 02:24:49,434 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 02:24:49,435 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 02:24:49,438 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 02:24:49,439 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 02:24:49,441 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 02:24:49,441 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 02:24:49,443 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 02:24:49,444 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 02:24:49,445 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 02:24:49,446 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 02:24:49,447 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 02:24:49,448 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 02:24:49,452 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 02:24:49,453 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 02:24:49,454 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 02:24:49,455 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 02:24:49,456 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 02:24:49,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 02:24:49,462 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 02:24:49,462 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 02:24:49,465 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 02:24:49,465 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 02:24:49,465 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 02:24:49,466 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 02:24:49,466 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 02:24:49,468 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 02:24:49,468 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 02:24:49,469 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 02:24:49,469 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 02:24:49,470 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 02:24:49,470 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 02:24:49,470 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 02:24:49,471 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 02:24:49,472 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 02:24:49,473 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-02-15 02:24:49,498 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 02:24:49,498 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 02:24:49,499 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 02:24:49,499 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 02:24:49,500 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 02:24:49,500 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 02:24:49,500 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 02:24:49,500 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-02-15 02:24:49,500 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-02-15 02:24:49,500 INFO L138 SettingsManager]: * Use old map elimination=false [2023-02-15 02:24:49,501 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2023-02-15 02:24:49,501 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2023-02-15 02:24:49,501 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-02-15 02:24:49,501 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 02:24:49,501 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 02:24:49,501 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 02:24:49,501 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 02:24:49,501 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-02-15 02:24:49,501 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-02-15 02:24:49,502 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-02-15 02:24:49,502 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 02:24:49,502 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-02-15 02:24:49,502 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 02:24:49,502 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-02-15 02:24:49,502 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 02:24:49,502 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 02:24:49,502 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 02:24:49,503 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 02:24:49,503 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-02-15 02:24:49,503 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 02:24:49,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 02:24:49,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 02:24:49,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 02:24:49,687 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 02:24:49,687 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 02:24:49,688 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 02:24:50,834 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 02:24:50,962 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 02:24:50,962 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Ex08.c [2023-02-15 02:24:50,966 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08b4b6324/5cce463d443a4f6cba988b343adcf167/FLAG7ebc956bb [2023-02-15 02:24:50,979 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08b4b6324/5cce463d443a4f6cba988b343adcf167 [2023-02-15 02:24:50,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 02:24:50,982 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 02:24:50,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 02:24:50,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 02:24:50,987 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 02:24:50,987 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 02:24:50" (1/1) ... [2023-02-15 02:24:50,988 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40e65bd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:24:50, skipping insertion in model container [2023-02-15 02:24:50,988 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 02:24:50" (1/1) ... [2023-02-15 02:24:50,993 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 02:24:51,003 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 02:24:51,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 02:24:51,125 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 02:24:51,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 02:24:51,147 INFO L208 MainTranslator]: Completed translation [2023-02-15 02:24:51,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:24:51 WrapperNode [2023-02-15 02:24:51,148 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 02:24:51,149 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 02:24:51,149 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 02:24:51,149 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 02:24:51,155 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:24:51" (1/1) ... [2023-02-15 02:24:51,160 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:24:51" (1/1) ... [2023-02-15 02:24:51,173 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2023-02-15 02:24:51,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 02:24:51,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 02:24:51,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 02:24:51,174 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 02:24:51,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:24:51" (1/1) ... [2023-02-15 02:24:51,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:24:51" (1/1) ... [2023-02-15 02:24:51,182 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:24:51" (1/1) ... [2023-02-15 02:24:51,182 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:24:51" (1/1) ... [2023-02-15 02:24:51,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:24:51" (1/1) ... [2023-02-15 02:24:51,186 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:24:51" (1/1) ... [2023-02-15 02:24:51,186 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:24:51" (1/1) ... [2023-02-15 02:24:51,187 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:24:51" (1/1) ... [2023-02-15 02:24:51,188 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 02:24:51,188 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 02:24:51,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 02:24:51,188 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 02:24:51,189 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:24:51" (1/1) ... [2023-02-15 02:24:51,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:51,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:51,221 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 02:24:51,227 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 02:24:51,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 02:24:51,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 02:24:51,297 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 02:24:51,298 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 02:24:51,351 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 02:24:51,357 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 02:24:51,357 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-15 02:24:51,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:24:51 BoogieIcfgContainer [2023-02-15 02:24:51,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 02:24:51,360 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-02-15 02:24:51,360 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2023-02-15 02:24:51,363 INFO L275 PluginConnector]: BuchiAutomizer initialized [2023-02-15 02:24:51,364 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 02:24:51,364 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.02 02:24:50" (1/3) ... [2023-02-15 02:24:51,365 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3dddab78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.02 02:24:51, skipping insertion in model container [2023-02-15 02:24:51,365 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 02:24:51,365 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:24:51" (2/3) ... [2023-02-15 02:24:51,366 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3dddab78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.02 02:24:51, skipping insertion in model container [2023-02-15 02:24:51,366 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 02:24:51,366 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:24:51" (3/3) ... [2023-02-15 02:24:51,367 INFO L332 chiAutomizerObserver]: Analyzing ICFG Ex08.c [2023-02-15 02:24:51,424 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-02-15 02:24:51,424 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-02-15 02:24:51,424 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-02-15 02:24:51,425 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-02-15 02:24:51,425 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-02-15 02:24:51,425 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-02-15 02:24:51,425 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-02-15 02:24:51,425 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-02-15 02:24:51,429 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 02:24:51,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-15 02:24:51,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 02:24:51,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 02:24:51,449 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-15 02:24:51,449 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 02:24:51,449 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-02-15 02:24:51,450 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 02:24:51,451 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-15 02:24:51,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 02:24:51,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 02:24:51,452 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-15 02:24:51,452 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 02:24:51,459 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 02:24:51,459 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 02:24:51,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:51,471 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-02-15 02:24:51,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:24:51,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383481168] [2023-02-15 02:24:51,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:24:51,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:24:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:24:51,548 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 02:24:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:24:51,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 02:24:51,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:51,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1267244, now seen corresponding path program 1 times [2023-02-15 02:24:51,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:24:51,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913903642] [2023-02-15 02:24:51,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:24:51,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:24:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:51,692 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 02:24:51,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 02:24:51,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913903642] [2023-02-15 02:24:51,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913903642] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 02:24:51,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 02:24:51,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 02:24:51,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043001639] [2023-02-15 02:24:51,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 02:24:51,699 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 02:24:51,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 02:24:51,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 02:24:51,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 02:24:51,731 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 02:24:51,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 02:24:51,749 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2023-02-15 02:24:51,750 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2023-02-15 02:24:51,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-15 02:24:51,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 10 states and 15 transitions. [2023-02-15 02:24:51,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2023-02-15 02:24:51,755 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2023-02-15 02:24:51,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 15 transitions. [2023-02-15 02:24:51,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 02:24:51,756 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 15 transitions. [2023-02-15 02:24:51,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 15 transitions. [2023-02-15 02:24:51,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2023-02-15 02:24:51,778 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 02:24:51,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2023-02-15 02:24:51,779 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 15 transitions. [2023-02-15 02:24:51,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 02:24:51,784 INFO L428 stractBuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2023-02-15 02:24:51,784 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-02-15 02:24:51,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2023-02-15 02:24:51,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-15 02:24:51,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 02:24:51,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 02:24:51,786 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-15 02:24:51,786 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 02:24:51,786 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 02:24:51,791 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 02:24:51,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:51,792 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2023-02-15 02:24:51,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:24:51,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985905542] [2023-02-15 02:24:51,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:24:51,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:24:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:24:51,799 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 02:24:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:24:51,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 02:24:51,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:51,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1265324, now seen corresponding path program 1 times [2023-02-15 02:24:51,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:24:51,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251912169] [2023-02-15 02:24:51,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:24:51,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:24:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:51,856 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 02:24:51,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 02:24:51,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251912169] [2023-02-15 02:24:51,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251912169] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 02:24:51,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 02:24:51,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 02:24:51,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629881088] [2023-02-15 02:24:51,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 02:24:51,858 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 02:24:51,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 02:24:51,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 02:24:51,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 02:24:51,861 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 02:24:51,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 02:24:51,880 INFO L93 Difference]: Finished difference Result 14 states and 21 transitions. [2023-02-15 02:24:51,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 21 transitions. [2023-02-15 02:24:51,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-15 02:24:51,884 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 21 transitions. [2023-02-15 02:24:51,884 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2023-02-15 02:24:51,884 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2023-02-15 02:24:51,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 21 transitions. [2023-02-15 02:24:51,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 02:24:51,885 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 21 transitions. [2023-02-15 02:24:51,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 21 transitions. [2023-02-15 02:24:51,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-02-15 02:24:51,887 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 02:24:51,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2023-02-15 02:24:51,888 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 21 transitions. [2023-02-15 02:24:51,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 02:24:51,889 INFO L428 stractBuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2023-02-15 02:24:51,889 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-02-15 02:24:51,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 21 transitions. [2023-02-15 02:24:51,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-15 02:24:51,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 02:24:51,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 02:24:51,891 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-15 02:24:51,891 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 02:24:51,891 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 02:24:51,892 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 02:24:51,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:51,893 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2023-02-15 02:24:51,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:24:51,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084424396] [2023-02-15 02:24:51,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:24:51,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:24:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:24:51,899 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 02:24:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:24:51,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 02:24:51,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:51,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1267246, now seen corresponding path program 1 times [2023-02-15 02:24:51,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:24:51,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966195932] [2023-02-15 02:24:51,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:24:51,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:24:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:24:51,910 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 02:24:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:24:51,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 02:24:51,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:51,916 INFO L85 PathProgramCache]: Analyzing trace with hash 889694448, now seen corresponding path program 1 times [2023-02-15 02:24:51,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:24:51,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039220918] [2023-02-15 02:24:51,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:24:51,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:24:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:24:51,924 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 02:24:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:24:51,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 02:24:51,984 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 02:24:51,986 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 02:24:51,987 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 02:24:51,987 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 02:24:51,987 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 02:24:51,987 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:51,987 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 02:24:51,988 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 02:24:51,988 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration3_Loop [2023-02-15 02:24:51,988 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 02:24:51,988 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 02:24:52,004 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 02:24:52,023 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 02:24:52,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 02:24:52,039 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 02:24:52,141 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 02:24:52,142 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 02:24:52,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:52,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:52,146 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 02:24:52,148 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 02:24:52,149 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 02:24:52,149 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 02:24:52,169 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 02:24:52,169 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 02:24:52,187 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 02:24:52,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:52,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:52,192 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 02:24:52,194 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 02:24:52,196 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 02:24:52,196 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 02:24:52,211 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 02:24:52,211 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 02:24:52,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-02-15 02:24:52,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:52,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:52,218 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 02:24:52,220 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 02:24:52,221 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 02:24:52,222 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 02:24:52,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-02-15 02:24:52,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:52,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:52,273 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 02:24:52,277 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 02:24:52,279 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 02:24:52,279 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 02:24:52,309 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 02:24:52,327 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 02:24:52,327 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 02:24:52,327 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 02:24:52,327 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 02:24:52,327 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 02:24:52,327 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 02:24:52,327 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:52,328 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 02:24:52,328 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 02:24:52,328 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration3_Loop [2023-02-15 02:24:52,328 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 02:24:52,328 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 02:24:52,329 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 02:24:52,337 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 02:24:52,339 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 02:24:52,343 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 02:24:52,387 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 02:24:52,390 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 02:24:52,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:52,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:52,393 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 02:24:52,395 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 02:24:52,396 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 02:24:52,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 02:24:52,407 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 02:24:52,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 02:24:52,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 02:24:52,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 02:24:52,410 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 02:24:52,410 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 02:24:52,424 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 02:24:52,428 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 02:24:52,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:52,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:52,430 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 02:24:52,431 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 02:24:52,433 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 02:24:52,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 02:24:52,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 02:24:52,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 02:24:52,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 02:24:52,446 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 02:24:52,446 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 02:24:52,459 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 02:24:52,463 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 02:24:52,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:52,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:52,469 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 02:24:52,471 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 02:24:52,472 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 02:24:52,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 02:24:52,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 02:24:52,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 02:24:52,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 02:24:52,482 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 02:24:52,483 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 02:24:52,495 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 02:24:52,502 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 02:24:52,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:52,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:52,504 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 02:24:52,506 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 02:24:52,507 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 02:24:52,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 02:24:52,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 02:24:52,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 02:24:52,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 02:24:52,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 02:24:52,517 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 02:24:52,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 02:24:52,520 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 02:24:52,524 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 02:24:52,524 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 02:24:52,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:52,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:52,582 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 02:24:52,583 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 02:24:52,585 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 02:24:52,585 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 02:24:52,585 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 02:24:52,585 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 02:24:52,593 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 02:24:52,596 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 02:24:52,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:52,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 02:24:52,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:52,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 02:24:52,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:52,664 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 02:24:52,667 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 02:24:52,668 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 02:24:52,708 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 02:24:52,709 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 02:24:52,710 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 02:24:52,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2023-02-15 02:24:52,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2023-02-15 02:24:52,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:24:52,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2023-02-15 02:24:52,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:24:52,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2023-02-15 02:24:52,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:24:52,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 51 transitions. [2023-02-15 02:24:52,714 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2023-02-15 02:24:52,714 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 30 states and 44 transitions. [2023-02-15 02:24:52,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2023-02-15 02:24:52,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2023-02-15 02:24:52,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 44 transitions. [2023-02-15 02:24:52,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 02:24:52,715 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 44 transitions. [2023-02-15 02:24:52,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 44 transitions. [2023-02-15 02:24:52,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2023-02-15 02:24:52,717 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 02:24:52,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2023-02-15 02:24:52,718 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 36 transitions. [2023-02-15 02:24:52,718 INFO L428 stractBuchiCegarLoop]: Abstraction has 25 states and 36 transitions. [2023-02-15 02:24:52,718 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-02-15 02:24:52,718 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 36 transitions. [2023-02-15 02:24:52,719 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2023-02-15 02:24:52,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 02:24:52,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 02:24:52,719 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-02-15 02:24:52,719 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 02:24:52,720 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 02:24:52,720 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 02:24:52,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:52,720 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2023-02-15 02:24:52,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:24:52,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818360221] [2023-02-15 02:24:52,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:24:52,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:24:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:24:52,725 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 02:24:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:24:52,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 02:24:52,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:52,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1422198, now seen corresponding path program 1 times [2023-02-15 02:24:52,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:24:52,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124544719] [2023-02-15 02:24:52,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:24:52,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:24:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:24:52,732 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 02:24:52,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:24:52,734 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 02:24:52,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:52,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1810726045, now seen corresponding path program 1 times [2023-02-15 02:24:52,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:24:52,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502010922] [2023-02-15 02:24:52,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:24:52,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:24:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:24:52,739 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 02:24:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:24:52,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 02:24:52,770 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 02:24:52,770 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 02:24:52,770 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 02:24:52,771 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 02:24:52,771 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 02:24:52,771 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:52,771 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 02:24:52,771 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 02:24:52,771 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration4_Loop [2023-02-15 02:24:52,771 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 02:24:52,771 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 02:24:52,772 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 02:24:52,775 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 02:24:52,781 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 02:24:52,784 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 02:24:52,845 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 02:24:52,845 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 02:24:52,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:52,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:52,846 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 02:24:52,859 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 02:24:52,860 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 02:24:52,860 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 02:24:52,881 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 02:24:52,881 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 02:24:52,885 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 02:24:52,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:52,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:52,886 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 02:24:52,889 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 02:24:52,890 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 02:24:52,890 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 02:24:52,908 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 02:24:52,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:52,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:52,910 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 02:24:52,912 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 02:24:52,913 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 02:24:52,914 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 02:24:52,967 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 02:24:52,972 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 02:24:52,972 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 02:24:52,972 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 02:24:52,972 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 02:24:52,972 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 02:24:52,972 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 02:24:52,972 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:52,973 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 02:24:52,973 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 02:24:52,973 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration4_Loop [2023-02-15 02:24:52,973 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 02:24:52,973 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 02:24:52,974 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 02:24:52,977 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 02:24:52,983 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 02:24:52,986 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 02:24:53,046 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 02:24:53,047 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 02:24:53,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:53,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:53,048 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 02:24:53,065 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 02:24:53,066 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 02:24:53,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 02:24:53,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 02:24:53,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 02:24:53,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 02:24:53,075 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 02:24:53,075 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 02:24:53,093 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 02:24:53,099 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 02:24:53,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:53,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:53,113 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 02:24:53,114 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 02:24:53,118 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 02:24:53,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 02:24:53,124 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 02:24:53,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 02:24:53,125 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-15 02:24:53,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 02:24:53,126 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 02:24:53,126 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 02:24:53,149 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 02:24:53,151 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 02:24:53,151 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 02:24:53,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:53,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:53,169 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 02:24:53,170 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 02:24:53,171 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 02:24:53,171 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 02:24:53,171 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 02:24:53,171 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 02:24:53,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2023-02-15 02:24:53,182 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 02:24:53,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:53,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 02:24:53,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:53,202 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 02:24:53,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:53,249 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 02:24:53,249 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 02:24:53,249 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 02:24:53,294 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 02:24:53,294 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 02:24:53,295 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 02:24:53,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2023-02-15 02:24:53,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 4 letters. [2023-02-15 02:24:53,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:24:53,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 4 letters. [2023-02-15 02:24:53,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:24:53,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 8 letters. [2023-02-15 02:24:53,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:24:53,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 59 transitions. [2023-02-15 02:24:53,297 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-15 02:24:53,298 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 32 states and 49 transitions. [2023-02-15 02:24:53,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2023-02-15 02:24:53,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2023-02-15 02:24:53,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 49 transitions. [2023-02-15 02:24:53,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 02:24:53,298 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2023-02-15 02:24:53,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 49 transitions. [2023-02-15 02:24:53,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-02-15 02:24:53,300 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 02:24:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 49 transitions. [2023-02-15 02:24:53,301 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2023-02-15 02:24:53,301 INFO L428 stractBuchiCegarLoop]: Abstraction has 32 states and 49 transitions. [2023-02-15 02:24:53,301 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-02-15 02:24:53,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 49 transitions. [2023-02-15 02:24:53,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-15 02:24:53,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 02:24:53,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 02:24:53,302 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-02-15 02:24:53,302 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 02:24:53,302 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 02:24:53,302 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 02:24:53,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:53,302 INFO L85 PathProgramCache]: Analyzing trace with hash 889692586, now seen corresponding path program 1 times [2023-02-15 02:24:53,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:24:53,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428239070] [2023-02-15 02:24:53,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:24:53,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:24:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:24:53,312 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 02:24:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:24:53,317 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 02:24:53,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:53,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1267306, now seen corresponding path program 1 times [2023-02-15 02:24:53,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:24:53,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580440638] [2023-02-15 02:24:53,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:24:53,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:24:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:24:53,327 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 02:24:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:24:53,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 02:24:53,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:53,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1068497811, now seen corresponding path program 1 times [2023-02-15 02:24:53,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:24:53,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119821410] [2023-02-15 02:24:53,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:24:53,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:24:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:24:53,337 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 02:24:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:24:53,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 02:24:53,362 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 02:24:53,362 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 02:24:53,363 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 02:24:53,363 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 02:24:53,363 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 02:24:53,363 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:53,363 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 02:24:53,363 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 02:24:53,363 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Loop [2023-02-15 02:24:53,363 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 02:24:53,363 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 02:24:53,370 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 02:24:53,372 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 02:24:53,374 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 02:24:53,382 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 02:24:53,451 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 02:24:53,452 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 02:24:53,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:53,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:53,469 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 02:24:53,522 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 02:24:53,522 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 02:24:53,522 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 02:24:53,535 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 02:24:53,535 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 02:24:53,541 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 02:24:53,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:53,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:53,542 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 02:24:53,544 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 02:24:53,545 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 02:24:53,545 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 02:24:53,566 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 02:24:53,567 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 02:24:53,572 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 02:24:53,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:53,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:53,574 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 02:24:53,576 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 02:24:53,577 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 02:24:53,577 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 02:24:53,620 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 02:24:53,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:53,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:53,637 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 02:24:53,649 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 02:24:53,649 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 02:24:53,650 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 02:24:53,667 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 02:24:53,667 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 02:24:53,687 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 02:24:53,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:53,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:53,688 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 02:24:53,691 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 02:24:53,692 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 02:24:53,692 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 02:24:53,729 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 02:24:53,729 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 02:24:53,735 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 02:24:53,754 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 02:24:53,754 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 02:24:53,754 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 02:24:53,754 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 02:24:53,754 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 02:24:53,754 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:53,754 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 02:24:53,754 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 02:24:53,754 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Lasso [2023-02-15 02:24:53,754 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 02:24:53,754 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 02:24:53,755 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 02:24:53,757 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 02:24:53,762 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 02:24:53,764 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 02:24:53,766 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 02:24:53,768 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 02:24:53,838 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 02:24:53,839 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 02:24:53,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:53,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:53,839 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 02:24:53,849 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 02:24:53,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2023-02-15 02:24:53,855 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 02:24:53,856 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 02:24:53,856 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 02:24:53,870 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 02:24:53,871 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 02:24:53,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2023-02-15 02:24:53,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:53,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:53,875 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 02:24:53,877 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 02:24:53,879 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 02:24:53,879 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 02:24:53,898 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 02:24:53,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:53,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:53,900 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 02:24:53,901 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 02:24:53,903 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 02:24:53,903 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 02:24:53,925 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 02:24:53,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2023-02-15 02:24:53,928 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 02:24:53,928 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 02:24:53,928 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 02:24:53,928 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 02:24:53,929 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 02:24:53,929 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:53,929 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 02:24:53,929 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 02:24:53,929 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Lasso [2023-02-15 02:24:53,929 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 02:24:53,929 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 02:24:53,930 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 02:24:53,931 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 02:24:53,938 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 02:24:53,940 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 02:24:53,941 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 02:24:53,944 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 02:24:54,017 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 02:24:54,017 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 02:24:54,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:54,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:54,019 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 02:24:54,021 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 02:24:54,022 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 02:24:54,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 02:24:54,029 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 02:24:54,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 02:24:54,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 02:24:54,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 02:24:54,029 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 02:24:54,029 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 02:24:54,043 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 02:24:54,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2023-02-15 02:24:54,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:54,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:54,048 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 02:24:54,049 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 02:24:54,051 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 02:24:54,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 02:24:54,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 02:24:54,057 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-15 02:24:54,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 02:24:54,062 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-02-15 02:24:54,063 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-02-15 02:24:54,079 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 02:24:54,095 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2023-02-15 02:24:54,095 INFO L444 ModelExtractionUtils]: 0 out of 11 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-02-15 02:24:54,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:54,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:54,096 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 02:24:54,098 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 02:24:54,100 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 02:24:54,122 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2023-02-15 02:24:54,122 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 02:24:54,122 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 02:24:54,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2023-02-15 02:24:54,128 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2023-02-15 02:24:54,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:54,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 02:24:54,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:54,168 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 02:24:54,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:54,189 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 02:24:54,189 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 02:24:54,190 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 02:24:54,234 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 02:24:54,234 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 02:24:54,235 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 02:24:54,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2023-02-15 02:24:54,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. [2023-02-15 02:24:54,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:24:54,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 10 letters. Loop has 4 letters. [2023-02-15 02:24:54,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:24:54,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 6 letters. Loop has 8 letters. [2023-02-15 02:24:54,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:24:54,236 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 68 transitions. [2023-02-15 02:24:54,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-15 02:24:54,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 67 transitions. [2023-02-15 02:24:54,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2023-02-15 02:24:54,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2023-02-15 02:24:54,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 67 transitions. [2023-02-15 02:24:54,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 02:24:54,239 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 67 transitions. [2023-02-15 02:24:54,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 67 transitions. [2023-02-15 02:24:54,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2023-02-15 02:24:54,242 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 02:24:54,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 64 transitions. [2023-02-15 02:24:54,242 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 64 transitions. [2023-02-15 02:24:54,242 INFO L428 stractBuchiCegarLoop]: Abstraction has 42 states and 64 transitions. [2023-02-15 02:24:54,242 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-02-15 02:24:54,242 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 64 transitions. [2023-02-15 02:24:54,243 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-15 02:24:54,243 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 02:24:54,243 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 02:24:54,243 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 02:24:54,243 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 02:24:54,244 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 02:24:54,244 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 02:24:54,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:54,244 INFO L85 PathProgramCache]: Analyzing trace with hash 588656997, now seen corresponding path program 1 times [2023-02-15 02:24:54,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:24:54,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583123244] [2023-02-15 02:24:54,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:24:54,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:24:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:54,275 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 02:24:54,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 02:24:54,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583123244] [2023-02-15 02:24:54,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583123244] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 02:24:54,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383051942] [2023-02-15 02:24:54,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:24:54,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 02:24:54,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:54,279 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 02:24:54,281 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 02:24:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:54,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 02:24:54,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:54,308 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 02:24:54,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 02:24:54,326 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 02:24:54,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383051942] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 02:24:54,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 02:24:54,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-02-15 02:24:54,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546103948] [2023-02-15 02:24:54,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 02:24:54,328 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 02:24:54,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:54,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1768756, now seen corresponding path program 2 times [2023-02-15 02:24:54,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:24:54,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404849528] [2023-02-15 02:24:54,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:24:54,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:24:54,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:24:54,331 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 02:24:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:24:54,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 02:24:54,352 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 02:24:54,352 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 02:24:54,352 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 02:24:54,352 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 02:24:54,352 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 02:24:54,352 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:54,352 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 02:24:54,352 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 02:24:54,352 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration6_Loop [2023-02-15 02:24:54,353 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 02:24:54,353 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 02:24:54,353 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 02:24:54,357 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 02:24:54,360 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 02:24:54,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 02:24:54,394 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 02:24:54,394 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 02:24:54,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:54,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:54,413 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 02:24:54,465 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 02:24:54,466 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 02:24:54,466 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 02:24:54,502 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 02:24:54,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:54,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:54,518 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 02:24:54,520 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 02:24:54,522 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 02:24:54,522 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 02:24:54,603 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 02:24:54,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2023-02-15 02:24:54,607 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 02:24:54,607 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 02:24:54,607 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 02:24:54,608 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 02:24:54,608 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 02:24:54,608 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:54,608 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 02:24:54,608 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 02:24:54,608 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration6_Loop [2023-02-15 02:24:54,608 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 02:24:54,608 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 02:24:54,609 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 02:24:54,613 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 02:24:54,617 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 02:24:54,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 02:24:54,663 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 02:24:54,663 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 02:24:54,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:54,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:54,665 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 02:24:54,693 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 02:24:54,694 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 02:24:54,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 02:24:54,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 02:24:54,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 02:24:54,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 02:24:54,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 02:24:54,702 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 02:24:54,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 02:24:54,725 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 02:24:54,727 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 02:24:54,727 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 02:24:54,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:54,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:54,740 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 02:24:54,741 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 02:24:54,742 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 02:24:54,742 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 02:24:54,742 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 02:24:54,742 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 02:24:54,747 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 02:24:54,752 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 02:24:54,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:54,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 02:24:54,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:54,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 02:24:54,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:54,804 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 02:24:54,804 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 02:24:54,805 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 02:24:54,840 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 02:24:54,843 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 02:24:54,843 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 02:24:54,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2023-02-15 02:24:54,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2023-02-15 02:24:54,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:24:54,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 13 letters. Loop has 4 letters. [2023-02-15 02:24:54,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:24:54,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 8 letters. [2023-02-15 02:24:54,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:24:54,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 160 transitions. [2023-02-15 02:24:54,846 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2023-02-15 02:24:54,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 87 states and 133 transitions. [2023-02-15 02:24:54,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2023-02-15 02:24:54,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2023-02-15 02:24:54,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 133 transitions. [2023-02-15 02:24:54,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 02:24:54,847 INFO L218 hiAutomatonCegarLoop]: Abstraction has 87 states and 133 transitions. [2023-02-15 02:24:54,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 133 transitions. [2023-02-15 02:24:54,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2023-02-15 02:24:54,855 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 02:24:54,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 127 transitions. [2023-02-15 02:24:54,856 INFO L240 hiAutomatonCegarLoop]: Abstraction has 82 states and 127 transitions. [2023-02-15 02:24:54,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 02:24:54,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 02:24:54,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-02-15 02:24:54,856 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 02:24:54,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 02:24:54,906 INFO L93 Difference]: Finished difference Result 160 states and 239 transitions. [2023-02-15 02:24:54,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 239 transitions. [2023-02-15 02:24:54,907 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2023-02-15 02:24:54,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 160 states and 239 transitions. [2023-02-15 02:24:54,909 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2023-02-15 02:24:54,909 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2023-02-15 02:24:54,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 160 states and 239 transitions. [2023-02-15 02:24:54,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 02:24:54,909 INFO L218 hiAutomatonCegarLoop]: Abstraction has 160 states and 239 transitions. [2023-02-15 02:24:54,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states and 239 transitions. [2023-02-15 02:24:54,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 136. [2023-02-15 02:24:54,920 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 02:24:54,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 207 transitions. [2023-02-15 02:24:54,920 INFO L240 hiAutomatonCegarLoop]: Abstraction has 136 states and 207 transitions. [2023-02-15 02:24:54,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 02:24:54,939 INFO L428 stractBuchiCegarLoop]: Abstraction has 136 states and 207 transitions. [2023-02-15 02:24:54,939 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-02-15 02:24:54,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 207 transitions. [2023-02-15 02:24:54,942 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2023-02-15 02:24:54,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 02:24:54,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 02:24:54,943 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2023-02-15 02:24:54,943 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 02:24:54,943 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 02:24:54,943 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 02:24:54,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:54,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1068495891, now seen corresponding path program 1 times [2023-02-15 02:24:54,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:24:54,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847102974] [2023-02-15 02:24:54,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:24:54,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:24:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:54,981 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 02:24:54,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 02:24:54,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847102974] [2023-02-15 02:24:54,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847102974] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 02:24:54,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 02:24:54,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 02:24:54,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915716071] [2023-02-15 02:24:54,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 02:24:54,984 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 02:24:54,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:54,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1267308, now seen corresponding path program 2 times [2023-02-15 02:24:54,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:24:54,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037277980] [2023-02-15 02:24:54,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:24:54,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:24:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:24:54,988 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 02:24:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:24:54,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 02:24:55,008 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 02:24:55,009 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 02:24:55,009 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 02:24:55,009 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 02:24:55,009 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 02:24:55,009 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:55,009 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 02:24:55,009 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 02:24:55,009 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration7_Loop [2023-02-15 02:24:55,009 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 02:24:55,009 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 02:24:55,010 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 02:24:55,015 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 02:24:55,016 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 02:24:55,018 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 02:24:55,084 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 02:24:55,084 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 02:24:55,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:55,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:55,087 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 02:24:55,088 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 02:24:55,089 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 02:24:55,089 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 02:24:55,111 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 02:24:55,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:55,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:55,112 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 02:24:55,114 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 02:24:55,115 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 02:24:55,115 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 02:24:55,141 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 02:24:55,144 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 02:24:55,144 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 02:24:55,144 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 02:24:55,144 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 02:24:55,144 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 02:24:55,144 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 02:24:55,144 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:55,144 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 02:24:55,144 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 02:24:55,144 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration7_Loop [2023-02-15 02:24:55,144 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 02:24:55,144 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 02:24:55,145 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 02:24:55,151 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 02:24:55,152 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 02:24:55,154 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 02:24:55,213 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 02:24:55,213 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 02:24:55,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:55,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:55,215 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 02:24:55,217 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 02:24:55,218 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 02:24:55,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 02:24:55,225 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 02:24:55,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 02:24:55,225 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-15 02:24:55,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 02:24:55,227 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 02:24:55,227 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 02:24:55,242 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 02:24:55,244 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 02:24:55,244 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 02:24:55,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:55,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:55,247 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 02:24:55,248 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 02:24:55,249 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 02:24:55,249 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 02:24:55,249 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 02:24:55,249 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 02:24:55,254 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 02:24:55,254 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 02:24:55,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:55,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 02:24:55,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:55,278 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 02:24:55,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:55,291 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 02:24:55,292 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 02:24:55,292 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 02:24:55,306 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 02:24:55,306 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 02:24:55,307 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 02:24:55,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2023-02-15 02:24:55,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 4 letters. [2023-02-15 02:24:55,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:24:55,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 4 letters. [2023-02-15 02:24:55,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:24:55,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 8 letters. [2023-02-15 02:24:55,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:24:55,308 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 248 states and 381 transitions. [2023-02-15 02:24:55,311 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2023-02-15 02:24:55,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 248 states to 224 states and 333 transitions. [2023-02-15 02:24:55,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2023-02-15 02:24:55,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112 [2023-02-15 02:24:55,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 224 states and 333 transitions. [2023-02-15 02:24:55,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 02:24:55,312 INFO L218 hiAutomatonCegarLoop]: Abstraction has 224 states and 333 transitions. [2023-02-15 02:24:55,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states and 333 transitions. [2023-02-15 02:24:55,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 202. [2023-02-15 02:24:55,320 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 02:24:55,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 304 transitions. [2023-02-15 02:24:55,320 INFO L240 hiAutomatonCegarLoop]: Abstraction has 202 states and 304 transitions. [2023-02-15 02:24:55,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 02:24:55,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 02:24:55,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 02:24:55,321 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 02:24:55,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 02:24:55,334 INFO L93 Difference]: Finished difference Result 230 states and 313 transitions. [2023-02-15 02:24:55,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 230 states and 313 transitions. [2023-02-15 02:24:55,335 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2023-02-15 02:24:55,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 230 states to 230 states and 313 transitions. [2023-02-15 02:24:55,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2023-02-15 02:24:55,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2023-02-15 02:24:55,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 230 states and 313 transitions. [2023-02-15 02:24:55,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 02:24:55,337 INFO L218 hiAutomatonCegarLoop]: Abstraction has 230 states and 313 transitions. [2023-02-15 02:24:55,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states and 313 transitions. [2023-02-15 02:24:55,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 201. [2023-02-15 02:24:55,341 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 02:24:55,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 278 transitions. [2023-02-15 02:24:55,341 INFO L240 hiAutomatonCegarLoop]: Abstraction has 201 states and 278 transitions. [2023-02-15 02:24:55,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 02:24:55,342 INFO L428 stractBuchiCegarLoop]: Abstraction has 201 states and 278 transitions. [2023-02-15 02:24:55,342 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-02-15 02:24:55,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 201 states and 278 transitions. [2023-02-15 02:24:55,343 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2023-02-15 02:24:55,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 02:24:55,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 02:24:55,343 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2023-02-15 02:24:55,343 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 02:24:55,343 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 02:24:55,343 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 02:24:55,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:55,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1454758974, now seen corresponding path program 1 times [2023-02-15 02:24:55,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:24:55,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935845173] [2023-02-15 02:24:55,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:24:55,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:24:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:55,363 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 02:24:55,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 02:24:55,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935845173] [2023-02-15 02:24:55,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935845173] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 02:24:55,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 02:24:55,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 02:24:55,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071416163] [2023-02-15 02:24:55,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 02:24:55,363 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 02:24:55,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:55,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1267308, now seen corresponding path program 3 times [2023-02-15 02:24:55,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:24:55,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122370802] [2023-02-15 02:24:55,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:24:55,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:24:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:24:55,365 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 02:24:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:24:55,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 02:24:55,382 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 02:24:55,382 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 02:24:55,383 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 02:24:55,383 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 02:24:55,383 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 02:24:55,383 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:55,383 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 02:24:55,383 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 02:24:55,383 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration8_Loop [2023-02-15 02:24:55,383 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 02:24:55,383 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 02:24:55,383 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 02:24:55,385 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 02:24:55,387 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 02:24:55,388 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 02:24:55,444 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 02:24:55,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2023-02-15 02:24:55,446 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 02:24:55,461 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 02:24:55,462 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 02:24:55,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:55,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:55,464 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 02:24:55,465 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 02:24:55,466 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 02:24:55,466 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 02:24:55,490 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 02:24:55,490 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 02:24:55,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2023-02-15 02:24:55,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:55,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:55,497 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 02:24:55,498 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 02:24:55,500 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 02:24:55,500 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 02:24:55,511 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 02:24:55,511 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 02:24:55,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2023-02-15 02:24:55,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:55,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:55,517 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 02:24:55,520 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 02:24:55,520 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 02:24:55,520 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 02:24:55,531 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 02:24:55,531 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 02:24:55,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2023-02-15 02:24:55,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:55,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:55,535 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 02:24:55,538 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 02:24:55,538 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 02:24:55,538 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 02:24:55,547 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 02:24:55,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:55,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:55,548 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 02:24:55,549 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 02:24:55,559 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 02:24:55,559 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 02:24:55,572 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 02:24:55,577 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 02:24:55,578 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 02:24:55,578 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 02:24:55,578 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 02:24:55,578 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 02:24:55,578 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 02:24:55,578 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:55,578 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 02:24:55,578 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 02:24:55,578 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration8_Loop [2023-02-15 02:24:55,578 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 02:24:55,578 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 02:24:55,579 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 02:24:55,582 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 02:24:55,584 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 02:24:55,586 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 02:24:55,642 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 02:24:55,642 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 02:24:55,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:55,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:55,643 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 02:24:55,645 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 02:24:55,646 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 02:24:55,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 02:24:55,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 02:24:55,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 02:24:55,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 02:24:55,653 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 02:24:55,653 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 02:24:55,668 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 02:24:55,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2023-02-15 02:24:55,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:55,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:55,707 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 02:24:55,708 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 02:24:55,716 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 02:24:55,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 02:24:55,722 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 02:24:55,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 02:24:55,722 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-15 02:24:55,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 02:24:55,723 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 02:24:55,723 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 02:24:55,724 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 02:24:55,727 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 02:24:55,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:55,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:55,729 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 02:24:55,739 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 02:24:55,740 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 02:24:55,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 02:24:55,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 02:24:55,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 02:24:55,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 02:24:55,748 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 02:24:55,748 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 02:24:55,751 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 02:24:55,753 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 02:24:55,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:55,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:55,755 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 02:24:55,755 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 02:24:55,758 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 02:24:55,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 02:24:55,764 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 02:24:55,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 02:24:55,764 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-15 02:24:55,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 02:24:55,774 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-15 02:24:55,774 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 02:24:55,792 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 02:24:55,803 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-02-15 02:24:55,803 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 02:24:55,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:55,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:55,821 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 02:24:55,824 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 02:24:55,824 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 02:24:55,825 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 02:24:55,825 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 02:24:55,825 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 02:24:55,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2023-02-15 02:24:55,829 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 02:24:55,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:55,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 02:24:55,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:55,876 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 02:24:55,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:55,896 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 02:24:55,897 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 02:24:55,897 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 02:24:55,918 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 02:24:55,918 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 02:24:55,919 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 02:24:55,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2023-02-15 02:24:55,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 4 letters. [2023-02-15 02:24:55,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:24:55,920 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 02:24:55,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:55,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:55,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 02:24:55,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:55,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:55,960 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 02:24:55,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:55,974 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 02:24:55,974 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 02:24:55,975 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 02:24:55,986 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 02:24:55,986 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 02:24:55,987 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 02:24:55,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2023-02-15 02:24:55,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 4 letters. [2023-02-15 02:24:55,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:24:55,987 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 02:24:55,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:56,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 02:24:56,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:56,014 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 02:24:56,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:56,027 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 02:24:56,028 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 02:24:56,028 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 02:24:56,041 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 02:24:56,057 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 02:24:56,058 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 02:24:56,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2023-02-15 02:24:56,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2023-02-15 02:24:56,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:24:56,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 18 letters. Loop has 4 letters. [2023-02-15 02:24:56,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:24:56,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 8 letters. [2023-02-15 02:24:56,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:24:56,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 334 states and 496 transitions. [2023-02-15 02:24:56,062 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2023-02-15 02:24:56,064 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 334 states to 268 states and 378 transitions. [2023-02-15 02:24:56,064 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2023-02-15 02:24:56,064 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2023-02-15 02:24:56,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 268 states and 378 transitions. [2023-02-15 02:24:56,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 02:24:56,064 INFO L218 hiAutomatonCegarLoop]: Abstraction has 268 states and 378 transitions. [2023-02-15 02:24:56,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states and 378 transitions. [2023-02-15 02:24:56,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 167. [2023-02-15 02:24:56,068 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 02:24:56,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 234 transitions. [2023-02-15 02:24:56,069 INFO L240 hiAutomatonCegarLoop]: Abstraction has 167 states and 234 transitions. [2023-02-15 02:24:56,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 02:24:56,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 02:24:56,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 02:24:56,070 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 02:24:56,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 02:24:56,100 INFO L93 Difference]: Finished difference Result 179 states and 246 transitions. [2023-02-15 02:24:56,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 179 states and 246 transitions. [2023-02-15 02:24:56,101 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 92 [2023-02-15 02:24:56,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 179 states to 177 states and 243 transitions. [2023-02-15 02:24:56,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2023-02-15 02:24:56,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 93 [2023-02-15 02:24:56,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 177 states and 243 transitions. [2023-02-15 02:24:56,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 02:24:56,103 INFO L218 hiAutomatonCegarLoop]: Abstraction has 177 states and 243 transitions. [2023-02-15 02:24:56,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states and 243 transitions. [2023-02-15 02:24:56,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 170. [2023-02-15 02:24:56,105 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 02:24:56,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 234 transitions. [2023-02-15 02:24:56,106 INFO L240 hiAutomatonCegarLoop]: Abstraction has 170 states and 234 transitions. [2023-02-15 02:24:56,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 02:24:56,107 INFO L428 stractBuchiCegarLoop]: Abstraction has 170 states and 234 transitions. [2023-02-15 02:24:56,107 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-02-15 02:24:56,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 170 states and 234 transitions. [2023-02-15 02:24:56,108 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 90 [2023-02-15 02:24:56,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 02:24:56,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 02:24:56,109 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2023-02-15 02:24:56,109 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1] [2023-02-15 02:24:56,125 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 02:24:56,125 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 02:24:56,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:56,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1068497813, now seen corresponding path program 1 times [2023-02-15 02:24:56,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:24:56,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903731140] [2023-02-15 02:24:56,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:24:56,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:24:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:56,138 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 02:24:56,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 02:24:56,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903731140] [2023-02-15 02:24:56,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903731140] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 02:24:56,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 02:24:56,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 02:24:56,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720795635] [2023-02-15 02:24:56,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 02:24:56,139 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 02:24:56,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:56,139 INFO L85 PathProgramCache]: Analyzing trace with hash -2142023595, now seen corresponding path program 1 times [2023-02-15 02:24:56,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:24:56,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295653386] [2023-02-15 02:24:56,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:24:56,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:24:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:56,152 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 02:24:56,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 02:24:56,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295653386] [2023-02-15 02:24:56,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295653386] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 02:24:56,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 02:24:56,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 02:24:56,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244805431] [2023-02-15 02:24:56,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 02:24:56,153 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 02:24:56,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 02:24:56,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 02:24:56,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 02:24:56,153 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 02:24:56,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 02:24:56,158 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2023-02-15 02:24:56,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 118 transitions. [2023-02-15 02:24:56,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2023-02-15 02:24:56,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 84 states and 95 transitions. [2023-02-15 02:24:56,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2023-02-15 02:24:56,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2023-02-15 02:24:56,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 95 transitions. [2023-02-15 02:24:56,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 02:24:56,159 INFO L218 hiAutomatonCegarLoop]: Abstraction has 84 states and 95 transitions. [2023-02-15 02:24:56,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 95 transitions. [2023-02-15 02:24:56,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2023-02-15 02:24:56,160 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 02:24:56,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2023-02-15 02:24:56,161 INFO L240 hiAutomatonCegarLoop]: Abstraction has 82 states and 93 transitions. [2023-02-15 02:24:56,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 02:24:56,161 INFO L428 stractBuchiCegarLoop]: Abstraction has 82 states and 93 transitions. [2023-02-15 02:24:56,161 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-02-15 02:24:56,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 93 transitions. [2023-02-15 02:24:56,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2023-02-15 02:24:56,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 02:24:56,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 02:24:56,163 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 5, 4, 2, 1, 1, 1, 1] [2023-02-15 02:24:56,163 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 5, 5, 4, 2, 1, 1] [2023-02-15 02:24:56,163 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 02:24:56,163 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 02:24:56,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:56,164 INFO L85 PathProgramCache]: Analyzing trace with hash -608617554, now seen corresponding path program 2 times [2023-02-15 02:24:56,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:24:56,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641626329] [2023-02-15 02:24:56,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:24:56,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:24:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:56,244 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 02:24:56,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 02:24:56,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641626329] [2023-02-15 02:24:56,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641626329] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 02:24:56,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903348212] [2023-02-15 02:24:56,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 02:24:56,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 02:24:56,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:56,259 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 02:24:56,260 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 02:24:56,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 02:24:56,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 02:24:56,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 02:24:56,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:56,304 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 02:24:56,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 02:24:56,358 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 02:24:56,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903348212] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 02:24:56,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 02:24:56,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-15 02:24:56,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749690146] [2023-02-15 02:24:56,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 02:24:56,359 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 02:24:56,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:56,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1118663673, now seen corresponding path program 1 times [2023-02-15 02:24:56,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:24:56,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498537804] [2023-02-15 02:24:56,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:24:56,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:24:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:56,419 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 02:24:56,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 02:24:56,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498537804] [2023-02-15 02:24:56,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498537804] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 02:24:56,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635427469] [2023-02-15 02:24:56,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:24:56,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 02:24:56,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:56,421 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 02:24:56,430 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 02:24:56,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:56,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 02:24:56,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:56,480 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 02:24:56,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 02:24:56,549 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 02:24:56,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635427469] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 02:24:56,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 02:24:56,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2023-02-15 02:24:56,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513960058] [2023-02-15 02:24:56,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 02:24:56,552 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 02:24:56,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 02:24:56,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 02:24:56,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2023-02-15 02:24:56,553 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 02:24:56,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 02:24:56,600 INFO L93 Difference]: Finished difference Result 169 states and 180 transitions. [2023-02-15 02:24:56,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 180 transitions. [2023-02-15 02:24:56,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2023-02-15 02:24:56,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 149 states and 160 transitions. [2023-02-15 02:24:56,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2023-02-15 02:24:56,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2023-02-15 02:24:56,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 160 transitions. [2023-02-15 02:24:56,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 02:24:56,603 INFO L218 hiAutomatonCegarLoop]: Abstraction has 149 states and 160 transitions. [2023-02-15 02:24:56,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 160 transitions. [2023-02-15 02:24:56,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 142. [2023-02-15 02:24:56,605 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 02:24:56,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2023-02-15 02:24:56,606 INFO L240 hiAutomatonCegarLoop]: Abstraction has 142 states and 153 transitions. [2023-02-15 02:24:56,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 02:24:56,607 INFO L428 stractBuchiCegarLoop]: Abstraction has 142 states and 153 transitions. [2023-02-15 02:24:56,607 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-02-15 02:24:56,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 153 transitions. [2023-02-15 02:24:56,608 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 46 [2023-02-15 02:24:56,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 02:24:56,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 02:24:56,612 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 10, 10, 9, 2, 1, 1, 1, 1] [2023-02-15 02:24:56,612 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [11, 10, 10, 9, 2, 1, 1] [2023-02-15 02:24:56,612 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 02:24:56,614 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 02:24:56,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:56,614 INFO L85 PathProgramCache]: Analyzing trace with hash -733322943, now seen corresponding path program 3 times [2023-02-15 02:24:56,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:24:56,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660957672] [2023-02-15 02:24:56,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:24:56,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:24:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:24:56,633 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 02:24:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:24:56,648 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 02:24:56,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:56,649 INFO L85 PathProgramCache]: Analyzing trace with hash 491326234, now seen corresponding path program 2 times [2023-02-15 02:24:56,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:24:56,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668764003] [2023-02-15 02:24:56,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:24:56,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:24:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:24:56,656 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 02:24:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:24:56,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 02:24:56,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:56,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1133081510, now seen corresponding path program 4 times [2023-02-15 02:24:56,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:24:56,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276199428] [2023-02-15 02:24:56,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:24:56,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:24:56,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:56,751 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 02:24:56,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 02:24:56,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276199428] [2023-02-15 02:24:56,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276199428] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 02:24:56,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115057659] [2023-02-15 02:24:56,751 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 02:24:56,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 02:24:56,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:56,753 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 02:24:56,766 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 02:24:56,792 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 02:24:56,808 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 02:24:56,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 02:24:56,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 02:24:56,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:56,830 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 02:24:56,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 02:24:56,853 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 02:24:56,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115057659] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 02:24:56,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 02:24:56,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-02-15 02:24:56,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647594003] [2023-02-15 02:24:56,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 02:24:56,991 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 02:24:56,991 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 02:24:56,991 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 02:24:56,992 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 02:24:56,992 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 02:24:56,992 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:56,992 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 02:24:56,992 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 02:24:56,992 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration11_Loop [2023-02-15 02:24:56,992 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 02:24:56,992 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 02:24:56,993 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 02:24:56,997 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 02:24:56,999 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 02:24:57,001 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 02:24:57,031 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 02:24:57,031 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 02:24:57,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:57,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:57,032 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 02:24:57,035 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 02:24:57,036 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 02:24:57,036 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 02:24:57,059 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 02:24:57,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:57,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:57,061 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 02:24:57,066 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 02:24:57,066 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 02:24:57,066 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 02:24:57,074 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 02:24:57,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2023-02-15 02:24:57,077 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 02:24:57,077 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 02:24:57,077 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 02:24:57,077 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 02:24:57,077 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 02:24:57,077 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:57,077 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 02:24:57,077 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 02:24:57,077 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration11_Loop [2023-02-15 02:24:57,077 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 02:24:57,077 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 02:24:57,078 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 02:24:57,090 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 02:24:57,093 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 02:24:57,095 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 02:24:57,123 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 02:24:57,123 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 02:24:57,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:57,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:57,124 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 02:24:57,133 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 02:24:57,134 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 02:24:57,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 02:24:57,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 02:24:57,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 02:24:57,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 02:24:57,142 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 02:24:57,142 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 02:24:57,144 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 02:24:57,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2023-02-15 02:24:57,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:57,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:57,148 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 02:24:57,150 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 02:24:57,151 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 02:24:57,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 02:24:57,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 02:24:57,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 02:24:57,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 02:24:57,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 02:24:57,158 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 02:24:57,158 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 02:24:57,164 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 02:24:57,168 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 02:24:57,168 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 02:24:57,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:57,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:57,170 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 02:24:57,171 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 02:24:57,172 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 02:24:57,172 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 02:24:57,172 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 02:24:57,172 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 02:24:57,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2023-02-15 02:24:57,175 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 02:24:57,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:57,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:57,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 02:24:57,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:57,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 02:24:57,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:57,328 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 02:24:57,328 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 02:24:57,328 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 02:24:57,353 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 02:24:57,354 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 02:24:57,354 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 02:24:57,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2023-02-15 02:24:57,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 47 letters. Loop has 44 letters. [2023-02-15 02:24:57,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:24:57,354 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 02:24:57,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:57,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 02:24:57,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:57,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 02:24:57,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:57,518 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 02:24:57,519 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 02:24:57,519 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 02:24:57,565 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 02:24:57,565 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 02:24:57,566 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 02:24:57,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2023-02-15 02:24:57,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 47 letters. Loop has 44 letters. [2023-02-15 02:24:57,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:24:57,566 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 02:24:57,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:57,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 02:24:57,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:57,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 02:24:57,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:57,723 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 02:24:57,724 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 02:24:57,724 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 02:24:57,748 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 02:24:57,748 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 02:24:57,748 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 02:24:57,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2023-02-15 02:24:57,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 47 letters. Loop has 44 letters. [2023-02-15 02:24:57,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:24:57,750 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 02:24:57,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:57,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 02:24:57,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:57,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 02:24:57,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:57,885 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 02:24:57,926 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 02:24:57,927 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 02:24:57,927 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 02:24:57,975 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 02:24:57,975 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 02:24:57,975 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 02:24:57,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2023-02-15 02:24:57,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 47 letters. Loop has 44 letters. [2023-02-15 02:24:57,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:24:57,976 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 02:24:57,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:57,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 02:24:57,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:58,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 02:24:58,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:58,130 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 02:24:58,131 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 02:24:58,131 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 02:24:58,325 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 02:24:58,325 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 02:24:58,325 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 02:24:58,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2023-02-15 02:24:58,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 70 transitions. Stem has 47 letters. Loop has 44 letters. [2023-02-15 02:24:58,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:24:58,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 70 transitions. Stem has 91 letters. Loop has 44 letters. [2023-02-15 02:24:58,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:24:58,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 70 transitions. Stem has 47 letters. Loop has 88 letters. [2023-02-15 02:24:58,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:24:58,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1899 states and 2480 transitions. [2023-02-15 02:24:58,347 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 96 [2023-02-15 02:24:58,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1899 states to 956 states and 1245 transitions. [2023-02-15 02:24:58,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2023-02-15 02:24:58,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 224 [2023-02-15 02:24:58,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 956 states and 1245 transitions. [2023-02-15 02:24:58,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 02:24:58,351 INFO L218 hiAutomatonCegarLoop]: Abstraction has 956 states and 1245 transitions. [2023-02-15 02:24:58,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states and 1245 transitions. [2023-02-15 02:24:58,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 564. [2023-02-15 02:24:58,357 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 02:24:58,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 787 transitions. [2023-02-15 02:24:58,359 INFO L240 hiAutomatonCegarLoop]: Abstraction has 564 states and 787 transitions. [2023-02-15 02:24:58,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 02:24:58,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 02:24:58,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2023-02-15 02:24:58,359 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 02:24:58,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 02:24:58,392 INFO L93 Difference]: Finished difference Result 692 states and 978 transitions. [2023-02-15 02:24:58,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 692 states and 978 transitions. [2023-02-15 02:24:58,395 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 98 [2023-02-15 02:24:58,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 692 states to 675 states and 954 transitions. [2023-02-15 02:24:58,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2023-02-15 02:24:58,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2023-02-15 02:24:58,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 675 states and 954 transitions. [2023-02-15 02:24:58,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 02:24:58,398 INFO L218 hiAutomatonCegarLoop]: Abstraction has 675 states and 954 transitions. [2023-02-15 02:24:58,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states and 954 transitions. [2023-02-15 02:24:58,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 634. [2023-02-15 02:24:58,405 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 02:24:58,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 895 transitions. [2023-02-15 02:24:58,406 INFO L240 hiAutomatonCegarLoop]: Abstraction has 634 states and 895 transitions. [2023-02-15 02:24:58,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 02:24:58,407 INFO L428 stractBuchiCegarLoop]: Abstraction has 634 states and 895 transitions. [2023-02-15 02:24:58,407 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-02-15 02:24:58,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 634 states and 895 transitions. [2023-02-15 02:24:58,409 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 90 [2023-02-15 02:24:58,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 02:24:58,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 02:24:58,413 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 14, 14, 9, 6, 1, 1, 1, 1] [2023-02-15 02:24:58,413 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 14, 14, 9, 6, 1, 1] [2023-02-15 02:24:58,414 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 02:24:58,414 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 02:24:58,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:58,414 INFO L85 PathProgramCache]: Analyzing trace with hash 912728085, now seen corresponding path program 5 times [2023-02-15 02:24:58,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:24:58,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895859254] [2023-02-15 02:24:58,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:24:58,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:24:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:24:58,426 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 02:24:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:24:58,436 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 02:24:58,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:58,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1190197230, now seen corresponding path program 3 times [2023-02-15 02:24:58,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:24:58,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86218367] [2023-02-15 02:24:58,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:24:58,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:24:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:24:58,447 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 02:24:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:24:58,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 02:24:58,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:58,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1444454914, now seen corresponding path program 6 times [2023-02-15 02:24:58,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:24:58,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99206072] [2023-02-15 02:24:58,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:24:58,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:24:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:58,607 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 02:24:58,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 02:24:58,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99206072] [2023-02-15 02:24:58,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99206072] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 02:24:58,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008094977] [2023-02-15 02:24:58,608 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-15 02:24:58,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 02:24:58,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:58,615 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 02:24:58,637 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 02:24:58,657 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2023-02-15 02:24:58,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 02:24:58,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 02:24:58,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:58,685 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 02:24:58,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 02:24:58,750 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 02:24:58,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008094977] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 02:24:58,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 02:24:58,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2023-02-15 02:24:58,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707046031] [2023-02-15 02:24:58,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 02:24:58,983 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 02:24:58,983 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 02:24:58,983 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 02:24:58,983 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 02:24:58,983 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 02:24:58,983 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:58,983 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 02:24:58,983 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 02:24:58,983 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration12_Loop [2023-02-15 02:24:58,983 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 02:24:58,983 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 02:24:58,984 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 02:24:58,986 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 02:24:58,990 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 02:24:58,992 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 02:24:59,019 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 02:24:59,019 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 02:24:59,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:59,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:59,021 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 02:24:59,021 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 02:24:59,024 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 02:24:59,024 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 02:24:59,039 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 02:24:59,039 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 02:24:59,042 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 02:24:59,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:59,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:59,043 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 02:24:59,045 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 02:24:59,046 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 02:24:59,047 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 02:24:59,056 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 02:24:59,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:59,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:59,058 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 02:24:59,059 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 02:24:59,060 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 02:24:59,061 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 02:24:59,081 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 02:24:59,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2023-02-15 02:24:59,084 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 02:24:59,084 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 02:24:59,084 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 02:24:59,084 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 02:24:59,084 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 02:24:59,084 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:59,084 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 02:24:59,084 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 02:24:59,084 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration12_Loop [2023-02-15 02:24:59,084 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 02:24:59,085 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 02:24:59,085 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 02:24:59,088 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 02:24:59,097 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 02:24:59,099 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 02:24:59,123 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 02:24:59,124 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 02:24:59,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:59,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:59,125 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 02:24:59,130 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 02:24:59,130 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 02:24:59,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 02:24:59,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 02:24:59,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 02:24:59,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 02:24:59,139 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 02:24:59,139 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 02:24:59,141 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 02:24:59,144 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 02:24:59,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:59,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:59,145 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 02:24:59,147 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 02:24:59,148 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 02:24:59,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 02:24:59,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 02:24:59,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 02:24:59,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 02:24:59,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 02:24:59,156 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 02:24:59,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 02:24:59,159 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 02:24:59,161 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 02:24:59,161 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 02:24:59,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 02:24:59,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 02:24:59,163 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 02:24:59,164 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 02:24:59,164 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 02:24:59,165 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 02:24:59,165 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 02:24:59,165 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 02:24:59,167 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 02:24:59,168 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 02:24:59,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:59,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 02:24:59,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:59,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 02:24:59,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:59,407 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 02:24:59,408 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 02:24:59,408 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 02:24:59,432 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 02:24:59,432 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 02:24:59,433 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 02:24:59,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2023-02-15 02:24:59,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 63 letters. Loop has 60 letters. [2023-02-15 02:24:59,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:24:59,433 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 02:24:59,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:59,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 02:24:59,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:59,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 02:24:59,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:59,648 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 02:24:59,648 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 02:24:59,648 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 02:24:59,701 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 02:24:59,702 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 02:24:59,702 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 02:24:59,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2023-02-15 02:24:59,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 63 letters. Loop has 60 letters. [2023-02-15 02:24:59,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:24:59,702 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 02:24:59,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:59,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 02:24:59,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:59,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 02:24:59,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:24:59,940 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 02:24:59,940 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 02:24:59,941 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 02:24:59,967 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 02:24:59,967 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 02:24:59,968 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 02:24:59,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2023-02-15 02:24:59,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 63 letters. Loop has 60 letters. [2023-02-15 02:24:59,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:24:59,968 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 02:24:59,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:24:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:24:59,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 02:24:59,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:25:00,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2023-02-15 02:25:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:25:00,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 02:25:00,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:25:00,211 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 02:25:00,212 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 02:25:00,212 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 02:25:00,265 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 02:25:00,265 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 02:25:00,266 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 02:25:00,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2023-02-15 02:25:00,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 63 letters. Loop has 60 letters. [2023-02-15 02:25:00,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:25:00,266 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 02:25:00,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:25:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:25:00,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 02:25:00,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:25:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 02:25:00,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 02:25:00,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 02:25:00,495 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 02:25:00,495 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 02:25:00,495 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 02:25:00,896 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 02:25:00,896 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 02:25:00,897 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 02:25:00,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 110 transitions. [2023-02-15 02:25:00,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 110 transitions. Stem has 63 letters. Loop has 60 letters. [2023-02-15 02:25:00,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:25:00,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 110 transitions. Stem has 123 letters. Loop has 60 letters. [2023-02-15 02:25:00,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:25:00,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 110 transitions. Stem has 63 letters. Loop has 120 letters. [2023-02-15 02:25:00,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 02:25:00,907 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11129 states and 19734 transitions. [2023-02-15 02:25:01,004 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 248 [2023-02-15 02:25:01,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11129 states to 4882 states and 8741 transitions. [2023-02-15 02:25:01,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 330 [2023-02-15 02:25:01,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 575 [2023-02-15 02:25:01,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4882 states and 8741 transitions. [2023-02-15 02:25:01,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 02:25:01,032 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4882 states and 8741 transitions. [2023-02-15 02:25:01,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4882 states and 8741 transitions. [2023-02-15 02:25:01,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4882 to 3014. [2023-02-15 02:25:01,076 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 02:25:01,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3014 states to 3014 states and 5467 transitions. [2023-02-15 02:25:01,082 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3014 states and 5467 transitions. [2023-02-15 02:25:01,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 02:25:01,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 02:25:01,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2023-02-15 02:25:01,083 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 02:25:01,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 02:25:01,127 INFO L93 Difference]: Finished difference Result 3401 states and 6312 transitions. [2023-02-15 02:25:01,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3401 states and 6312 transitions. [2023-02-15 02:25:01,148 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 168 [2023-02-15 02:25:01,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3401 states to 3369 states and 6221 transitions. [2023-02-15 02:25:01,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 238 [2023-02-15 02:25:01,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 238 [2023-02-15 02:25:01,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3369 states and 6221 transitions. [2023-02-15 02:25:01,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 02:25:01,168 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3369 states and 6221 transitions. [2023-02-15 02:25:01,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3369 states and 6221 transitions. [2023-02-15 02:25:01,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3369 to 3222. [2023-02-15 02:25:01,205 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 02:25:01,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3222 states to 3222 states and 5927 transitions. [2023-02-15 02:25:01,210 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3222 states and 5927 transitions. [2023-02-15 02:25:01,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 02:25:01,211 INFO L428 stractBuchiCegarLoop]: Abstraction has 3222 states and 5927 transitions. [2023-02-15 02:25:01,211 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-02-15 02:25:01,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3222 states and 5927 transitions. [2023-02-15 02:25:01,219 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 152 [2023-02-15 02:25:01,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 02:25:01,219 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 02:25:01,220 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [19, 17, 17, 9, 9, 1, 1, 1, 1] [2023-02-15 02:25:01,220 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 17, 17, 9, 9, 1, 1] [2023-02-15 02:25:01,220 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 02:25:01,220 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 02:25:01,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:25:01,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1568126196, now seen corresponding path program 7 times [2023-02-15 02:25:01,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:25:01,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393093723] [2023-02-15 02:25:01,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:25:01,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:25:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:25:01,227 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 02:25:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:25:01,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 02:25:01,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:25:01,231 INFO L85 PathProgramCache]: Analyzing trace with hash 537366349, now seen corresponding path program 4 times [2023-02-15 02:25:01,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:25:01,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846863400] [2023-02-15 02:25:01,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:25:01,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:25:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:25:01,234 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 02:25:01,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:25:01,238 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 02:25:01,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 02:25:01,238 INFO L85 PathProgramCache]: Analyzing trace with hash 758614336, now seen corresponding path program 8 times [2023-02-15 02:25:01,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 02:25:01,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221224878] [2023-02-15 02:25:01,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 02:25:01,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 02:25:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:25:01,245 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 02:25:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:25:01,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 02:25:01,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:25:01,778 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 02:25:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 02:25:01,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.02 02:25:01 BoogieIcfgContainer [2023-02-15 02:25:01,855 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-02-15 02:25:01,855 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 02:25:01,855 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 02:25:01,856 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 02:25:01,856 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:24:51" (3/4) ... [2023-02-15 02:25:01,870 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-02-15 02:25:01,919 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 02:25:01,934 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 02:25:01,935 INFO L158 Benchmark]: Toolchain (without parser) took 10952.63ms. Allocated memory was 163.6MB in the beginning and 302.0MB in the end (delta: 138.4MB). Free memory was 123.2MB in the beginning and 240.6MB in the end (delta: -117.4MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2023-02-15 02:25:01,935 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 163.6MB. Free memory was 107.1MB in the beginning and 106.9MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 02:25:01,935 INFO L158 Benchmark]: CACSL2BoogieTranslator took 163.91ms. Allocated memory is still 163.6MB. Free memory was 122.7MB in the beginning and 113.7MB in the end (delta: 9.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 02:25:01,935 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.51ms. Allocated memory is still 163.6MB. Free memory was 113.7MB in the beginning and 112.7MB in the end (delta: 969.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 02:25:01,936 INFO L158 Benchmark]: Boogie Preprocessor took 13.52ms. Allocated memory is still 163.6MB. Free memory was 112.7MB in the beginning and 111.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 02:25:01,936 INFO L158 Benchmark]: RCFGBuilder took 170.66ms. Allocated memory is still 163.6MB. Free memory was 111.6MB in the beginning and 103.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-15 02:25:01,936 INFO L158 Benchmark]: BuchiAutomizer took 10495.25ms. Allocated memory was 163.6MB in the beginning and 302.0MB in the end (delta: 138.4MB). Free memory was 102.7MB in the beginning and 245.9MB in the end (delta: -143.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 02:25:01,936 INFO L158 Benchmark]: Witness Printer took 78.98ms. Allocated memory is still 302.0MB. Free memory was 245.9MB in the beginning and 240.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-02-15 02:25:01,937 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.15ms. Allocated memory is still 163.6MB. Free memory was 107.1MB in the beginning and 106.9MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 163.91ms. Allocated memory is still 163.6MB. Free memory was 122.7MB in the beginning and 113.7MB in the end (delta: 9.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.51ms. Allocated memory is still 163.6MB. Free memory was 113.7MB in the beginning and 112.7MB in the end (delta: 969.2kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 13.52ms. Allocated memory is still 163.6MB. Free memory was 112.7MB in the beginning and 111.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 170.66ms. Allocated memory is still 163.6MB. Free memory was 111.6MB in the beginning and 103.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 10495.25ms. Allocated memory was 163.6MB in the beginning and 302.0MB in the end (delta: 138.4MB). Free memory was 102.7MB in the beginning and 245.9MB in the end (delta: -143.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 78.98ms. Allocated memory is still 302.0MB. Free memory was 245.9MB in the beginning and 240.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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 10.3s and 13 iterations. TraceHistogramMax:19. Analysis of lassos took 5.9s. Construction of modules took 0.4s. Büchi inclusion checks took 3.6s. 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.2s 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.6s 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 hnf92 smp91 dnf137 smp95 tf107 neg95 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 75ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s 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 02:25:01,980 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 02:25:02,180 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 02:25:02,384 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 02:25:02,589 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 02:25:02,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-02-15 02:25:02,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)