./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 ff03de63 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-dev-ff03de6 [2021-12-21 21:57:53,784 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 21:57:53,785 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 21:57:53,823 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 21:57:53,825 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 21:57:53,829 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 21:57:53,830 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 21:57:53,833 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 21:57:53,835 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 21:57:53,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 21:57:53,839 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 21:57:53,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 21:57:53,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 21:57:53,842 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 21:57:53,843 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 21:57:53,844 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 21:57:53,845 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 21:57:53,846 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 21:57:53,849 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 21:57:53,850 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 21:57:53,853 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 21:57:53,854 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 21:57:53,855 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 21:57:53,855 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 21:57:53,857 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 21:57:53,858 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 21:57:53,858 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 21:57:53,859 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 21:57:53,860 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 21:57:53,860 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 21:57:53,860 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 21:57:53,861 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 21:57:53,862 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 21:57:53,863 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 21:57:53,863 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 21:57:53,864 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 21:57:53,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 21:57:53,864 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 21:57:53,864 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 21:57:53,865 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 21:57:53,865 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 21:57:53,866 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-21 21:57:53,892 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 21:57:53,892 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 21:57:53,893 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 21:57:53,893 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 21:57:53,894 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 21:57:53,894 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 21:57:53,894 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 21:57:53,894 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-21 21:57:53,894 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-21 21:57:53,894 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-21 21:57:53,895 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-21 21:57:53,895 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-21 21:57:53,895 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-21 21:57:53,896 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 21:57:53,896 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 21:57:53,896 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 21:57:53,896 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 21:57:53,896 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-21 21:57:53,896 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-21 21:57:53,896 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-21 21:57:53,896 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 21:57:53,897 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-21 21:57:53,897 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 21:57:53,897 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-21 21:57:53,897 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 21:57:53,897 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 21:57:53,897 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 21:57:53,897 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 21:57:53,898 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 21:57:53,898 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-21 21:57:53,898 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 [2021-12-21 21:57:54,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 21:57:54,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 21:57:54,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 21:57:54,062 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 21:57:54,063 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 21:57:54,063 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 [2021-12-21 21:57:54,099 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e94092cc8/dc8c6353ff264dbd8123610bf38d5bdf/FLAGbac9d7674 [2021-12-21 21:57:54,443 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 21:57:54,444 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_13.c [2021-12-21 21:57:54,447 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e94092cc8/dc8c6353ff264dbd8123610bf38d5bdf/FLAGbac9d7674 [2021-12-21 21:57:54,458 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e94092cc8/dc8c6353ff264dbd8123610bf38d5bdf [2021-12-21 21:57:54,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 21:57:54,461 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 21:57:54,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 21:57:54,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 21:57:54,465 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 21:57:54,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 09:57:54" (1/1) ... [2021-12-21 21:57:54,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4945aeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:54, skipping insertion in model container [2021-12-21 21:57:54,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 09:57:54" (1/1) ... [2021-12-21 21:57:54,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 21:57:54,477 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 21:57:54,585 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 21:57:54,593 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 21:57:54,601 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 21:57:54,608 INFO L208 MainTranslator]: Completed translation [2021-12-21 21:57:54,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:54 WrapperNode [2021-12-21 21:57:54,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 21:57:54,613 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 21:57:54,613 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 21:57:54,613 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 21:57:54,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:54" (1/1) ... [2021-12-21 21:57:54,622 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:54" (1/1) ... [2021-12-21 21:57:54,631 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 17 [2021-12-21 21:57:54,631 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 21:57:54,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 21:57:54,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 21:57:54,632 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 21:57:54,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:54" (1/1) ... [2021-12-21 21:57:54,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:54" (1/1) ... [2021-12-21 21:57:54,642 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:54" (1/1) ... [2021-12-21 21:57:54,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:54" (1/1) ... [2021-12-21 21:57:54,644 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:54" (1/1) ... [2021-12-21 21:57:54,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:54" (1/1) ... [2021-12-21 21:57:54,647 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:54" (1/1) ... [2021-12-21 21:57:54,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 21:57:54,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 21:57:54,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 21:57:54,649 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 21:57:54,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:54" (1/1) ... [2021-12-21 21:57:54,656 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:54,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:54,687 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) [2021-12-21 21:57:54,705 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 [2021-12-21 21:57:54,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 21:57:54,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 21:57:54,751 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 21:57:54,753 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 21:57:54,802 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 21:57:54,806 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 21:57:54,807 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-21 21:57:54,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 09:57:54 BoogieIcfgContainer [2021-12-21 21:57:54,808 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 21:57:54,809 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-21 21:57:54,809 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-21 21:57:54,811 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-21 21:57:54,812 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 21:57:54,812 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.12 09:57:54" (1/3) ... [2021-12-21 21:57:54,813 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54de2ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.12 09:57:54, skipping insertion in model container [2021-12-21 21:57:54,813 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 21:57:54,813 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:54" (2/3) ... [2021-12-21 21:57:54,813 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54de2ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.12 09:57:54, skipping insertion in model container [2021-12-21 21:57:54,813 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 21:57:54,814 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 09:57:54" (3/3) ... [2021-12-21 21:57:54,815 INFO L388 chiAutomizerObserver]: Analyzing ICFG NO_13.c [2021-12-21 21:57:54,843 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-21 21:57:54,843 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-21 21:57:54,844 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-21 21:57:54,844 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-21 21:57:54,844 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-21 21:57:54,844 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-21 21:57:54,844 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-21 21:57:54,844 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-21 21:57:54,853 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) [2021-12-21 21:57:54,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 21:57:54,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 21:57:54,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 21:57:54,868 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-21 21:57:54,868 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 21:57:54,869 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-21 21:57:54,869 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) [2021-12-21 21:57:54,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 21:57:54,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 21:57:54,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 21:57:54,870 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-21 21:57:54,870 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 21:57:54,874 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 7#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; 3#L12-2true [2021-12-21 21:57:54,875 INFO L793 eck$LassoCheckResult]: Loop: 3#L12-2true assume !!(main_~i~0#1 < main_~j~0#1); 9#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; 3#L12-2true [2021-12-21 21:57:54,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:54,879 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-21 21:57:54,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:54,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233213672] [2021-12-21 21:57:54,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:54,886 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:54,931 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:54,942 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:54,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:54,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 1 times [2021-12-21 21:57:54,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:54,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905541856] [2021-12-21 21:57:54,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:54,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:54,956 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:54,964 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:54,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:54,976 INFO L85 PathProgramCache]: Analyzing trace with hash 925800, now seen corresponding path program 1 times [2021-12-21 21:57:54,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:54,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026111024] [2021-12-21 21:57:54,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:54,977 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:55,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:55,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 21:57:55,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026111024] [2021-12-21 21:57:55,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026111024] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 21:57:55,018 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 21:57:55,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 21:57:55,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297733349] [2021-12-21 21:57:55,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 21:57:55,068 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:55,089 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:55,089 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:55,089 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:55,089 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-21 21:57:55,089 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:55,090 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:55,090 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:55,090 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration1_Loop [2021-12-21 21:57:55,090 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:55,090 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:55,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:55,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:55,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:55,201 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:55,202 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-21 21:57:55,203 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:55,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:55,205 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) [2021-12-21 21:57:55,206 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 [2021-12-21 21:57:55,207 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:55,207 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:55,231 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 21:57:55,232 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: [] [2021-12-21 21:57:55,249 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 [2021-12-21 21:57:55,249 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:55,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:55,251 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) [2021-12-21 21:57:55,252 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 [2021-12-21 21:57:55,253 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:55,253 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:55,265 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 21:57:55,265 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: [] [2021-12-21 21:57:55,280 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 [2021-12-21 21:57:55,281 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:55,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:55,282 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) [2021-12-21 21:57:55,283 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 [2021-12-21 21:57:55,284 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:55,284 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:55,321 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 [2021-12-21 21:57:55,322 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:55,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:55,324 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) [2021-12-21 21:57:55,325 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 [2021-12-21 21:57:55,328 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-21 21:57:55,328 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:55,361 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-21 21:57:55,365 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 [2021-12-21 21:57:55,365 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:55,365 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:55,365 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:55,365 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:55,366 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 21:57:55,366 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:55,366 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:55,366 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:55,366 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration1_Loop [2021-12-21 21:57:55,366 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:55,366 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:55,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:55,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:55,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:55,452 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:55,464 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 21:57:55,465 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:55,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:55,467 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) [2021-12-21 21:57:55,469 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 [2021-12-21 21:57:55,470 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 [2021-12-21 21:57:55,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:55,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:55,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:55,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:55,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 21:57:55,481 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 21:57:55,503 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 21:57:55,533 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 [2021-12-21 21:57:55,533 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:55,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:55,535 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) [2021-12-21 21:57:55,546 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 [2021-12-21 21:57:55,546 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 [2021-12-21 21:57:55,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:55,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:55,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:55,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:55,555 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 21:57:55,555 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 21:57:55,571 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 21:57:55,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:55,588 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:55,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:55,589 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) [2021-12-21 21:57:55,589 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 [2021-12-21 21:57:55,590 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 [2021-12-21 21:57:55,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:55,597 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 21:57:55,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:55,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:55,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:55,599 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 21:57:55,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 21:57:55,611 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-21 21:57:55,615 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-21 21:57:55,615 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-21 21:57:55,616 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:55,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:55,622 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) [2021-12-21 21:57:55,623 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 [2021-12-21 21:57:55,663 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-21 21:57:55,663 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-21 21:57:55,663 INFO L513 LassoAnalysis]: Proved termination. [2021-12-21 21:57:55,664 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 [] [2021-12-21 21:57:55,680 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 [2021-12-21 21:57:55,683 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-21 21:57:55,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:55,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:55,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:55,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:55,734 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 21:57:55,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:55,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:55,758 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2021-12-21 21:57:55,759 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) [2021-12-21 21:57:55,782 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. [2021-12-21 21:57:55,783 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 [2021-12-21 21:57:55,786 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) [2021-12-21 21:57:55,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2021-12-21 21:57:55,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 2 letters. [2021-12-21 21:57:55,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:55,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 2 letters. [2021-12-21 21:57:55,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:55,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 4 letters. [2021-12-21 21:57:55,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:55,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2021-12-21 21:57:55,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 21:57:55,792 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 8 states and 11 transitions. [2021-12-21 21:57:55,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2021-12-21 21:57:55,793 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-12-21 21:57:55,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2021-12-21 21:57:55,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 21:57:55,794 INFO L681 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2021-12-21 21:57:55,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2021-12-21 21:57:55,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-12-21 21:57:55,808 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) [2021-12-21 21:57:55,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2021-12-21 21:57:55,809 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2021-12-21 21:57:55,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 21:57:55,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 21:57:55,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 21:57:55,812 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) [2021-12-21 21:57:55,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 21:57:55,818 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2021-12-21 21:57:55,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 21:57:55,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. [2021-12-21 21:57:55,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 21:57:55,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 6 states and 7 transitions. [2021-12-21 21:57:55,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-12-21 21:57:55,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-12-21 21:57:55,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2021-12-21 21:57:55,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 21:57:55,820 INFO L681 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2021-12-21 21:57:55,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2021-12-21 21:57:55,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2021-12-21 21:57:55,821 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) [2021-12-21 21:57:55,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2021-12-21 21:57:55,821 INFO L704 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2021-12-21 21:57:55,822 INFO L587 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2021-12-21 21:57:55,822 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-21 21:57:55,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2021-12-21 21:57:55,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 21:57:55,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 21:57:55,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 21:57:55,822 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-21 21:57:55,823 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 21:57:55,823 INFO L791 eck$LassoCheckResult]: Stem: 86#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 87#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; 88#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 89#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; 84#L12-2 [2021-12-21 21:57:55,823 INFO L793 eck$LassoCheckResult]: Loop: 84#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 85#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; 84#L12-2 [2021-12-21 21:57:55,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:55,823 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2021-12-21 21:57:55,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:55,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600179086] [2021-12-21 21:57:55,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:55,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:55,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:55,828 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:55,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:55,831 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:55,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:55,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 2 times [2021-12-21 21:57:55,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:55,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731983244] [2021-12-21 21:57:55,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:55,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:55,836 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:55,840 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:55,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:55,842 INFO L85 PathProgramCache]: Analyzing trace with hash 889692235, now seen corresponding path program 1 times [2021-12-21 21:57:55,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:55,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783791910] [2021-12-21 21:57:55,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:55,842 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:55,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:55,861 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 21:57:55,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783791910] [2021-12-21 21:57:55,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783791910] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 21:57:55,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077626635] [2021-12-21 21:57:55,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:55,862 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 21:57:55,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:55,868 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) [2021-12-21 21:57:55,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-21 21:57:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:55,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-21 21:57:55,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:55,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:55,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 21:57:55,949 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 [2021-12-21 21:57:55,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:55,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077626635] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 21:57:55,967 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 21:57:55,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2021-12-21 21:57:55,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438035475] [2021-12-21 21:57:55,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 21:57:55,992 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:55,992 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:55,992 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:55,992 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:55,992 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-21 21:57:55,992 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:55,992 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:55,992 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:55,993 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration2_Loop [2021-12-21 21:57:55,993 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:55,993 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:55,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:55,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:56,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:56,039 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:56,040 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-21 21:57:56,040 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:56,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:56,056 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) [2021-12-21 21:57:56,077 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:56,077 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:56,088 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 [2021-12-21 21:57:56,094 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 21:57:56,094 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: [] [2021-12-21 21:57:56,111 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 [2021-12-21 21:57:56,111 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:56,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:56,112 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) [2021-12-21 21:57:56,114 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 [2021-12-21 21:57:56,115 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:56,115 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:56,126 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 21:57:56,127 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: [] [2021-12-21 21:57:56,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2021-12-21 21:57:56,143 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:56,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:56,144 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) [2021-12-21 21:57:56,150 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 [2021-12-21 21:57:56,151 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:56,151 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:56,188 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 [2021-12-21 21:57:56,188 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:56,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:56,189 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) [2021-12-21 21:57:56,191 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 [2021-12-21 21:57:56,192 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-21 21:57:56,192 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:56,223 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-21 21:57:56,228 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 [2021-12-21 21:57:56,228 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:56,229 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:56,229 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:56,229 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:56,229 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 21:57:56,229 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:56,229 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:56,229 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:56,229 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration2_Loop [2021-12-21 21:57:56,229 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:56,229 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:56,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:56,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:56,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:56,279 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:56,280 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 21:57:56,280 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:56,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:56,281 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) [2021-12-21 21:57:56,282 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 [2021-12-21 21:57:56,283 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 [2021-12-21 21:57:56,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:56,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:56,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:56,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:56,294 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 21:57:56,294 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 21:57:56,311 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 21:57:56,329 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 [2021-12-21 21:57:56,330 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:56,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:56,333 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) [2021-12-21 21:57:56,334 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 [2021-12-21 21:57:56,335 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 [2021-12-21 21:57:56,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:56,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:56,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:56,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:56,344 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 21:57:56,344 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 21:57:56,347 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 21:57:56,363 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 [2021-12-21 21:57:56,363 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:56,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:56,364 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) [2021-12-21 21:57:56,365 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 [2021-12-21 21:57:56,366 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 [2021-12-21 21:57:56,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:56,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 21:57:56,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:56,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:56,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:56,398 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 21:57:56,398 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 21:57:56,408 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-21 21:57:56,411 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-21 21:57:56,411 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-21 21:57:56,411 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:56,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:56,412 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) [2021-12-21 21:57:56,413 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 [2021-12-21 21:57:56,415 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-21 21:57:56,415 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-21 21:57:56,416 INFO L513 LassoAnalysis]: Proved termination. [2021-12-21 21:57:56,416 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 [] [2021-12-21 21:57:56,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 [2021-12-21 21:57:56,433 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-21 21:57:56,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:56,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:56,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:56,457 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 21:57:56,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:56,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:56,462 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2021-12-21 21:57:56,462 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) [2021-12-21 21:57:56,475 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. [2021-12-21 21:57:56,477 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 [2021-12-21 21:57:56,477 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) [2021-12-21 21:57:56,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2021-12-21 21:57:56,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 2 letters. [2021-12-21 21:57:56,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:56,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 6 letters. Loop has 2 letters. [2021-12-21 21:57:56,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:56,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 4 letters. [2021-12-21 21:57:56,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:56,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. [2021-12-21 21:57:56,480 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 21:57:56,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 13 transitions. [2021-12-21 21:57:56,481 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-12-21 21:57:56,481 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2021-12-21 21:57:56,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2021-12-21 21:57:56,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 21:57:56,481 INFO L681 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2021-12-21 21:57:56,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2021-12-21 21:57:56,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2021-12-21 21:57:56,483 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) [2021-12-21 21:57:56,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2021-12-21 21:57:56,483 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2021-12-21 21:57:56,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 21:57:56,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 21:57:56,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-21 21:57:56,485 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) [2021-12-21 21:57:56,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 21:57:56,508 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2021-12-21 21:57:56,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 21:57:56,509 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2021-12-21 21:57:56,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 21:57:56,512 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 13 transitions. [2021-12-21 21:57:56,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-12-21 21:57:56,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-12-21 21:57:56,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2021-12-21 21:57:56,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 21:57:56,513 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2021-12-21 21:57:56,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2021-12-21 21:57:56,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-12-21 21:57:56,517 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) [2021-12-21 21:57:56,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2021-12-21 21:57:56,518 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2021-12-21 21:57:56,518 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2021-12-21 21:57:56,518 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-21 21:57:56,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2021-12-21 21:57:56,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 21:57:56,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 21:57:56,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 21:57:56,520 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1] [2021-12-21 21:57:56,520 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 21:57:56,520 INFO L791 eck$LassoCheckResult]: Stem: 197#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 198#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; 199#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 200#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; 195#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 196#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; 206#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 205#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 [2021-12-21 21:57:56,520 INFO L793 eck$LassoCheckResult]: Loop: 202#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 201#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; 202#L12-2 [2021-12-21 21:57:56,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:56,521 INFO L85 PathProgramCache]: Analyzing trace with hash 742492623, now seen corresponding path program 2 times [2021-12-21 21:57:56,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:56,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424512433] [2021-12-21 21:57:56,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:56,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:56,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:56,532 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:56,538 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:56,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:56,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 3 times [2021-12-21 21:57:56,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:56,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704469162] [2021-12-21 21:57:56,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:56,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:56,541 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:56,543 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:56,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:56,544 INFO L85 PathProgramCache]: Analyzing trace with hash 570839924, now seen corresponding path program 2 times [2021-12-21 21:57:56,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:56,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858680932] [2021-12-21 21:57:56,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:56,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:56,576 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:56,576 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 21:57:56,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858680932] [2021-12-21 21:57:56,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858680932] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 21:57:56,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845635623] [2021-12-21 21:57:56,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 21:57:56,576 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 21:57:56,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:56,577 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) [2021-12-21 21:57:56,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-21 21:57:56,597 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 21:57:56,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 21:57:56,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 21:57:56,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:56,628 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:56,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 21:57:56,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:56,720 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:56,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845635623] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 21:57:56,720 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 21:57:56,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2021-12-21 21:57:56,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115308565] [2021-12-21 21:57:56,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 21:57:56,737 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:56,737 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:56,737 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:56,737 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:56,738 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-21 21:57:56,738 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:56,738 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:56,738 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:56,738 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration3_Loop [2021-12-21 21:57:56,738 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:56,738 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:56,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:56,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:56,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:56,773 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:56,774 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-21 21:57:56,774 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:56,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:56,775 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) [2021-12-21 21:57:56,779 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 [2021-12-21 21:57:56,780 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:56,780 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:56,791 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 21:57:56,791 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-21 21:57:56,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2021-12-21 21:57:56,807 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:56,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:56,808 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) [2021-12-21 21:57:56,809 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 [2021-12-21 21:57:56,810 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:56,810 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:56,839 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 [2021-12-21 21:57:56,839 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:56,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:56,840 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) [2021-12-21 21:57:56,841 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 [2021-12-21 21:57:56,842 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-21 21:57:56,842 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:56,870 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-21 21:57:56,873 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 [2021-12-21 21:57:56,873 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:56,873 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:56,873 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:56,873 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:56,873 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 21:57:56,873 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:56,873 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:56,873 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:56,873 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration3_Loop [2021-12-21 21:57:56,874 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:56,874 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:56,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:56,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:56,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:56,922 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:56,922 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 21:57:56,922 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:56,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:56,923 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) [2021-12-21 21:57:56,924 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 [2021-12-21 21:57:56,925 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 [2021-12-21 21:57:56,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:56,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:56,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:56,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:56,933 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 21:57:56,933 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 21:57:56,949 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 21:57:56,964 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 [2021-12-21 21:57:56,965 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:56,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:56,965 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) [2021-12-21 21:57:56,966 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 [2021-12-21 21:57:56,967 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 [2021-12-21 21:57:56,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:56,973 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 21:57:56,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:56,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:56,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:56,975 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 21:57:56,975 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 21:57:56,990 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-21 21:57:56,991 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-21 21:57:56,991 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-21 21:57:56,992 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:56,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:57,008 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) [2021-12-21 21:57:57,038 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 [2021-12-21 21:57:57,038 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-21 21:57:57,039 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-21 21:57:57,039 INFO L513 LassoAnalysis]: Proved termination. [2021-12-21 21:57:57,039 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 [] [2021-12-21 21:57:57,056 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 [2021-12-21 21:57:57,057 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-21 21:57:57,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:57,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:57,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:57,119 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 21:57:57,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:57,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:57,123 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2021-12-21 21:57:57,123 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) [2021-12-21 21:57:57,131 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. [2021-12-21 21:57:57,131 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 [2021-12-21 21:57:57,139 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) [2021-12-21 21:57:57,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2021-12-21 21:57:57,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 10 letters. Loop has 2 letters. [2021-12-21 21:57:57,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:57,140 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-21 21:57:57,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:57,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:57,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:57,188 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 21:57:57,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:57,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:57,192 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2021-12-21 21:57:57,192 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) [2021-12-21 21:57:57,199 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. [2021-12-21 21:57:57,199 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 [2021-12-21 21:57:57,200 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) [2021-12-21 21:57:57,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2021-12-21 21:57:57,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 10 letters. Loop has 2 letters. [2021-12-21 21:57:57,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:57,201 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-21 21:57:57,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:57,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:57,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:57,233 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 21:57:57,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:57,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:57,238 INFO L152 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 [2021-12-21 21:57:57,238 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) [2021-12-21 21:57:57,246 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. [2021-12-21 21:57:57,247 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 [2021-12-21 21:57:57,248 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) [2021-12-21 21:57:57,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2021-12-21 21:57:57,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 2 letters. [2021-12-21 21:57:57,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:57,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 12 letters. Loop has 2 letters. [2021-12-21 21:57:57,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:57,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 4 letters. [2021-12-21 21:57:57,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:57,251 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2021-12-21 21:57:57,254 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-21 21:57:57,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 14 states and 16 transitions. [2021-12-21 21:57:57,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2021-12-21 21:57:57,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-12-21 21:57:57,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2021-12-21 21:57:57,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 21:57:57,255 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-12-21 21:57:57,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2021-12-21 21:57:57,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2021-12-21 21:57:57,256 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) [2021-12-21 21:57:57,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-12-21 21:57:57,257 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-12-21 21:57:57,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 21:57:57,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-21 21:57:57,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2021-12-21 21:57:57,259 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) [2021-12-21 21:57:57,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 21:57:57,291 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2021-12-21 21:57:57,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 21:57:57,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 34 transitions. [2021-12-21 21:57:57,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-21 21:57:57,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 26 states and 28 transitions. [2021-12-21 21:57:57,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2021-12-21 21:57:57,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2021-12-21 21:57:57,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2021-12-21 21:57:57,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 21:57:57,296 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2021-12-21 21:57:57,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2021-12-21 21:57:57,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2021-12-21 21:57:57,299 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) [2021-12-21 21:57:57,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2021-12-21 21:57:57,300 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2021-12-21 21:57:57,300 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2021-12-21 21:57:57,300 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-21 21:57:57,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 27 transitions. [2021-12-21 21:57:57,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-21 21:57:57,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 21:57:57,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 21:57:57,303 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 1, 1] [2021-12-21 21:57:57,303 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 21:57:57,303 INFO L791 eck$LassoCheckResult]: Stem: 513#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 514#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; 515#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; 508#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 509#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; 532#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 531#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; 530#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 529#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; 528#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 527#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; 526#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 525#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; 524#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 523#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; 522#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 521#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; 520#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 519#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; 518#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 512#L12 [2021-12-21 21:57:57,303 INFO L793 eck$LassoCheckResult]: Loop: 512#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); 512#L12 [2021-12-21 21:57:57,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:57,304 INFO L85 PathProgramCache]: Analyzing trace with hash -926509747, now seen corresponding path program 3 times [2021-12-21 21:57:57,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:57,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352791341] [2021-12-21 21:57:57,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:57,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:57,333 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:57,355 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:57,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:57,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1406, now seen corresponding path program 1 times [2021-12-21 21:57:57,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:57,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943474176] [2021-12-21 21:57:57,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:57,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:57,364 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:57,368 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:57,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:57,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1317636150, now seen corresponding path program 4 times [2021-12-21 21:57:57,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:57,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828273321] [2021-12-21 21:57:57,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:57,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:57,382 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:57,411 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:57,426 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:57,426 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:57,426 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:57,426 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:57,426 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-21 21:57:57,427 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:57,427 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:57,427 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:57,427 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration4_Loop [2021-12-21 21:57:57,427 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:57,427 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:57,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:57,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:57,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:57,460 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:57,461 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-21 21:57:57,461 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:57,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:57,475 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) [2021-12-21 21:57:57,476 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 [2021-12-21 21:57:57,477 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:57,477 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:57,499 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 21:57:57,499 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: [] [2021-12-21 21:57:57,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:57,518 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:57,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:57,519 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) [2021-12-21 21:57:57,523 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:57,524 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:57,524 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 [2021-12-21 21:57:57,559 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 [2021-12-21 21:57:57,559 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:57,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:57,562 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) [2021-12-21 21:57:57,565 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 [2021-12-21 21:57:57,565 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-21 21:57:57,565 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:57,593 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-21 21:57:57,598 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 [2021-12-21 21:57:57,598 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:57,598 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:57,598 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:57,598 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:57,598 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 21:57:57,598 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:57,598 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:57,598 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:57,598 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration4_Loop [2021-12-21 21:57:57,598 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:57,598 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:57,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:57,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:57,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:57,633 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:57,633 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 21:57:57,633 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:57,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:57,634 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) [2021-12-21 21:57:57,636 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 [2021-12-21 21:57:57,637 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 [2021-12-21 21:57:57,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:57,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:57,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:57,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:57,645 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 21:57:57,645 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 21:57:57,660 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 21:57:57,682 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 [2021-12-21 21:57:57,682 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:57,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:57,683 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) [2021-12-21 21:57:57,683 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 [2021-12-21 21:57:57,685 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 [2021-12-21 21:57:57,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:57,691 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 21:57:57,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:57,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:57,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:57,692 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 21:57:57,692 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 21:57:57,721 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-21 21:57:57,724 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-21 21:57:57,724 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-21 21:57:57,724 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:57,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:57,740 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) [2021-12-21 21:57:57,741 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 [2021-12-21 21:57:57,741 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-21 21:57:57,741 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-21 21:57:57,741 INFO L513 LassoAnalysis]: Proved termination. [2021-12-21 21:57:57,741 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 [] [2021-12-21 21:57:57,774 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 [2021-12-21 21:57:57,774 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-21 21:57:57,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:57,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:57,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:57,823 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 21:57:57,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:57,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:57,847 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-21 21:57:57,847 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) [2021-12-21 21:57:57,855 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. [2021-12-21 21:57:57,855 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 [2021-12-21 21:57:57,856 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) [2021-12-21 21:57:57,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2021-12-21 21:57:57,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 21 letters. Loop has 2 letters. [2021-12-21 21:57:57,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:57,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 23 letters. Loop has 2 letters. [2021-12-21 21:57:57,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:57,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 21 letters. Loop has 4 letters. [2021-12-21 21:57:57,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:57,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 42 transitions. [2021-12-21 21:57:57,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-21 21:57:57,866 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 28 states and 31 transitions. [2021-12-21 21:57:57,866 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-12-21 21:57:57,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-12-21 21:57:57,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2021-12-21 21:57:57,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 21:57:57,866 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2021-12-21 21:57:57,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2021-12-21 21:57:57,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2021-12-21 21:57:57,867 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) [2021-12-21 21:57:57,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2021-12-21 21:57:57,867 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2021-12-21 21:57:57,867 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2021-12-21 21:57:57,867 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-21 21:57:57,867 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. [2021-12-21 21:57:57,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-21 21:57:57,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 21:57:57,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 21:57:57,868 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [12, 10, 1, 1, 1] [2021-12-21 21:57:57,868 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 21:57:57,868 INFO L791 eck$LassoCheckResult]: Stem: 665#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 666#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; 661#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 662#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); 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; 663#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 664#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; 687#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 686#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; 685#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 684#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; 683#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 682#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); 671#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; 669#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 670#L12 [2021-12-21 21:57:57,868 INFO L793 eck$LassoCheckResult]: Loop: 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; 672#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 670#L12 [2021-12-21 21:57:57,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:57,869 INFO L85 PathProgramCache]: Analyzing trace with hash 767012677, now seen corresponding path program 3 times [2021-12-21 21:57:57,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:57,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842745070] [2021-12-21 21:57:57,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:57,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:57,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:57,919 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 [2021-12-21 21:57:57,984 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:57,984 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 21:57:57,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842745070] [2021-12-21 21:57:57,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842745070] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 21:57:57,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536458151] [2021-12-21 21:57:57,985 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-21 21:57:57,985 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 21:57:57,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:57,986 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) [2021-12-21 21:57:57,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2021-12-21 21:57:58,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2021-12-21 21:57:58,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 21:57:58,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-21 21:57:58,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:58,057 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:58,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 21:57:58,233 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:58,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536458151] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 21:57:58,233 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 21:57:58,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2021-12-21 21:57:58,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542241781] [2021-12-21 21:57:58,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 21:57:58,234 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 21:57:58,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:58,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1406, now seen corresponding path program 2 times [2021-12-21 21:57:58,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:58,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576799911] [2021-12-21 21:57:58,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:58,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:58,237 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:58,238 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:58,253 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:58,254 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:58,254 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:58,254 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:58,254 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-21 21:57:58,254 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:58,254 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:58,254 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:58,254 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration5_Loop [2021-12-21 21:57:58,254 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:58,254 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:58,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:58,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:58,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:58,287 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:58,287 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-21 21:57:58,287 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:58,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:58,288 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) [2021-12-21 21:57:58,289 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 [2021-12-21 21:57:58,290 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:58,290 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:58,311 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 21:57:58,311 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-21 21:57:58,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2021-12-21 21:57:58,327 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:58,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:58,339 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) [2021-12-21 21:57:58,340 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 [2021-12-21 21:57:58,342 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:58,342 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:58,371 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 21:57:58,371 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-21 21:57:58,389 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 [2021-12-21 21:57:58,390 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:58,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:58,391 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) [2021-12-21 21:57:58,393 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 [2021-12-21 21:57:58,394 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:58,394 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:58,419 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 [2021-12-21 21:57:58,419 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:58,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:58,420 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) [2021-12-21 21:57:58,421 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 [2021-12-21 21:57:58,422 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-21 21:57:58,422 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:58,467 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-21 21:57:58,472 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 [2021-12-21 21:57:58,472 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:58,472 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:58,473 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:58,473 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:58,473 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 21:57:58,473 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:58,473 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:58,473 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:58,473 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration5_Loop [2021-12-21 21:57:58,473 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:58,473 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:58,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:58,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:58,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:58,506 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:58,507 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 21:57:58,507 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:58,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:58,508 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) [2021-12-21 21:57:58,509 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 [2021-12-21 21:57:58,510 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 [2021-12-21 21:57:58,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:58,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:58,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:58,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:58,517 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 21:57:58,517 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 21:57:58,520 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 21:57:58,536 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 [2021-12-21 21:57:58,537 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:58,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:58,538 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:58,543 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 [2021-12-21 21:57:58,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:58,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:58,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:58,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:58,551 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 21:57:58,551 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 21:57:58,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-12-21 21:57:58,579 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 21:57:58,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:58,597 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:58,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:58,598 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:58,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-12-21 21:57:58,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 21:57:58,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:58,606 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 21:57:58,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:58,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:58,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:58,607 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 21:57:58,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 21:57:58,622 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-21 21:57:58,623 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2021-12-21 21:57:58,623 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-21 21:57:58,624 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:58,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:58,624 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:58,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-12-21 21:57:58,629 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-21 21:57:58,629 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-21 21:57:58,629 INFO L513 LassoAnalysis]: Proved termination. [2021-12-21 21:57:58,630 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 [] [2021-12-21 21:57:58,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:58,645 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-21 21:57:58,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:58,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:58,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:58,719 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 21:57:58,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:58,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:58,735 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-21 21:57:58,735 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) [2021-12-21 21:57:58,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 38 states and 42 transitions. Complement of second has 5 states. [2021-12-21 21:57:58,742 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 [2021-12-21 21:57:58,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) [2021-12-21 21:57:58,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2021-12-21 21:57:58,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 25 letters. Loop has 2 letters. [2021-12-21 21:57:58,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:58,743 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-21 21:57:58,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:58,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:58,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:58,799 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 21:57:58,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:58,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:58,810 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-21 21:57:58,811 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) [2021-12-21 21:57:58,819 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. [2021-12-21 21:57:58,820 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 [2021-12-21 21:57:58,820 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) [2021-12-21 21:57:58,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2021-12-21 21:57:58,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 25 letters. Loop has 2 letters. [2021-12-21 21:57:58,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:58,821 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-21 21:57:58,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:58,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:58,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:58,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:58,886 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 21:57:58,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:58,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:58,898 INFO L152 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 [2021-12-21 21:57:58,898 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) [2021-12-21 21:57:58,904 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. [2021-12-21 21:57:58,904 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 [2021-12-21 21:57:58,905 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) [2021-12-21 21:57:58,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-21 21:57:58,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 25 letters. Loop has 2 letters. [2021-12-21 21:57:58,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:58,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 27 letters. Loop has 2 letters. [2021-12-21 21:57:58,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:58,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 25 letters. Loop has 4 letters. [2021-12-21 21:57:58,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:58,907 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 45 transitions. [2021-12-21 21:57:58,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-21 21:57:58,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 29 states and 32 transitions. [2021-12-21 21:57:58,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2021-12-21 21:57:58,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2021-12-21 21:57:58,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 32 transitions. [2021-12-21 21:57:58,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 21:57:58,908 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 32 transitions. [2021-12-21 21:57:58,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 32 transitions. [2021-12-21 21:57:58,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2021-12-21 21:57:58,909 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) [2021-12-21 21:57:58,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2021-12-21 21:57:58,909 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2021-12-21 21:57:58,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 21:57:58,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-21 21:57:58,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2021-12-21 21:57:58,910 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) [2021-12-21 21:57:58,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 21:57:58,952 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2021-12-21 21:57:58,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-21 21:57:58,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 65 transitions. [2021-12-21 21:57:58,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-21 21:57:58,954 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 51 states and 53 transitions. [2021-12-21 21:57:58,954 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2021-12-21 21:57:58,954 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2021-12-21 21:57:58,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 53 transitions. [2021-12-21 21:57:58,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 21:57:58,954 INFO L681 BuchiCegarLoop]: Abstraction has 51 states and 53 transitions. [2021-12-21 21:57:58,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 53 transitions. [2021-12-21 21:57:58,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2021-12-21 21:57:58,956 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) [2021-12-21 21:57:58,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2021-12-21 21:57:58,956 INFO L704 BuchiCegarLoop]: Abstraction has 50 states and 52 transitions. [2021-12-21 21:57:58,956 INFO L587 BuchiCegarLoop]: Abstraction has 50 states and 52 transitions. [2021-12-21 21:57:58,956 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-21 21:57:58,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 52 transitions. [2021-12-21 21:57:58,957 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-21 21:57:58,957 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 21:57:58,957 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 21:57:58,958 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [24, 22, 1, 1, 1] [2021-12-21 21:57:58,958 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-12-21 21:57:58,958 INFO L791 eck$LassoCheckResult]: Stem: 1337#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1338#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; 1333#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 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; 1339#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; 1335#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; 1382#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1381#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; 1380#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1379#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; 1378#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1377#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; 1376#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1375#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; 1374#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1373#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; 1372#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1371#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; 1370#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1369#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; 1368#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1367#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; 1366#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1365#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; 1364#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1363#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; 1362#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1361#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; 1360#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1359#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; 1358#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1357#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; 1356#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1355#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; 1354#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1353#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; 1352#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1351#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; 1350#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1349#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; 1348#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1347#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; 1346#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1345#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; 1344#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1343#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; 1341#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1342#L12 [2021-12-21 21:57:58,958 INFO L793 eck$LassoCheckResult]: Loop: 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; 1344#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1343#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; 1341#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1342#L12 [2021-12-21 21:57:58,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:58,959 INFO L85 PathProgramCache]: Analyzing trace with hash -694298463, now seen corresponding path program 4 times [2021-12-21 21:57:58,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:58,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106519530] [2021-12-21 21:57:58,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:58,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:59,194 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:59,194 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 21:57:59,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106519530] [2021-12-21 21:57:59,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106519530] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 21:57:59,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625934945] [2021-12-21 21:57:59,194 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-21 21:57:59,194 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 21:57:59,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:59,195 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 21:57:59,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2021-12-21 21:57:59,226 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-21 21:57:59,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 21:57:59,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-21 21:57:59,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:59,308 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:59,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 21:57:59,878 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:59,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625934945] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 21:57:59,878 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 21:57:59,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2021-12-21 21:57:59,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604156407] [2021-12-21 21:57:59,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 21:57:59,879 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 21:57:59,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:59,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 1 times [2021-12-21 21:57:59,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:59,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817644605] [2021-12-21 21:57:59,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:59,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:59,882 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:59,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:59,883 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:59,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 21:57:59,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-21 21:57:59,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2021-12-21 21:57:59,916 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) [2021-12-21 21:58:00,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 21:58:00,012 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2021-12-21 21:58:00,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-12-21 21:58:00,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 125 transitions. [2021-12-21 21:58:00,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-21 21:58:00,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 99 states and 101 transitions. [2021-12-21 21:58:00,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2021-12-21 21:58:00,014 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2021-12-21 21:58:00,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 101 transitions. [2021-12-21 21:58:00,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 21:58:00,014 INFO L681 BuchiCegarLoop]: Abstraction has 99 states and 101 transitions. [2021-12-21 21:58:00,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 101 transitions. [2021-12-21 21:58:00,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2021-12-21 21:58:00,017 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) [2021-12-21 21:58:00,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2021-12-21 21:58:00,018 INFO L704 BuchiCegarLoop]: Abstraction has 98 states and 100 transitions. [2021-12-21 21:58:00,018 INFO L587 BuchiCegarLoop]: Abstraction has 98 states and 100 transitions. [2021-12-21 21:58:00,018 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-21 21:58:00,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 100 transitions. [2021-12-21 21:58:00,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-21 21:58:00,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 21:58:00,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 21:58:00,020 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [48, 46, 1, 1, 1] [2021-12-21 21:58:00,020 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-12-21 21:58:00,021 INFO L791 eck$LassoCheckResult]: Stem: 1849#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1850#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; 1845#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 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; 1851#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; 1847#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; 1942#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1941#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; 1940#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1939#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; 1938#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1937#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; 1936#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1935#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; 1934#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1933#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; 1932#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1931#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; 1930#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1929#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; 1928#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1927#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; 1926#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1925#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; 1924#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1923#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; 1922#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1921#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; 1920#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1919#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; 1918#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1917#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; 1916#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1915#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; 1914#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1913#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; 1912#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1911#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; 1910#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1909#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; 1908#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1907#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; 1906#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1905#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; 1904#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1903#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; 1902#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1901#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; 1900#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1899#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; 1898#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1897#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; 1896#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1895#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; 1894#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1893#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; 1892#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1891#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; 1890#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1889#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; 1888#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1887#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; 1886#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1885#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; 1884#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1883#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; 1882#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1881#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; 1880#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1879#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; 1878#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1877#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; 1876#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1875#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; 1874#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1873#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; 1872#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1871#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; 1870#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1869#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; 1868#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1867#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; 1866#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1865#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; 1864#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1863#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; 1862#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1861#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; 1860#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1859#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; 1858#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1857#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; 1856#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1855#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; 1853#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1854#L12 [2021-12-21 21:58:00,021 INFO L793 eck$LassoCheckResult]: Loop: 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; 1856#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1855#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; 1853#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1854#L12 [2021-12-21 21:58:00,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:58:00,021 INFO L85 PathProgramCache]: Analyzing trace with hash -818401447, now seen corresponding path program 5 times [2021-12-21 21:58:00,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:58:00,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788987099] [2021-12-21 21:58:00,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:58:00,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:58:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:58:00,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:58:00,882 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 21:58:00,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788987099] [2021-12-21 21:58:00,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788987099] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 21:58:00,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724097801] [2021-12-21 21:58:00,882 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-21 21:58:00,882 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 21:58:00,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:58:00,883 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 21:58:00,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2021-12-21 21:58:00,943 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2021-12-21 21:58:00,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 21:58:00,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-21 21:58:00,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:58:01,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:58:01,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 21:58:01,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:58:01,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724097801] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 21:58:01,380 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 21:58:01,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 51 [2021-12-21 21:58:01,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323439939] [2021-12-21 21:58:01,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 21:58:01,381 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 21:58:01,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:58:01,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 2 times [2021-12-21 21:58:01,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:58:01,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035061745] [2021-12-21 21:58:01,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:58:01,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:58:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:58:01,384 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:58:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:58:01,386 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:58:01,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 21:58:01,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-12-21 21:58:01,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2021-12-21 21:58:01,418 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) [2021-12-21 21:58:01,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 21:58:01,514 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2021-12-21 21:58:01,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-12-21 21:58:01,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 110 transitions. [2021-12-21 21:58:01,516 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-21 21:58:01,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 107 transitions. [2021-12-21 21:58:01,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2021-12-21 21:58:01,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2021-12-21 21:58:01,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 107 transitions. [2021-12-21 21:58:01,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 21:58:01,517 INFO L681 BuchiCegarLoop]: Abstraction has 105 states and 107 transitions. [2021-12-21 21:58:01,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 107 transitions. [2021-12-21 21:58:01,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2021-12-21 21:58:01,519 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) [2021-12-21 21:58:01,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2021-12-21 21:58:01,520 INFO L704 BuchiCegarLoop]: Abstraction has 104 states and 106 transitions. [2021-12-21 21:58:01,520 INFO L587 BuchiCegarLoop]: Abstraction has 104 states and 106 transitions. [2021-12-21 21:58:01,520 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-21 21:58:01,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 106 transitions. [2021-12-21 21:58:01,521 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-21 21:58:01,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 21:58:01,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 21:58:01,522 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [51, 49, 1, 1, 1] [2021-12-21 21:58:01,522 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-12-21 21:58:01,522 INFO L791 eck$LassoCheckResult]: Stem: 2685#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2686#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; 2681#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 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; 2687#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; 2683#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; 2784#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2783#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; 2782#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2781#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; 2780#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2779#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; 2778#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2777#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; 2776#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2775#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; 2774#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2773#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; 2772#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2771#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; 2770#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2769#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; 2768#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2767#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; 2766#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2765#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; 2764#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2763#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; 2762#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2761#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; 2760#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2759#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; 2758#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2757#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; 2756#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2755#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; 2754#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2753#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; 2752#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2751#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; 2750#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2749#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; 2748#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2747#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; 2746#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2745#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; 2744#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2743#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; 2742#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2741#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; 2740#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2739#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; 2738#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2737#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; 2736#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2735#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; 2734#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2733#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; 2732#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2731#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; 2730#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2729#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; 2728#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2727#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; 2726#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2725#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; 2724#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2723#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; 2722#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2721#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; 2720#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2719#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; 2718#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2717#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; 2716#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2715#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; 2714#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2713#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; 2712#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2711#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; 2710#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2709#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; 2708#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2707#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; 2706#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2705#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; 2704#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2703#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; 2702#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2701#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; 2700#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2699#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; 2698#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2697#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; 2696#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2695#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; 2694#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2693#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; 2692#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2691#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; 2689#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2690#L12 [2021-12-21 21:58:01,522 INFO L793 eck$LassoCheckResult]: Loop: 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; 2692#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2691#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; 2689#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2690#L12 [2021-12-21 21:58:01,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:58:01,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1994822288, now seen corresponding path program 6 times [2021-12-21 21:58:01,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:58:01,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251296007] [2021-12-21 21:58:01,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:58:01,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:58:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:58:01,547 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:58:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:58:01,571 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:58:01,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:58:01,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 3 times [2021-12-21 21:58:01,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:58:01,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544641198] [2021-12-21 21:58:01,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:58:01,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:58:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:58:01,573 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:58:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:58:01,574 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:58:01,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:58:01,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1522445560, now seen corresponding path program 7 times [2021-12-21 21:58:01,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:58:01,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539651609] [2021-12-21 21:58:01,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:58:01,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:58:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:58:01,599 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:58:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:58:01,643 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:58:03,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.12 09:58:03 BoogieIcfgContainer [2021-12-21 21:58:03,644 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-21 21:58:03,645 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 21:58:03,645 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 21:58:03,645 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 21:58:03,645 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 09:57:54" (3/4) ... [2021-12-21 21:58:03,647 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-12-21 21:58:03,676 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-21 21:58:03,677 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 21:58:03,677 INFO L158 Benchmark]: Toolchain (without parser) took 9215.95ms. Allocated memory was 100.7MB in the beginning and 146.8MB in the end (delta: 46.1MB). Free memory was 73.2MB in the beginning and 50.3MB in the end (delta: 22.8MB). Peak memory consumption was 68.0MB. Max. memory is 16.1GB. [2021-12-21 21:58:03,677 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 81.8MB. Free memory is still 43.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 21:58:03,677 INFO L158 Benchmark]: CACSL2BoogieTranslator took 147.09ms. Allocated memory is still 100.7MB. Free memory was 72.9MB in the beginning and 79.1MB in the end (delta: -6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-21 21:58:03,678 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.40ms. Allocated memory is still 100.7MB. Free memory was 79.1MB in the beginning and 77.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 21:58:03,678 INFO L158 Benchmark]: Boogie Preprocessor took 16.07ms. Allocated memory is still 100.7MB. Free memory was 77.9MB in the beginning and 76.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 21:58:03,678 INFO L158 Benchmark]: RCFGBuilder took 159.62ms. Allocated memory is still 100.7MB. Free memory was 76.8MB in the beginning and 69.2MB in the end (delta: 7.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-21 21:58:03,678 INFO L158 Benchmark]: BuchiAutomizer took 8835.75ms. Allocated memory was 100.7MB in the beginning and 146.8MB in the end (delta: 46.1MB). Free memory was 69.2MB in the beginning and 53.4MB in the end (delta: 15.7MB). Peak memory consumption was 83.0MB. Max. memory is 16.1GB. [2021-12-21 21:58:03,679 INFO L158 Benchmark]: Witness Printer took 31.78ms. Allocated memory is still 146.8MB. Free memory was 53.4MB in the beginning and 50.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 21:58:03,680 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 81.8MB. Free memory is still 43.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 147.09ms. Allocated memory is still 100.7MB. Free memory was 72.9MB in the beginning and 79.1MB in the end (delta: -6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.40ms. Allocated memory is still 100.7MB. Free memory was 79.1MB in the beginning and 77.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.07ms. Allocated memory is still 100.7MB. Free memory was 77.9MB in the beginning and 76.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 159.62ms. Allocated memory is still 100.7MB. Free memory was 76.8MB in the beginning and 69.2MB in the end (delta: 7.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 8835.75ms. Allocated memory was 100.7MB in the beginning and 146.8MB in the end (delta: 46.1MB). Free memory was 69.2MB in the beginning and 53.4MB in the end (delta: 15.7MB). Peak memory consumption was 83.0MB. Max. memory is 16.1GB. * Witness Printer took 31.78ms. Allocated memory is still 146.8MB. Free memory was 53.4MB in the beginning and 50.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 8.7s and 8 iterations. TraceHistogramMax:51. Analysis of lassos took 7.6s. 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 104 states and ocurred in iteration 7. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 348 IncrementalHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 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 hnf93 smp100 dnf100 smp100 tf106 neg98 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 38ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 12]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {j=52, i=48, \result=0} - 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 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [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 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! [2021-12-21 21:58:03,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2021-12-21 21:58:03,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2021-12-21 21:58:04,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2021-12-21 21:58:04,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-12-21 21:58:04,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-21 21:58:04,745 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)