./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/NO_13.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a31fd051 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/NO_13.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 eeea679d58a502ae5881094604c1f31424fa081cb4c3d3de58dd4530f33f3571 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 14:15:44,521 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 14:15:44,523 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 14:15:44,547 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 14:15:44,548 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 14:15:44,549 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 14:15:44,550 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 14:15:44,551 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 14:15:44,552 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 14:15:44,553 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 14:15:44,554 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 14:15:44,554 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 14:15:44,555 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 14:15:44,555 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 14:15:44,556 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 14:15:44,557 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 14:15:44,558 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 14:15:44,558 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 14:15:44,560 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 14:15:44,561 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 14:15:44,562 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 14:15:44,563 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 14:15:44,564 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 14:15:44,564 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 14:15:44,567 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 14:15:44,567 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 14:15:44,567 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 14:15:44,568 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 14:15:44,568 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 14:15:44,569 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 14:15:44,569 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 14:15:44,570 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 14:15:44,570 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 14:15:44,571 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 14:15:44,572 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 14:15:44,572 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 14:15:44,572 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 14:15:44,573 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 14:15:44,573 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 14:15:44,573 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 14:15:44,574 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 14:15:44,575 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-02-15 14:15:44,598 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 14:15:44,599 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 14:15:44,599 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 14:15:44,599 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 14:15:44,601 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 14:15:44,601 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 14:15:44,601 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 14:15:44,601 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-02-15 14:15:44,601 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-02-15 14:15:44,601 INFO L138 SettingsManager]: * Use old map elimination=false [2023-02-15 14:15:44,602 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2023-02-15 14:15:44,602 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2023-02-15 14:15:44,602 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-02-15 14:15:44,602 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 14:15:44,602 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 14:15:44,602 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 14:15:44,603 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 14:15:44,603 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-02-15 14:15:44,603 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-02-15 14:15:44,603 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-02-15 14:15:44,603 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 14:15:44,603 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-02-15 14:15:44,604 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 14:15:44,604 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-02-15 14:15:44,604 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 14:15:44,604 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 14:15:44,604 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 14:15:44,605 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 14:15:44,605 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-02-15 14:15:44,606 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 -> eeea679d58a502ae5881094604c1f31424fa081cb4c3d3de58dd4530f33f3571 [2023-02-15 14:15:44,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 14:15:44,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 14:15:44,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 14:15:44,851 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 14:15:44,851 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 14:15:44,853 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/NO_13.c [2023-02-15 14:15:45,980 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 14:15:46,149 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 14:15:46,150 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_13.c [2023-02-15 14:15:46,158 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fada329a/a005ac215e684a7c8db3416140dfa124/FLAG29cacb285 [2023-02-15 14:15:46,170 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fada329a/a005ac215e684a7c8db3416140dfa124 [2023-02-15 14:15:46,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 14:15:46,174 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 14:15:46,175 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 14:15:46,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 14:15:46,179 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 14:15:46,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 02:15:46" (1/1) ... [2023-02-15 14:15:46,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29b23fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:46, skipping insertion in model container [2023-02-15 14:15:46,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 02:15:46" (1/1) ... [2023-02-15 14:15:46,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 14:15:46,202 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 14:15:46,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 14:15:46,357 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 14:15:46,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 14:15:46,380 INFO L208 MainTranslator]: Completed translation [2023-02-15 14:15:46,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:46 WrapperNode [2023-02-15 14:15:46,381 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 14:15:46,382 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 14:15:46,382 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 14:15:46,382 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 14:15:46,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:46" (1/1) ... [2023-02-15 14:15:46,394 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:46" (1/1) ... [2023-02-15 14:15:46,408 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 17 [2023-02-15 14:15:46,408 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 14:15:46,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 14:15:46,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 14:15:46,410 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 14:15:46,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:46" (1/1) ... [2023-02-15 14:15:46,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:46" (1/1) ... [2023-02-15 14:15:46,418 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:46" (1/1) ... [2023-02-15 14:15:46,418 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:46" (1/1) ... [2023-02-15 14:15:46,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:46" (1/1) ... [2023-02-15 14:15:46,424 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:46" (1/1) ... [2023-02-15 14:15:46,424 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:46" (1/1) ... [2023-02-15 14:15:46,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:46" (1/1) ... [2023-02-15 14:15:46,426 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 14:15:46,427 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 14:15:46,428 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 14:15:46,428 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 14:15:46,429 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:46" (1/1) ... [2023-02-15 14:15:46,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:46,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:46,459 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:46,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-02-15 14:15:46,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 14:15:46,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 14:15:46,571 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 14:15:46,574 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 14:15:46,652 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 14:15:46,658 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 14:15:46,659 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-15 14:15:46,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:15:46 BoogieIcfgContainer [2023-02-15 14:15:46,661 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 14:15:46,663 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-02-15 14:15:46,663 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2023-02-15 14:15:46,666 INFO L275 PluginConnector]: BuchiAutomizer initialized [2023-02-15 14:15:46,667 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 14:15:46,667 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.02 02:15:46" (1/3) ... [2023-02-15 14:15:46,668 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25aa1d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.02 02:15:46, skipping insertion in model container [2023-02-15 14:15:46,668 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 14:15:46,669 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:15:46" (2/3) ... [2023-02-15 14:15:46,669 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25aa1d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.02 02:15:46, skipping insertion in model container [2023-02-15 14:15:46,669 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 14:15:46,669 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:15:46" (3/3) ... [2023-02-15 14:15:46,671 INFO L332 chiAutomizerObserver]: Analyzing ICFG NO_13.c [2023-02-15 14:15:46,732 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-02-15 14:15:46,733 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-02-15 14:15:46,733 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-02-15 14:15:46,733 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-02-15 14:15:46,733 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-02-15 14:15:46,733 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-02-15 14:15:46,733 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-02-15 14:15:46,734 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-02-15 14:15:46,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:46,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-15 14:15:46,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:46,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:46,759 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-15 14:15:46,759 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-15 14:15:46,759 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-02-15 14:15:46,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:46,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-15 14:15:46,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:46,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:46,761 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-15 14:15:46,761 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-15 14:15:46,768 INFO L748 eck$LassoCheckResult]: Stem: 5#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0; 2#L12-2true [2023-02-15 14:15:46,769 INFO L750 eck$LassoCheckResult]: Loop: 2#L12-2true assume !!(main_~i~0#1 < main_~j~0#1); 8#L12true assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 2#L12-2true [2023-02-15 14:15:46,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:46,775 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-02-15 14:15:46,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:46,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461980830] [2023-02-15 14:15:46,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:46,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:46,856 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:46,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:46,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:46,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 1 times [2023-02-15 14:15:46,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:46,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653195821] [2023-02-15 14:15:46,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:46,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:46,920 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:46,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:46,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:46,932 INFO L85 PathProgramCache]: Analyzing trace with hash 925800, now seen corresponding path program 1 times [2023-02-15 14:15:46,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:46,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056207773] [2023-02-15 14:15:46,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:46,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:47,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:15:47,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:47,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056207773] [2023-02-15 14:15:47,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056207773] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:15:47,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:15:47,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 14:15:47,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122948763] [2023-02-15 14:15:47,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:15:47,059 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:47,060 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:47,060 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:47,060 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:47,060 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:15:47,060 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:47,060 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:47,061 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:47,061 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration1_Loop [2023-02-15 14:15:47,061 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:47,061 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:47,076 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:15:47,087 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:15:47,091 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:15:47,185 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:47,185 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:15:47,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:47,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:47,207 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:47,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-02-15 14:15:47,229 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:47,229 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:47,247 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:47,247 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 14:15:47,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:47,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:47,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:47,253 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:47,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-02-15 14:15:47,256 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:47,256 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:47,277 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:47,277 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 14:15:47,282 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 14:15:47,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:47,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:47,286 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:47,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-02-15 14:15:47,290 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:47,290 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:47,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:47,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:47,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:47,334 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:47,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-02-15 14:15:47,347 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:15:47,349 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:47,371 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:15:47,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:47,375 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:47,375 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:47,375 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:47,376 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:47,376 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:15:47,376 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:47,376 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:47,376 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:47,376 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration1_Loop [2023-02-15 14:15:47,376 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:47,377 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:47,378 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:15:47,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 14:15:47,390 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:15:47,458 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:47,462 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:15:47,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:47,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:47,465 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:47,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:15:47,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:47,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:47,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:47,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:47,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-02-15 14:15:47,496 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:15:47,497 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:15:47,505 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:47,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:47,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:47,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:47,512 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:47,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-02-15 14:15:47,515 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:15:47,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:47,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:47,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:47,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:47,524 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:15:47,524 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:15:47,539 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:47,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-02-15 14:15:47,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:47,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:47,548 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:47,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-02-15 14:15:47,552 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:15:47,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:47,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:47,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:47,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:47,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:47,561 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:47,561 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:47,580 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:15:47,596 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:15:47,596 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 14:15:47,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:47,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:47,633 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:47,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-02-15 14:15:47,636 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:15:47,636 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:15:47,636 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:15:47,637 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 103 Supporting invariants [] [2023-02-15 14:15:47,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:47,646 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:15:47,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:47,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:15:47,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:47,690 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:15:47,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:47,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:15:47,718 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-02-15 14:15:47,720 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:47,757 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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). 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) Result 24 states and 31 transitions. Complement of second has 6 states. [2023-02-15 14:15:47,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-15 14:15:47,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:47,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2023-02-15 14:15:47,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 2 letters. [2023-02-15 14:15:47,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:47,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 2 letters. [2023-02-15 14:15:47,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:47,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 4 letters. [2023-02-15 14:15:47,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:47,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2023-02-15 14:15:47,773 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-15 14:15:47,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 8 states and 11 transitions. [2023-02-15 14:15:47,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2023-02-15 14:15:47,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2023-02-15 14:15:47,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2023-02-15 14:15:47,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:47,776 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2023-02-15 14:15:47,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2023-02-15 14:15:47,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2023-02-15 14:15:47,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:47,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2023-02-15 14:15:47,795 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2023-02-15 14:15:47,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:47,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 14:15:47,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 14:15:47,798 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:47,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:47,806 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2023-02-15 14:15:47,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. [2023-02-15 14:15:47,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-15 14:15:47,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 6 states and 7 transitions. [2023-02-15 14:15:47,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2023-02-15 14:15:47,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2023-02-15 14:15:47,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2023-02-15 14:15:47,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 14:15:47,808 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6 states and 7 transitions. [2023-02-15 14:15:47,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2023-02-15 14:15:47,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2023-02-15 14:15:47,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:47,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2023-02-15 14:15:47,809 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6 states and 7 transitions. [2023-02-15 14:15:47,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 14:15:47,810 INFO L428 stractBuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2023-02-15 14:15:47,810 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-02-15 14:15:47,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2023-02-15 14:15:47,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-15 14:15:47,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:47,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:47,811 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-15 14:15:47,811 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-15 14:15:47,811 INFO L748 eck$LassoCheckResult]: Stem: 85#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 86#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0; 87#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 88#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 83#L12-2 [2023-02-15 14:15:47,811 INFO L750 eck$LassoCheckResult]: Loop: 83#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 84#L12 assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 83#L12-2 [2023-02-15 14:15:47,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:47,812 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2023-02-15 14:15:47,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:47,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074628704] [2023-02-15 14:15:47,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:47,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:47,817 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:47,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:47,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:47,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 2 times [2023-02-15 14:15:47,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:47,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256287723] [2023-02-15 14:15:47,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:47,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:47,825 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:47,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:47,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:47,829 INFO L85 PathProgramCache]: Analyzing trace with hash 889692235, now seen corresponding path program 1 times [2023-02-15 14:15:47,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:47,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085852756] [2023-02-15 14:15:47,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:47,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:47,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:15:47,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:47,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085852756] [2023-02-15 14:15:47,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085852756] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:15:47,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075425483] [2023-02-15 14:15:47,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:47,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:47,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:47,862 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:15:47,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 14:15:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:47,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 14:15:47,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:47,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:47,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:15:47,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:15:47,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:15:47,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075425483] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:15:47,977 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:15:47,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-02-15 14:15:47,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614316353] [2023-02-15 14:15:47,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:15:48,001 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:48,001 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:48,001 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:48,002 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:48,002 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:15:48,002 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:48,002 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:48,002 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:48,002 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration2_Loop [2023-02-15 14:15:48,002 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:48,003 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:48,005 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:15:48,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 14:15:48,013 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:15:48,067 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:48,067 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:15:48,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:48,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:48,069 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:48,080 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:48,080 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:48,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-02-15 14:15:48,105 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:48,105 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 14:15:48,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:48,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:48,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:48,115 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:48,128 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:48,128 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:48,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-02-15 14:15:48,161 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:48,161 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 14:15:48,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:48,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:48,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:48,169 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:48,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-02-15 14:15:48,172 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:48,172 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:48,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:48,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:48,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:48,188 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:48,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-02-15 14:15:48,192 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:15:48,192 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:48,214 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:15:48,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:48,222 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:48,222 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:48,222 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:48,222 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:48,222 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:15:48,222 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:48,222 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:48,222 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:48,223 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration2_Loop [2023-02-15 14:15:48,223 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:48,223 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:48,224 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:15:48,228 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:15:48,232 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:15:48,285 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:48,285 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:15:48,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:48,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:48,287 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:48,296 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:15:48,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:48,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:48,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:48,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:48,307 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:15:48,307 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:15:48,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-02-15 14:15:48,321 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:48,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:48,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:48,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:48,329 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:48,340 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:15:48,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:48,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:48,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:48,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:48,350 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:15:48,351 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:15:48,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-02-15 14:15:48,369 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:48,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:48,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:48,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:48,376 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:48,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-02-15 14:15:48,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:15:48,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:48,387 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:48,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:48,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:48,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:48,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:48,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:48,409 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:15:48,422 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:15:48,422 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 14:15:48,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:48,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:48,425 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:48,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-02-15 14:15:48,427 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:15:48,427 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:15:48,428 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:15:48,428 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 103 Supporting invariants [] [2023-02-15 14:15:48,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2023-02-15 14:15:48,434 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:15:48,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:48,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:15:48,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:48,473 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:15:48,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:48,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:15:48,480 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-02-15 14:15:48,481 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:48,492 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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 10 states and 13 transitions. Complement of second has 5 states. [2023-02-15 14:15:48,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-15 14:15:48,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:48,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2023-02-15 14:15:48,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 2 letters. [2023-02-15 14:15:48,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:48,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 6 letters. Loop has 2 letters. [2023-02-15 14:15:48,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:48,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 4 letters. [2023-02-15 14:15:48,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:48,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. [2023-02-15 14:15:48,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-15 14:15:48,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 13 transitions. [2023-02-15 14:15:48,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2023-02-15 14:15:48,498 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-02-15 14:15:48,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2023-02-15 14:15:48,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:48,498 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2023-02-15 14:15:48,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2023-02-15 14:15:48,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2023-02-15 14:15:48,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:48,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2023-02-15 14:15:48,500 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2023-02-15 14:15:48,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:48,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 14:15:48,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-02-15 14:15:48,502 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:48,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:48,522 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2023-02-15 14:15:48,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2023-02-15 14:15:48,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-15 14:15:48,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 13 transitions. [2023-02-15 14:15:48,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2023-02-15 14:15:48,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2023-02-15 14:15:48,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2023-02-15 14:15:48,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 14:15:48,524 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 13 transitions. [2023-02-15 14:15:48,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2023-02-15 14:15:48,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-02-15 14:15:48,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:48,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2023-02-15 14:15:48,526 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 13 transitions. [2023-02-15 14:15:48,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 14:15:48,527 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2023-02-15 14:15:48,527 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-02-15 14:15:48,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2023-02-15 14:15:48,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-15 14:15:48,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:48,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:48,529 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1] [2023-02-15 14:15:48,529 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-15 14:15:48,529 INFO L748 eck$LassoCheckResult]: Stem: 195#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 196#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0; 197#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 198#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 193#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 194#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 204#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 203#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 202#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 201#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 200#L12-2 [2023-02-15 14:15:48,529 INFO L750 eck$LassoCheckResult]: Loop: 200#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 199#L12 assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 200#L12-2 [2023-02-15 14:15:48,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:48,530 INFO L85 PathProgramCache]: Analyzing trace with hash 742492623, now seen corresponding path program 2 times [2023-02-15 14:15:48,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:48,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172421575] [2023-02-15 14:15:48,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:48,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:48,539 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:48,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:48,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:48,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 3 times [2023-02-15 14:15:48,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:48,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932291056] [2023-02-15 14:15:48,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:48,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:48,550 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:48,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:48,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:48,553 INFO L85 PathProgramCache]: Analyzing trace with hash 570839924, now seen corresponding path program 2 times [2023-02-15 14:15:48,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:48,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295786958] [2023-02-15 14:15:48,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:48,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:48,621 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:15:48,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:48,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295786958] [2023-02-15 14:15:48,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295786958] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:15:48,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938025521] [2023-02-15 14:15:48,622 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 14:15:48,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:48,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:48,624 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:15:48,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-02-15 14:15:48,662 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 14:15:48,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 14:15:48,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 14:15:48,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:48,698 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:15:48,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:15:48,762 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:15:48,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938025521] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:15:48,765 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:15:48,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-02-15 14:15:48,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546904614] [2023-02-15 14:15:48,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:15:48,788 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:48,789 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:48,789 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:48,789 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:48,789 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:15:48,789 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:48,789 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:48,789 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:48,790 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration3_Loop [2023-02-15 14:15:48,790 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:48,790 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:48,792 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:15:48,799 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:15:48,801 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:15:48,839 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:48,839 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:15:48,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:48,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:48,845 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:48,853 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:48,853 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:48,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-02-15 14:15:48,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:48,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:48,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:48,881 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:48,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-02-15 14:15:48,884 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:15:48,884 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:48,910 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:15:48,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:48,915 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:48,915 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:48,915 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:48,915 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:48,916 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:15:48,916 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:48,916 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:48,916 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:48,925 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration3_Loop [2023-02-15 14:15:48,925 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:48,925 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:48,926 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:15:48,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2023-02-15 14:15:48,936 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:15:48,939 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:15:48,981 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:48,981 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:15:48,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:48,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:48,982 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:48,994 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:15:48,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-02-15 14:15:49,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:49,001 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:49,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:49,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:49,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:49,002 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:49,002 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:49,016 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:15:49,019 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:15:49,019 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 14:15:49,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:49,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:49,021 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:49,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-02-15 14:15:49,024 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:15:49,024 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:15:49,024 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:15:49,024 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 103 Supporting invariants [] [2023-02-15 14:15:49,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:49,034 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:15:49,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:49,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:49,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:15:49,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:49,074 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:15:49,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:49,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:15:49,077 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-02-15 14:15:49,077 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:49,084 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 13 states and 14 transitions. Complement of second has 5 states. [2023-02-15 14:15:49,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-15 14:15:49,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:49,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2023-02-15 14:15:49,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 10 letters. Loop has 2 letters. [2023-02-15 14:15:49,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:49,086 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 14:15:49,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:49,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:15:49,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:49,118 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:15:49,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:49,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:15:49,121 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2023-02-15 14:15:49,121 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:49,126 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 13 states and 14 transitions. Complement of second has 5 states. [2023-02-15 14:15:49,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-15 14:15:49,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:49,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2023-02-15 14:15:49,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 10 letters. Loop has 2 letters. [2023-02-15 14:15:49,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:49,128 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 14:15:49,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:49,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:15:49,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:49,158 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:15:49,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:49,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:15:49,161 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 1 loop predicates [2023-02-15 14:15:49,161 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:49,170 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 17 states and 19 transitions. Complement of second has 4 states. [2023-02-15 14:15:49,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-15 14:15:49,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:49,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2023-02-15 14:15:49,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 2 letters. [2023-02-15 14:15:49,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:49,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 12 letters. Loop has 2 letters. [2023-02-15 14:15:49,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:49,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 4 letters. [2023-02-15 14:15:49,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:49,173 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2023-02-15 14:15:49,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-15 14:15:49,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 14 states and 16 transitions. [2023-02-15 14:15:49,174 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-02-15 14:15:49,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2023-02-15 14:15:49,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2023-02-15 14:15:49,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:49,175 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2023-02-15 14:15:49,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2023-02-15 14:15:49,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2023-02-15 14:15:49,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:49,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2023-02-15 14:15:49,176 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 15 transitions. [2023-02-15 14:15:49,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:49,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 14:15:49,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-02-15 14:15:49,177 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:49,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:49,207 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2023-02-15 14:15:49,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 34 transitions. [2023-02-15 14:15:49,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-15 14:15:49,208 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 26 states and 28 transitions. [2023-02-15 14:15:49,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2023-02-15 14:15:49,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2023-02-15 14:15:49,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2023-02-15 14:15:49,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:49,209 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2023-02-15 14:15:49,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2023-02-15 14:15:49,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2023-02-15 14:15:49,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.08) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:49,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2023-02-15 14:15:49,211 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 27 transitions. [2023-02-15 14:15:49,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 14:15:49,212 INFO L428 stractBuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2023-02-15 14:15:49,213 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-02-15 14:15:49,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 27 transitions. [2023-02-15 14:15:49,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-15 14:15:49,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:49,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:49,214 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 1, 1] [2023-02-15 14:15:49,214 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-15 14:15:49,215 INFO L748 eck$LassoCheckResult]: Stem: 508#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 509#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0; 510#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 511#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 503#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 504#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 527#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 526#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 525#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 524#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 523#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 522#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 521#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 520#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 519#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 518#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 517#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 516#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 515#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 514#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 513#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 507#L12 [2023-02-15 14:15:49,215 INFO L750 eck$LassoCheckResult]: Loop: 507#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 512#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 507#L12 [2023-02-15 14:15:49,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:49,215 INFO L85 PathProgramCache]: Analyzing trace with hash -926509747, now seen corresponding path program 3 times [2023-02-15 14:15:49,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:49,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724943087] [2023-02-15 14:15:49,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:49,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:49,228 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:49,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:49,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:49,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:49,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1406, now seen corresponding path program 1 times [2023-02-15 14:15:49,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:49,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202525841] [2023-02-15 14:15:49,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:49,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:49,242 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:49,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:49,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:49,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1317636150, now seen corresponding path program 4 times [2023-02-15 14:15:49,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:49,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293301206] [2023-02-15 14:15:49,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:49,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:49,255 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:49,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:49,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:49,283 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:49,283 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:49,283 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:49,283 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:49,283 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:15:49,284 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:49,284 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:49,284 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:49,284 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration4_Loop [2023-02-15 14:15:49,284 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:49,284 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:49,285 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:15:49,291 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:15:49,293 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:15:49,335 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:49,336 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:15:49,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:49,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:49,341 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:49,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-02-15 14:15:49,346 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:49,346 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:49,369 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:49,369 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 14:15:49,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:49,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:49,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:49,376 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:49,385 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:49,386 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:49,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-02-15 14:15:49,399 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:49,399 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 14:15:49,402 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 14:15:49,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:49,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:49,403 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:49,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-02-15 14:15:49,407 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:49,407 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:49,419 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 14:15:49,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:49,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:49,421 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:49,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-02-15 14:15:49,426 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:15:49,426 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:49,457 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:15:49,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:49,464 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:49,464 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:49,464 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:49,464 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:49,464 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:15:49,464 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:49,465 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:49,465 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:49,465 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration4_Loop [2023-02-15 14:15:49,465 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:49,465 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:49,466 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:15:49,468 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:15:49,471 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:15:49,516 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:49,517 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:15:49,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:49,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:49,518 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:49,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:15:49,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:49,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:49,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:49,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:49,538 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:15:49,539 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:15:49,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-02-15 14:15:49,552 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:49,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:49,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:49,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:49,560 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:49,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-02-15 14:15:49,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:15:49,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:49,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:49,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:49,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:49,573 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:15:49,574 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:15:49,589 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:49,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:49,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:49,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:49,598 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:49,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-02-15 14:15:49,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:15:49,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:49,609 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:49,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:49,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:49,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:49,611 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:49,611 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:49,636 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:15:49,640 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:15:49,640 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 14:15:49,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:49,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:49,647 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:49,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-02-15 14:15:49,649 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:15:49,649 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:15:49,649 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:15:49,650 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2023-02-15 14:15:49,656 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 14:15:49,657 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:15:49,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:49,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:15:49,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:49,706 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:15:49,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:49,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:15:49,719 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-15 14:15:49,719 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 27 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:49,730 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 27 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 38 states and 42 transitions. Complement of second has 5 states. [2023-02-15 14:15:49,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-15 14:15:49,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:49,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2023-02-15 14:15:49,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 21 letters. Loop has 2 letters. [2023-02-15 14:15:49,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:49,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 23 letters. Loop has 2 letters. [2023-02-15 14:15:49,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:49,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 21 letters. Loop has 4 letters. [2023-02-15 14:15:49,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:49,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 42 transitions. [2023-02-15 14:15:49,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-15 14:15:49,734 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 28 states and 31 transitions. [2023-02-15 14:15:49,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2023-02-15 14:15:49,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2023-02-15 14:15:49,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2023-02-15 14:15:49,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:49,735 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-02-15 14:15:49,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2023-02-15 14:15:49,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2023-02-15 14:15:49,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:49,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-02-15 14:15:49,737 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-02-15 14:15:49,737 INFO L428 stractBuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-02-15 14:15:49,737 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-02-15 14:15:49,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. [2023-02-15 14:15:49,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-15 14:15:49,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:49,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:49,740 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 10, 1, 1, 1] [2023-02-15 14:15:49,740 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-15 14:15:49,740 INFO L748 eck$LassoCheckResult]: Stem: 660#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 661#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0; 662#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 663#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 664#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 665#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 658#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 659#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 681#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 680#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 679#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 678#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 677#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 676#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 675#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 674#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 673#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 672#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 671#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 670#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 669#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 668#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 667#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 656#L12 assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 666#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 657#L12 [2023-02-15 14:15:49,740 INFO L750 eck$LassoCheckResult]: Loop: 657#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 655#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 657#L12 [2023-02-15 14:15:49,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:49,740 INFO L85 PathProgramCache]: Analyzing trace with hash 767012677, now seen corresponding path program 3 times [2023-02-15 14:15:49,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:49,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329293503] [2023-02-15 14:15:49,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:49,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:49,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:49,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:49,937 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:15:49,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:49,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329293503] [2023-02-15 14:15:49,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329293503] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:15:49,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994106876] [2023-02-15 14:15:49,938 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 14:15:49,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:49,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:49,941 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:15:49,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-02-15 14:15:49,982 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2023-02-15 14:15:49,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 14:15:49,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 14:15:49,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:50,021 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:15:50,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:15:50,209 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:15:50,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994106876] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:15:50,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:15:50,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2023-02-15 14:15:50,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655071242] [2023-02-15 14:15:50,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:15:50,210 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 14:15:50,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:50,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1406, now seen corresponding path program 2 times [2023-02-15 14:15:50,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:50,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933706310] [2023-02-15 14:15:50,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:50,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:50,214 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:50,216 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:50,235 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:50,235 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:50,235 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:50,235 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:50,235 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:15:50,235 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:50,235 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:50,236 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:50,236 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration5_Loop [2023-02-15 14:15:50,236 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:50,236 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:50,237 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:15:50,244 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:15:50,247 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:15:50,285 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:50,285 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:15:50,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:50,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:50,286 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:50,301 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:50,301 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:50,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-02-15 14:15:50,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:50,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:50,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:50,318 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:50,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-02-15 14:15:50,321 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:15:50,321 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:50,350 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:15:50,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:50,357 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:50,357 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:50,357 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:50,357 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:50,357 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:15:50,357 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:50,357 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:50,357 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:50,357 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration5_Loop [2023-02-15 14:15:50,357 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:50,357 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:50,358 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:15:50,361 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:15:50,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 14:15:50,414 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:50,414 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:15:50,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:50,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:50,415 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:50,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2023-02-15 14:15:50,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:15:50,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:50,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:50,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:50,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:50,429 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:15:50,429 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:15:50,443 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:50,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:50,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:50,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:50,452 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:50,458 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:15:50,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:50,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:50,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:50,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:50,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:50,467 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:50,467 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:50,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2023-02-15 14:15:50,480 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:15:50,484 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:15:50,484 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 14:15:50,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:50,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:50,493 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:15:50,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2023-02-15 14:15:50,497 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:15:50,497 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:15:50,497 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:15:50,497 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2023-02-15 14:15:50,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:50,503 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:15:50,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:50,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:15:50,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:50,564 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:15:50,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:50,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:15:50,576 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-15 14:15:50,576 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:50,584 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.6666666666666665) 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) Result 38 states and 42 transitions. Complement of second has 5 states. [2023-02-15 14:15:50,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-15 14:15:50,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:50,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2023-02-15 14:15:50,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 25 letters. Loop has 2 letters. [2023-02-15 14:15:50,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:50,586 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 14:15:50,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:50,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:50,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:15:50,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:50,632 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:15:50,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:50,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:15:50,643 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-15 14:15:50,644 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:50,657 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.6666666666666665) 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) Result 39 states and 43 transitions. Complement of second has 5 states. [2023-02-15 14:15:50,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-15 14:15:50,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:50,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2023-02-15 14:15:50,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 25 letters. Loop has 2 letters. [2023-02-15 14:15:50,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:50,658 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 14:15:50,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:50,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:15:50,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:50,714 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:15:50,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:50,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:15:50,725 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-15 14:15:50,726 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:50,741 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.6666666666666665) 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) Result 40 states and 45 transitions. Complement of second has 4 states. [2023-02-15 14:15:50,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-15 14:15:50,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:50,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2023-02-15 14:15:50,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 25 letters. Loop has 2 letters. [2023-02-15 14:15:50,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:50,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 27 letters. Loop has 2 letters. [2023-02-15 14:15:50,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:50,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 25 letters. Loop has 4 letters. [2023-02-15 14:15:50,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:50,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 45 transitions. [2023-02-15 14:15:50,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-02-15 14:15:50,752 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 29 states and 32 transitions. [2023-02-15 14:15:50,752 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2023-02-15 14:15:50,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2023-02-15 14:15:50,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 32 transitions. [2023-02-15 14:15:50,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:50,752 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 32 transitions. [2023-02-15 14:15:50,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 32 transitions. [2023-02-15 14:15:50,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2023-02-15 14:15:50,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:50,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2023-02-15 14:15:50,754 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2023-02-15 14:15:50,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:50,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-15 14:15:50,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2023-02-15 14:15:50,756 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 24 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:50,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:50,819 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2023-02-15 14:15:50,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 65 transitions. [2023-02-15 14:15:50,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-02-15 14:15:50,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 51 states and 53 transitions. [2023-02-15 14:15:50,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2023-02-15 14:15:50,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2023-02-15 14:15:50,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 53 transitions. [2023-02-15 14:15:50,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:50,821 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 53 transitions. [2023-02-15 14:15:50,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 53 transitions. [2023-02-15 14:15:50,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2023-02-15 14:15:50,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.04) internal successors, (52), 49 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:50,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2023-02-15 14:15:50,824 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 52 transitions. [2023-02-15 14:15:50,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 14:15:50,825 INFO L428 stractBuchiCegarLoop]: Abstraction has 50 states and 52 transitions. [2023-02-15 14:15:50,825 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-02-15 14:15:50,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 52 transitions. [2023-02-15 14:15:50,826 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-02-15 14:15:50,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:50,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:50,827 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [24, 22, 1, 1, 1] [2023-02-15 14:15:50,827 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2023-02-15 14:15:50,828 INFO L748 eck$LassoCheckResult]: Stem: 1328#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1329#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0; 1324#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1325#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1330#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1331#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1326#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1327#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1373#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1372#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1371#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1370#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1369#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1368#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1367#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1366#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1365#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1364#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1363#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1362#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1361#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1360#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1359#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1358#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1357#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1356#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1355#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1354#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1353#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1352#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1351#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1350#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1349#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1348#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1347#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1346#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1345#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1344#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1343#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1342#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1341#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1340#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1339#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1338#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1337#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1336#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1335#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1333#L12 assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 1332#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1334#L12 [2023-02-15 14:15:50,828 INFO L750 eck$LassoCheckResult]: Loop: 1334#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1335#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1333#L12 assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 1332#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1334#L12 [2023-02-15 14:15:50,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:50,828 INFO L85 PathProgramCache]: Analyzing trace with hash -694298463, now seen corresponding path program 4 times [2023-02-15 14:15:50,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:50,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999565587] [2023-02-15 14:15:50,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:50,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:50,866 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 14:15:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:51,375 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:15:51,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:51,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999565587] [2023-02-15 14:15:51,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999565587] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:15:51,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109127457] [2023-02-15 14:15:51,376 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 14:15:51,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:51,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:51,377 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:15:51,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2023-02-15 14:15:51,420 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 14:15:51,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 14:15:51,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-15 14:15:51,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:51,508 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:15:51,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:15:52,256 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:15:52,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109127457] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:15:52,257 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:15:52,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2023-02-15 14:15:52,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474500231] [2023-02-15 14:15:52,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:15:52,259 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 14:15:52,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:52,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 1 times [2023-02-15 14:15:52,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:52,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140509076] [2023-02-15 14:15:52,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:52,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:52,264 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:52,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:52,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:52,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-02-15 14:15:52,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2023-02-15 14:15:52,311 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. cyclomatic complexity: 3 Second operand has 48 states, 48 states have (on average 2.0) internal successors, (96), 48 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:52,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:52,451 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2023-02-15 14:15:52,451 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 125 transitions. [2023-02-15 14:15:52,452 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-02-15 14:15:52,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 99 states and 101 transitions. [2023-02-15 14:15:52,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2023-02-15 14:15:52,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2023-02-15 14:15:52,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 101 transitions. [2023-02-15 14:15:52,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:52,453 INFO L218 hiAutomatonCegarLoop]: Abstraction has 99 states and 101 transitions. [2023-02-15 14:15:52,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 101 transitions. [2023-02-15 14:15:52,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2023-02-15 14:15:52,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 97 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:52,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2023-02-15 14:15:52,458 INFO L240 hiAutomatonCegarLoop]: Abstraction has 98 states and 100 transitions. [2023-02-15 14:15:52,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-02-15 14:15:52,459 INFO L428 stractBuchiCegarLoop]: Abstraction has 98 states and 100 transitions. [2023-02-15 14:15:52,459 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-02-15 14:15:52,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 100 transitions. [2023-02-15 14:15:52,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-02-15 14:15:52,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:52,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:52,462 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [48, 46, 1, 1, 1] [2023-02-15 14:15:52,462 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2023-02-15 14:15:52,463 INFO L748 eck$LassoCheckResult]: Stem: 1840#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1841#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0; 1836#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1837#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1842#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1843#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1838#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1839#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1933#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1932#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1931#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1930#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1929#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1928#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1927#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1926#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1925#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1924#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1923#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1922#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1921#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1920#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1919#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1918#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1917#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1916#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1915#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1914#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1913#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1912#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1911#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1910#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1909#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1908#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1907#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1906#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1905#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1904#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1903#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1902#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1901#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1900#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1899#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1898#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1897#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1896#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1895#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1894#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1893#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1892#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1891#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1890#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1889#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1888#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1887#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1886#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1885#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1884#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1883#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1882#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1881#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1880#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1879#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1878#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1877#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1876#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1875#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1874#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1873#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1872#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1871#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1870#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1869#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1868#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1867#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1866#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1865#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1864#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1863#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1862#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1861#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1860#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1859#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1858#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1857#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1856#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1855#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1854#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1853#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1852#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1851#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1850#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1849#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1848#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1847#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1845#L12 assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 1844#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1846#L12 [2023-02-15 14:15:52,463 INFO L750 eck$LassoCheckResult]: Loop: 1846#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1847#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1845#L12 assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 1844#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1846#L12 [2023-02-15 14:15:52,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:52,463 INFO L85 PathProgramCache]: Analyzing trace with hash -818401447, now seen corresponding path program 5 times [2023-02-15 14:15:52,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:52,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58896354] [2023-02-15 14:15:52,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:52,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:53,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:15:53,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:53,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58896354] [2023-02-15 14:15:53,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58896354] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:15:53,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865312798] [2023-02-15 14:15:53,921 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-15 14:15:53,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:53,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:53,924 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:15:53,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2023-02-15 14:15:54,004 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2023-02-15 14:15:54,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 14:15:54,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-15 14:15:54,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:54,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:15:54,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:15:55,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:15:55,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865312798] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:15:55,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:15:55,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 51 [2023-02-15 14:15:55,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852439467] [2023-02-15 14:15:55,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:15:55,205 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 14:15:55,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:55,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 2 times [2023-02-15 14:15:55,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:55,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036040115] [2023-02-15 14:15:55,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:55,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:55,209 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:55,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:55,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:55,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-02-15 14:15:55,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2023-02-15 14:15:55,258 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. cyclomatic complexity: 3 Second operand has 51 states, 51 states have (on average 2.019607843137255) internal successors, (103), 51 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:55,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:55,398 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2023-02-15 14:15:55,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 110 transitions. [2023-02-15 14:15:55,399 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-02-15 14:15:55,400 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 107 transitions. [2023-02-15 14:15:55,400 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2023-02-15 14:15:55,400 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2023-02-15 14:15:55,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 107 transitions. [2023-02-15 14:15:55,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:55,401 INFO L218 hiAutomatonCegarLoop]: Abstraction has 105 states and 107 transitions. [2023-02-15 14:15:55,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 107 transitions. [2023-02-15 14:15:55,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2023-02-15 14:15:55,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 103 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:15:55,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2023-02-15 14:15:55,412 INFO L240 hiAutomatonCegarLoop]: Abstraction has 104 states and 106 transitions. [2023-02-15 14:15:55,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-02-15 14:15:55,413 INFO L428 stractBuchiCegarLoop]: Abstraction has 104 states and 106 transitions. [2023-02-15 14:15:55,414 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-02-15 14:15:55,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 106 transitions. [2023-02-15 14:15:55,415 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-02-15 14:15:55,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:55,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:55,416 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [51, 49, 1, 1, 1] [2023-02-15 14:15:55,418 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2023-02-15 14:15:55,418 INFO L748 eck$LassoCheckResult]: Stem: 2676#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2677#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0; 2672#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2673#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2678#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2679#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2674#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2675#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2775#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2774#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2773#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2772#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2771#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2770#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2769#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2768#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2767#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2766#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2765#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2764#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2763#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2762#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2761#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2760#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2759#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2758#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2757#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2756#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2755#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2754#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2753#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2752#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2751#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2750#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2749#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2748#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2747#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2746#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2745#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2744#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2743#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2742#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2741#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2740#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2739#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2738#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2737#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2736#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2735#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2734#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2733#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2732#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2731#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2730#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2729#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2728#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2727#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2726#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2725#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2724#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2723#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2722#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2721#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2720#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2719#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2718#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2717#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2716#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2715#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2714#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2713#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2712#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2711#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2710#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2709#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2708#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2707#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2706#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2705#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2704#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2703#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2702#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2701#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2700#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2699#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2698#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2697#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2696#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2695#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2694#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2693#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2692#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2691#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2690#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2689#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2688#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2687#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2686#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2685#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2684#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2683#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2681#L12 assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 2680#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2682#L12 [2023-02-15 14:15:55,418 INFO L750 eck$LassoCheckResult]: Loop: 2682#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2683#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2681#L12 assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 2680#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2682#L12 [2023-02-15 14:15:55,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:55,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1994822288, now seen corresponding path program 6 times [2023-02-15 14:15:55,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:55,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658087060] [2023-02-15 14:15:55,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:55,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:55,450 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:55,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:55,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:55,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 3 times [2023-02-15 14:15:55,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:55,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184817893] [2023-02-15 14:15:55,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:55,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:55,487 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:55,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:55,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:55,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1522445560, now seen corresponding path program 7 times [2023-02-15 14:15:55,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:55,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756291211] [2023-02-15 14:15:55,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:55,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:55,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:55,523 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:55,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:55,560 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:57,875 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:57,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.02 02:15:57 BoogieIcfgContainer [2023-02-15 14:15:57,964 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-02-15 14:15:57,965 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 14:15:57,965 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 14:15:57,965 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 14:15:57,965 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:15:46" (3/4) ... [2023-02-15 14:15:57,967 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-02-15 14:15:58,014 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 14:15:58,014 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 14:15:58,015 INFO L158 Benchmark]: Toolchain (without parser) took 11841.08ms. Allocated memory was 111.1MB in the beginning and 161.5MB in the end (delta: 50.3MB). Free memory was 73.7MB in the beginning and 61.6MB in the end (delta: 12.1MB). Peak memory consumption was 63.6MB. Max. memory is 16.1GB. [2023-02-15 14:15:58,015 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 111.1MB. Free memory was 84.5MB in the beginning and 84.3MB in the end (delta: 134.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 14:15:58,015 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.48ms. Allocated memory is still 111.1MB. Free memory was 73.7MB in the beginning and 64.7MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-15 14:15:58,016 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.71ms. Allocated memory is still 111.1MB. Free memory was 64.7MB in the beginning and 63.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 14:15:58,016 INFO L158 Benchmark]: Boogie Preprocessor took 16.75ms. Allocated memory is still 111.1MB. Free memory was 63.3MB in the beginning and 62.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 14:15:58,016 INFO L158 Benchmark]: RCFGBuilder took 233.43ms. Allocated memory is still 111.1MB. Free memory was 62.3MB in the beginning and 54.2MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-15 14:15:58,016 INFO L158 Benchmark]: BuchiAutomizer took 11301.12ms. Allocated memory was 111.1MB in the beginning and 161.5MB in the end (delta: 50.3MB). Free memory was 54.2MB in the beginning and 65.8MB in the end (delta: -11.6MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. [2023-02-15 14:15:58,016 INFO L158 Benchmark]: Witness Printer took 49.87ms. Allocated memory is still 161.5MB. Free memory was 65.8MB in the beginning and 61.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-15 14:15:58,018 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.23ms. Allocated memory is still 111.1MB. Free memory was 84.5MB in the beginning and 84.3MB in the end (delta: 134.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.48ms. Allocated memory is still 111.1MB. Free memory was 73.7MB in the beginning and 64.7MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.71ms. Allocated memory is still 111.1MB. Free memory was 64.7MB in the beginning and 63.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.75ms. Allocated memory is still 111.1MB. Free memory was 63.3MB in the beginning and 62.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 233.43ms. Allocated memory is still 111.1MB. Free memory was 62.3MB in the beginning and 54.2MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 11301.12ms. Allocated memory was 111.1MB in the beginning and 161.5MB in the end (delta: 50.3MB). Free memory was 54.2MB in the beginning and 65.8MB in the end (delta: -11.6MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. * Witness Printer took 49.87ms. Allocated memory is still 161.5MB. Free memory was 65.8MB in the beginning and 61.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (6 trivial, 3 deterministic, 2 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -2 * j + 103 and consists of 4 locations. One deterministic module has affine ranking function -2 * j + 103 and consists of 3 locations. One deterministic module has affine ranking function j and consists of 3 locations. One nondeterministic module has affine ranking function -2 * j + 103 and consists of 3 locations. One nondeterministic module has affine ranking function j and consists of 3 locations. 6 modules have a trivial ranking function, the largest among these consists of 51 locations. The remainder module has 104 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.1s and 8 iterations. TraceHistogramMax:51. Analysis of lassos took 10.0s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 9 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 348 IncrementalHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 54 mSDtfsCounter, 348 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT3 SILN2 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax164 hnf100 lsp60 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq164 hnf100 smp100 dnf93 smp100 tf106 neg98 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 41ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s 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 j; [L8] j = 100 [L9] i = 0 VAL [i=0, j=100] [L11] COND TRUE i < j VAL [i=0, j=100] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=1, j=99] [L11] COND TRUE i < j VAL [i=1, j=99] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=2, j=98] [L11] COND TRUE i < j VAL [i=2, j=98] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=3, j=97] [L11] COND TRUE i < j VAL [i=3, j=97] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=4, j=96] [L11] COND TRUE i < j VAL [i=4, j=96] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=5, j=95] [L11] COND TRUE i < j VAL [i=5, j=95] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=6, j=94] [L11] COND TRUE i < j VAL [i=6, j=94] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=7, j=93] [L11] COND TRUE i < j VAL [i=7, j=93] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=8, j=92] [L11] COND TRUE i < j VAL [i=8, j=92] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=9, j=91] [L11] COND TRUE i < j VAL [i=9, j=91] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=10, j=90] [L11] COND TRUE i < j VAL [i=10, j=90] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=11, j=89] [L11] COND TRUE i < j VAL [i=11, j=89] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=12, j=88] [L11] COND TRUE i < j VAL [i=12, j=88] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=13, j=87] [L11] COND TRUE i < j VAL [i=13, j=87] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=14, j=86] [L11] COND TRUE i < j VAL [i=14, j=86] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=15, j=85] [L11] COND TRUE i < j VAL [i=15, j=85] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=16, j=84] [L11] COND TRUE i < j VAL [i=16, j=84] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=17, j=83] [L11] COND TRUE i < j VAL [i=17, j=83] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=18, j=82] [L11] COND TRUE i < j VAL [i=18, j=82] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=19, j=81] [L11] COND TRUE i < j VAL [i=19, j=81] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=20, j=80] [L11] COND TRUE i < j VAL [i=20, j=80] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=21, j=79] [L11] COND TRUE i < j VAL [i=21, j=79] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=22, j=78] [L11] COND TRUE i < j VAL [i=22, j=78] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=23, j=77] [L11] COND TRUE i < j VAL [i=23, j=77] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=24, j=76] [L11] COND TRUE i < j VAL [i=24, j=76] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=25, j=75] [L11] COND TRUE i < j VAL [i=25, j=75] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=26, j=74] [L11] COND TRUE i < j VAL [i=26, j=74] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=27, j=73] [L11] COND TRUE i < j VAL [i=27, j=73] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=28, j=72] [L11] COND TRUE i < j VAL [i=28, j=72] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=29, j=71] [L11] COND TRUE i < j VAL [i=29, j=71] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=30, j=70] [L11] COND TRUE i < j VAL [i=30, j=70] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=31, j=69] [L11] COND TRUE i < j VAL [i=31, j=69] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=32, j=68] [L11] COND TRUE i < j VAL [i=32, j=68] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=33, j=67] [L11] COND TRUE i < j VAL [i=33, j=67] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=34, j=66] [L11] COND TRUE i < j VAL [i=34, j=66] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=35, j=65] [L11] COND TRUE i < j VAL [i=35, j=65] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=36, j=64] [L11] COND TRUE i < j VAL [i=36, j=64] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=37, j=63] [L11] COND TRUE i < j VAL [i=37, j=63] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=38, j=62] [L11] COND TRUE i < j VAL [i=38, j=62] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=39, j=61] [L11] COND TRUE i < j VAL [i=39, j=61] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=40, j=60] [L11] COND TRUE i < j VAL [i=40, j=60] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=41, j=59] [L11] COND TRUE i < j VAL [i=41, j=59] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=42, j=58] [L11] COND TRUE i < j VAL [i=42, j=58] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=43, j=57] [L11] COND TRUE i < j VAL [i=43, j=57] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=44, j=56] [L11] COND TRUE i < j VAL [i=44, j=56] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=45, j=55] [L11] COND TRUE i < j VAL [i=45, j=55] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=46, j=54] [L11] COND TRUE i < j VAL [i=46, j=54] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=47, j=53] [L11] COND TRUE i < j VAL [i=47, j=53] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=48, j=52] [L11] COND TRUE i < j VAL [i=48, j=52] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=49, j=51] [L11] COND TRUE i < j VAL [i=49, j=51] [L12] COND FALSE !(51 < j) [L13] i = i-1 [L13] j = j+1 VAL [i=48, j=52] [L11] COND TRUE i < j VAL [i=48, j=52] Loop: [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND FALSE !(51 < j) [L13] i = i-1 [L13] j = j+1 [L11] COND TRUE i < j 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 j; [L8] j = 100 [L9] i = 0 VAL [i=0, j=100] [L11] COND TRUE i < j VAL [i=0, j=100] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=1, j=99] [L11] COND TRUE i < j VAL [i=1, j=99] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=2, j=98] [L11] COND TRUE i < j VAL [i=2, j=98] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=3, j=97] [L11] COND TRUE i < j VAL [i=3, j=97] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=4, j=96] [L11] COND TRUE i < j VAL [i=4, j=96] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=5, j=95] [L11] COND TRUE i < j VAL [i=5, j=95] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=6, j=94] [L11] COND TRUE i < j VAL [i=6, j=94] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=7, j=93] [L11] COND TRUE i < j VAL [i=7, j=93] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=8, j=92] [L11] COND TRUE i < j VAL [i=8, j=92] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=9, j=91] [L11] COND TRUE i < j VAL [i=9, j=91] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=10, j=90] [L11] COND TRUE i < j VAL [i=10, j=90] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=11, j=89] [L11] COND TRUE i < j VAL [i=11, j=89] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=12, j=88] [L11] COND TRUE i < j VAL [i=12, j=88] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=13, j=87] [L11] COND TRUE i < j VAL [i=13, j=87] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=14, j=86] [L11] COND TRUE i < j VAL [i=14, j=86] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=15, j=85] [L11] COND TRUE i < j VAL [i=15, j=85] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=16, j=84] [L11] COND TRUE i < j VAL [i=16, j=84] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=17, j=83] [L11] COND TRUE i < j VAL [i=17, j=83] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=18, j=82] [L11] COND TRUE i < j VAL [i=18, j=82] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=19, j=81] [L11] COND TRUE i < j VAL [i=19, j=81] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=20, j=80] [L11] COND TRUE i < j VAL [i=20, j=80] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=21, j=79] [L11] COND TRUE i < j VAL [i=21, j=79] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=22, j=78] [L11] COND TRUE i < j VAL [i=22, j=78] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=23, j=77] [L11] COND TRUE i < j VAL [i=23, j=77] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=24, j=76] [L11] COND TRUE i < j VAL [i=24, j=76] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=25, j=75] [L11] COND TRUE i < j VAL [i=25, j=75] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=26, j=74] [L11] COND TRUE i < j VAL [i=26, j=74] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=27, j=73] [L11] COND TRUE i < j VAL [i=27, j=73] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=28, j=72] [L11] COND TRUE i < j VAL [i=28, j=72] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=29, j=71] [L11] COND TRUE i < j VAL [i=29, j=71] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=30, j=70] [L11] COND TRUE i < j VAL [i=30, j=70] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=31, j=69] [L11] COND TRUE i < j VAL [i=31, j=69] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=32, j=68] [L11] COND TRUE i < j VAL [i=32, j=68] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=33, j=67] [L11] COND TRUE i < j VAL [i=33, j=67] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=34, j=66] [L11] COND TRUE i < j VAL [i=34, j=66] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=35, j=65] [L11] COND TRUE i < j VAL [i=35, j=65] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=36, j=64] [L11] COND TRUE i < j VAL [i=36, j=64] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=37, j=63] [L11] COND TRUE i < j VAL [i=37, j=63] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=38, j=62] [L11] COND TRUE i < j VAL [i=38, j=62] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=39, j=61] [L11] COND TRUE i < j VAL [i=39, j=61] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=40, j=60] [L11] COND TRUE i < j VAL [i=40, j=60] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=41, j=59] [L11] COND TRUE i < j VAL [i=41, j=59] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=42, j=58] [L11] COND TRUE i < j VAL [i=42, j=58] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=43, j=57] [L11] COND TRUE i < j VAL [i=43, j=57] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=44, j=56] [L11] COND TRUE i < j VAL [i=44, j=56] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=45, j=55] [L11] COND TRUE i < j VAL [i=45, j=55] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=46, j=54] [L11] COND TRUE i < j VAL [i=46, j=54] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=47, j=53] [L11] COND TRUE i < j VAL [i=47, j=53] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=48, j=52] [L11] COND TRUE i < j VAL [i=48, j=52] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=49, j=51] [L11] COND TRUE i < j VAL [i=49, j=51] [L12] COND FALSE !(51 < j) [L13] i = i-1 [L13] j = j+1 VAL [i=48, j=52] [L11] COND TRUE i < j VAL [i=48, j=52] Loop: [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND FALSE !(51 < j) [L13] i = i-1 [L13] j = j+1 [L11] COND TRUE i < j End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-02-15 14:15:58,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:58,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2023-02-15 14:15:58,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2023-02-15 14:15:58,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-02-15 14:15:58,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-02-15 14:15:59,099 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)