./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/NO_22.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version ae007674 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_22.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 2aebec197cf7bd355d2eb5f718c983de149eae8f5ff2da107813d58a220d4744 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 09:04:24,968 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 09:04:24,971 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 09:04:25,008 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 09:04:25,009 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 09:04:25,012 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 09:04:25,013 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 09:04:25,018 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 09:04:25,020 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 09:04:25,024 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 09:04:25,025 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 09:04:25,026 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 09:04:25,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 09:04:25,029 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 09:04:25,030 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 09:04:25,034 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 09:04:25,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 09:04:25,036 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 09:04:25,038 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 09:04:25,042 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 09:04:25,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 09:04:25,044 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 09:04:25,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 09:04:25,047 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 09:04:25,053 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 09:04:25,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 09:04:25,053 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 09:04:25,055 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 09:04:25,055 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 09:04:25,056 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 09:04:25,056 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 09:04:25,057 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 09:04:25,058 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 09:04:25,059 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 09:04:25,060 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 09:04:25,060 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 09:04:25,061 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 09:04:25,061 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 09:04:25,061 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 09:04:25,062 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 09:04:25,063 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 09:04:25,064 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-28 09:04:25,098 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 09:04:25,098 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 09:04:25,099 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 09:04:25,099 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 09:04:25,101 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 09:04:25,101 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 09:04:25,101 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 09:04:25,102 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-28 09:04:25,102 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-28 09:04:25,102 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-28 09:04:25,103 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-28 09:04:25,103 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-28 09:04:25,103 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-28 09:04:25,104 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 09:04:25,104 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 09:04:25,104 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 09:04:25,104 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 09:04:25,104 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-28 09:04:25,105 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-28 09:04:25,105 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-28 09:04:25,105 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 09:04:25,105 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-28 09:04:25,105 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 09:04:25,106 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-28 09:04:25,106 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 09:04:25,106 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 09:04:25,106 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 09:04:25,107 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 09:04:25,117 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-28 09:04:25,117 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 -> 2aebec197cf7bd355d2eb5f718c983de149eae8f5ff2da107813d58a220d4744 [2021-12-28 09:04:25,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 09:04:25,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 09:04:25,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 09:04:25,452 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 09:04:25,453 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 09:04:25,455 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/NO_22.c [2021-12-28 09:04:25,513 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1275e9c32/a87ccc92c0424dc98fc9207d3ff39bd9/FLAGd2f68a7c8 [2021-12-28 09:04:25,894 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 09:04:25,894 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_22.c [2021-12-28 09:04:25,899 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1275e9c32/a87ccc92c0424dc98fc9207d3ff39bd9/FLAGd2f68a7c8 [2021-12-28 09:04:25,909 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1275e9c32/a87ccc92c0424dc98fc9207d3ff39bd9 [2021-12-28 09:04:25,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 09:04:25,912 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 09:04:25,913 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 09:04:25,913 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 09:04:25,916 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 09:04:25,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 09:04:25" (1/1) ... [2021-12-28 09:04:25,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1addde9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:04:25, skipping insertion in model container [2021-12-28 09:04:25,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 09:04:25" (1/1) ... [2021-12-28 09:04:25,923 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 09:04:25,931 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 09:04:26,022 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 09:04:26,026 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 09:04:26,036 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 09:04:26,045 INFO L208 MainTranslator]: Completed translation [2021-12-28 09:04:26,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:04:26 WrapperNode [2021-12-28 09:04:26,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 09:04:26,046 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 09:04:26,047 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 09:04:26,047 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 09:04:26,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:04:26" (1/1) ... [2021-12-28 09:04:26,056 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:04:26" (1/1) ... [2021-12-28 09:04:26,104 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13 [2021-12-28 09:04:26,105 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 09:04:26,106 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 09:04:26,106 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 09:04:26,106 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 09:04:26,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:04:26" (1/1) ... [2021-12-28 09:04:26,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:04:26" (1/1) ... [2021-12-28 09:04:26,113 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:04:26" (1/1) ... [2021-12-28 09:04:26,113 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:04:26" (1/1) ... [2021-12-28 09:04:26,114 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:04:26" (1/1) ... [2021-12-28 09:04:26,117 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:04:26" (1/1) ... [2021-12-28 09:04:26,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:04:26" (1/1) ... [2021-12-28 09:04:26,119 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 09:04:26,120 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 09:04:26,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 09:04:26,121 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 09:04:26,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:04:26" (1/1) ... [2021-12-28 09:04:26,127 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:26,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:04:26,152 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-28 09:04:26,175 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-28 09:04:26,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 09:04:26,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 09:04:26,236 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 09:04:26,237 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 09:04:26,313 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 09:04:26,319 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 09:04:26,319 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-28 09:04:26,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 09:04:26 BoogieIcfgContainer [2021-12-28 09:04:26,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 09:04:26,322 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-28 09:04:26,322 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-28 09:04:26,325 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-28 09:04:26,326 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-28 09:04:26,326 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.12 09:04:25" (1/3) ... [2021-12-28 09:04:26,328 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@179f498a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.12 09:04:26, skipping insertion in model container [2021-12-28 09:04:26,328 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-28 09:04:26,328 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:04:26" (2/3) ... [2021-12-28 09:04:26,328 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@179f498a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.12 09:04:26, skipping insertion in model container [2021-12-28 09:04:26,329 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-28 09:04:26,329 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 09:04:26" (3/3) ... [2021-12-28 09:04:26,330 INFO L388 chiAutomizerObserver]: Analyzing ICFG NO_22.c [2021-12-28 09:04:26,375 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-28 09:04:26,375 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-28 09:04:26,376 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-28 09:04:26,376 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-28 09:04:26,376 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-28 09:04:26,376 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-28 09:04:26,376 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-28 09:04:26,376 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-28 09:04:26,388 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-28 09:04:26,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-28 09:04:26,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:04:26,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:04:26,408 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-28 09:04:26,408 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-28 09:04:26,408 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-28 09:04:26,408 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-28 09:04:26,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-28 09:04:26,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:04:26,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:04:26,410 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-28 09:04:26,410 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-28 09:04:26,415 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 4#L10-2true [2021-12-28 09:04:26,415 INFO L793 eck$LassoCheckResult]: Loop: 4#L10-2true assume !!(main_~i~0#1 < 100); 6#L10true assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 4#L10-2true [2021-12-28 09:04:26,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:04:26,421 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-28 09:04:26,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:04:26,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263698471] [2021-12-28 09:04:26,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:04:26,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:04:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:04:26,494 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:04:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:04:26,516 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:04:26,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:04:26,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 1 times [2021-12-28 09:04:26,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:04:26,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854460907] [2021-12-28 09:04:26,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:04:26,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:04:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:04:26,535 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:04:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:04:26,551 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:04:26,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:04:26,562 INFO L85 PathProgramCache]: Analyzing trace with hash 925800, now seen corresponding path program 1 times [2021-12-28 09:04:26,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:04:26,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874511879] [2021-12-28 09:04:26,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:04:26,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:04:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:04:26,644 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-28 09:04:26,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:04:26,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874511879] [2021-12-28 09:04:26,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874511879] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:04:26,646 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:04:26,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 09:04:26,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436416635] [2021-12-28 09:04:26,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:04:26,719 INFO L210 LassoAnalysis]: Preferences: [2021-12-28 09:04:26,719 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-28 09:04:26,720 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-28 09:04:26,720 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-28 09:04:26,720 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-28 09:04:26,720 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:26,720 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-28 09:04:26,720 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-28 09:04:26,721 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration1_Loop [2021-12-28 09:04:26,721 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-28 09:04:26,721 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-28 09:04:26,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-28 09:04:26,753 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-28 09:04:26,756 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-28 09:04:26,807 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-28 09:04:26,807 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-28 09:04:26,809 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:26,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:04:26,819 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-28 09:04:26,824 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-28 09:04:26,853 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-28 09:04:26,853 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-28 09:04:26,870 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-28 09:04:26,870 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-28 09:04:26,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-12-28 09:04:26,888 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:26,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:04:26,890 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-28 09:04:26,890 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-28 09:04:26,894 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-28 09:04:26,894 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-28 09:04:26,908 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-28 09:04:26,908 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-28 09:04:26,926 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-28 09:04:26,927 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:26,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:04:26,928 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-28 09:04:26,930 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-28 09:04:26,932 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-28 09:04:26,933 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-28 09:04:26,976 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-28 09:04:26,977 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:26,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:04:26,978 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-28 09:04:26,979 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-28 09:04:26,980 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-28 09:04:26,980 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-28 09:04:27,002 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-28 09:04:27,019 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-28 09:04:27,020 INFO L210 LassoAnalysis]: Preferences: [2021-12-28 09:04:27,020 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-28 09:04:27,020 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-28 09:04:27,020 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-28 09:04:27,020 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-28 09:04:27,020 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:27,020 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-28 09:04:27,020 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-28 09:04:27,020 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration1_Loop [2021-12-28 09:04:27,020 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-28 09:04:27,020 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-28 09:04:27,021 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-28 09:04:27,032 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-28 09:04:27,041 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-28 09:04:27,091 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-28 09:04:27,098 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-28 09:04:27,099 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:27,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:04:27,100 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-28 09:04:27,101 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-28 09:04:27,102 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-28 09:04:27,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:04:27,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:04:27,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:04:27,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:04:27,113 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:04:27,113 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:04:27,126 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:04:27,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2021-12-28 09:04:27,143 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:27,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:04:27,145 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-28 09:04:27,145 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-28 09:04:27,146 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-28 09:04:27,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:04:27,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:04:27,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:04:27,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:04:27,160 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:04:27,160 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:04:27,169 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:04:27,188 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-28 09:04:27,188 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:27,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:04:27,189 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-28 09:04:27,190 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-28 09:04:27,191 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-28 09:04:27,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:04:27,197 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:04:27,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:04:27,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:04:27,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:04:27,202 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:04:27,202 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:04:27,207 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-28 09:04:27,209 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-28 09:04:27,210 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-28 09:04:27,210 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:27,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:04:27,211 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-28 09:04:27,212 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-28 09:04:27,213 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-28 09:04:27,213 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-28 09:04:27,213 INFO L513 LassoAnalysis]: Proved termination. [2021-12-28 09:04:27,213 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2021-12-28 09:04:27,229 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-28 09:04:27,231 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-28 09:04:27,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:04:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:04:27,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-28 09:04:27,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:04:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:04:27,304 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 09:04:27,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:04:27,308 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-28 09:04:27,378 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-28 09:04:27,379 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-28 09:04:27,390 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-28 09:04:27,411 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-28 09:04:27,413 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-28 09:04:27,417 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-28 09:04:27,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2021-12-28 09:04:27,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 2 letters. [2021-12-28 09:04:27,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:04:27,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 2 letters. [2021-12-28 09:04:27,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:04:27,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 4 letters. [2021-12-28 09:04:27,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:04:27,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2021-12-28 09:04:27,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-28 09:04:27,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 8 states and 11 transitions. [2021-12-28 09:04:27,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2021-12-28 09:04:27,425 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-12-28 09:04:27,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2021-12-28 09:04:27,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-28 09:04:27,426 INFO L681 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2021-12-28 09:04:27,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2021-12-28 09:04:27,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-12-28 09:04:27,462 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-28 09:04:27,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2021-12-28 09:04:27,463 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2021-12-28 09:04:27,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:04:27,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 09:04:27,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 09:04:27,466 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-28 09:04:27,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:04:27,480 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2021-12-28 09:04:27,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 09:04:27,482 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. [2021-12-28 09:04:27,482 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-28 09:04:27,483 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 6 states and 7 transitions. [2021-12-28 09:04:27,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-12-28 09:04:27,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-12-28 09:04:27,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2021-12-28 09:04:27,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:04:27,483 INFO L681 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2021-12-28 09:04:27,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2021-12-28 09:04:27,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2021-12-28 09:04:27,484 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-28 09:04:27,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2021-12-28 09:04:27,485 INFO L704 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2021-12-28 09:04:27,485 INFO L587 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2021-12-28 09:04:27,485 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-28 09:04:27,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2021-12-28 09:04:27,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-28 09:04:27,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:04:27,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:04:27,486 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-28 09:04:27,486 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-28 09:04:27,487 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;havoc main_~i~0#1;main_~i~0#1 := 0; 89#L10-2 assume !!(main_~i~0#1 < 100); 88#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 84#L10-2 [2021-12-28 09:04:27,487 INFO L793 eck$LassoCheckResult]: Loop: 84#L10-2 assume !!(main_~i~0#1 < 100); 85#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 84#L10-2 [2021-12-28 09:04:27,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:04:27,487 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2021-12-28 09:04:27,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:04:27,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608500157] [2021-12-28 09:04:27,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:04:27,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:04:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:04:27,492 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:04:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:04:27,495 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:04:27,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:04:27,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 2 times [2021-12-28 09:04:27,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:04:27,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746027845] [2021-12-28 09:04:27,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:04:27,497 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:04:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:04:27,500 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:04:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:04:27,503 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:04:27,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:04:27,503 INFO L85 PathProgramCache]: Analyzing trace with hash 889692235, now seen corresponding path program 1 times [2021-12-28 09:04:27,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:04:27,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47453952] [2021-12-28 09:04:27,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:04:27,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:04:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:04:27,524 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-28 09:04:27,524 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:04:27,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47453952] [2021-12-28 09:04:27,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47453952] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 09:04:27,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165584580] [2021-12-28 09:04:27,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:04:27,525 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 09:04:27,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:04:27,526 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-28 09:04:27,527 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-28 09:04:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:04:27,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 09:04:27,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:04:27,575 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-28 09:04:27,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 09:04:27,599 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-28 09:04:27,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165584580] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 09:04:27,600 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 09:04:27,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2021-12-28 09:04:27,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155074848] [2021-12-28 09:04:27,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 09:04:27,617 INFO L210 LassoAnalysis]: Preferences: [2021-12-28 09:04:27,618 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-28 09:04:27,618 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-28 09:04:27,618 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-28 09:04:27,618 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-28 09:04:27,618 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:27,618 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-28 09:04:27,618 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-28 09:04:27,618 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration2_Loop [2021-12-28 09:04:27,619 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-28 09:04:27,619 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-28 09:04:27,620 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-28 09:04:27,622 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-28 09:04:27,628 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-28 09:04:27,657 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-28 09:04:27,658 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-28 09:04:27,658 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:27,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:04:27,660 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-28 09:04:27,674 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-28 09:04:27,674 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-28 09:04:27,689 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-28 09:04:27,700 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-28 09:04:27,700 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-28 09:04:27,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2021-12-28 09:04:27,718 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:27,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:04:27,719 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-28 09:04:27,720 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-28 09:04:27,721 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-28 09:04:27,721 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-28 09:04:27,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-12-28 09:04:27,747 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:27,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:04:27,747 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-28 09:04:27,749 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-28 09:04:27,751 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-28 09:04:27,751 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-28 09:04:27,768 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-28 09:04:27,789 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-28 09:04:27,789 INFO L210 LassoAnalysis]: Preferences: [2021-12-28 09:04:27,790 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-28 09:04:27,790 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-28 09:04:27,790 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-28 09:04:27,790 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-28 09:04:27,790 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:27,790 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-28 09:04:27,790 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-28 09:04:27,790 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration2_Loop [2021-12-28 09:04:27,790 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-28 09:04:27,791 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-28 09:04:27,792 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-28 09:04:27,807 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-28 09:04:27,816 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-28 09:04:27,855 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-28 09:04:27,856 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-28 09:04:27,856 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:27,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:04:27,860 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-28 09:04:27,870 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-28 09:04:27,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:04:27,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:04:27,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:04:27,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:04:27,883 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:04:27,883 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:04:27,886 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-28 09:04:27,905 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:04:27,929 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-28 09:04:27,929 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:27,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:04:27,930 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-28 09:04:27,942 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-28 09:04:27,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:04:27,950 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:04:27,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:04:27,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:04:27,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:04:27,953 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:04:27,953 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:04:27,955 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-28 09:04:27,967 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-28 09:04:27,971 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-28 09:04:27,971 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-28 09:04:27,971 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:27,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:04:27,973 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-28 09:04:27,974 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-28 09:04:27,975 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-28 09:04:27,975 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-28 09:04:27,976 INFO L513 LassoAnalysis]: Proved termination. [2021-12-28 09:04:27,976 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2021-12-28 09:04:27,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2021-12-28 09:04:27,998 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-28 09:04:28,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:04:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:04:28,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-28 09:04:28,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:04:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:04:28,025 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 09:04:28,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:04:28,028 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-28 09:04:28,029 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-28 09:04:28,029 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-28 09:04:28,039 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-28 09:04:28,040 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-28 09:04:28,041 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-28 09:04:28,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2021-12-28 09:04:28,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 2 letters. [2021-12-28 09:04:28,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:04:28,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 6 letters. Loop has 2 letters. [2021-12-28 09:04:28,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:04:28,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 4 letters. [2021-12-28 09:04:28,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:04:28,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. [2021-12-28 09:04:28,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-28 09:04:28,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 13 transitions. [2021-12-28 09:04:28,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-12-28 09:04:28,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2021-12-28 09:04:28,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2021-12-28 09:04:28,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-28 09:04:28,046 INFO L681 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2021-12-28 09:04:28,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2021-12-28 09:04:28,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2021-12-28 09:04:28,049 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-28 09:04:28,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2021-12-28 09:04:28,049 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2021-12-28 09:04:28,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:04:28,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 09:04:28,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-28 09:04:28,051 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-28 09:04:28,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:04:28,067 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2021-12-28 09:04:28,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 09:04:28,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2021-12-28 09:04:28,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-28 09:04:28,069 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 13 transitions. [2021-12-28 09:04:28,069 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-12-28 09:04:28,069 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-12-28 09:04:28,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2021-12-28 09:04:28,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:04:28,070 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2021-12-28 09:04:28,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2021-12-28 09:04:28,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-12-28 09:04:28,071 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-28 09:04:28,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2021-12-28 09:04:28,072 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2021-12-28 09:04:28,072 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2021-12-28 09:04:28,072 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-28 09:04:28,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2021-12-28 09:04:28,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-28 09:04:28,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:04:28,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:04:28,073 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1] [2021-12-28 09:04:28,073 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-28 09:04:28,073 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;havoc main_~i~0#1;main_~i~0#1 := 0; 200#L10-2 assume !!(main_~i~0#1 < 100); 199#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 195#L10-2 assume !!(main_~i~0#1 < 100); 196#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 206#L10-2 assume !!(main_~i~0#1 < 100); 205#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 204#L10-2 assume !!(main_~i~0#1 < 100); 203#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 202#L10-2 [2021-12-28 09:04:28,074 INFO L793 eck$LassoCheckResult]: Loop: 202#L10-2 assume !!(main_~i~0#1 < 100); 201#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 202#L10-2 [2021-12-28 09:04:28,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:04:28,074 INFO L85 PathProgramCache]: Analyzing trace with hash 742492623, now seen corresponding path program 2 times [2021-12-28 09:04:28,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:04:28,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863570446] [2021-12-28 09:04:28,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:04:28,075 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:04:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:04:28,082 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:04:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:04:28,088 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:04:28,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:04:28,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 3 times [2021-12-28 09:04:28,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:04:28,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755777086] [2021-12-28 09:04:28,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:04:28,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:04:28,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:04:28,092 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:04:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:04:28,094 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:04:28,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:04:28,094 INFO L85 PathProgramCache]: Analyzing trace with hash 570839924, now seen corresponding path program 2 times [2021-12-28 09:04:28,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:04:28,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774090272] [2021-12-28 09:04:28,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:04:28,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:04:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:04:28,135 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-28 09:04:28,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:04:28,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774090272] [2021-12-28 09:04:28,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774090272] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 09:04:28,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837737458] [2021-12-28 09:04:28,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-28 09:04:28,136 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 09:04:28,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:04:28,137 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 09:04:28,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-28 09:04:28,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-28 09:04:28,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 09:04:28,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-28 09:04:28,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:04:28,214 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-28 09:04:28,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 09:04:28,275 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-28 09:04:28,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837737458] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 09:04:28,276 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 09:04:28,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2021-12-28 09:04:28,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879859408] [2021-12-28 09:04:28,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 09:04:28,294 INFO L210 LassoAnalysis]: Preferences: [2021-12-28 09:04:28,294 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-28 09:04:28,294 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-28 09:04:28,294 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-28 09:04:28,294 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-28 09:04:28,294 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:28,295 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-28 09:04:28,295 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-28 09:04:28,295 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration3_Loop [2021-12-28 09:04:28,295 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-28 09:04:28,295 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-28 09:04:28,296 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-28 09:04:28,301 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-28 09:04:28,303 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-28 09:04:28,314 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-28 09:04:28,340 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-28 09:04:28,341 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-28 09:04:28,341 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:28,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:04:28,348 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-28 09:04:28,358 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-28 09:04:28,358 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-28 09:04:28,367 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-28 09:04:28,400 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-28 09:04:28,400 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:28,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:04:28,402 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:04:28,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-12-28 09:04:28,405 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-28 09:04:28,405 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-28 09:04:28,438 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-28 09:04:28,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-12-28 09:04:28,462 INFO L210 LassoAnalysis]: Preferences: [2021-12-28 09:04:28,462 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-28 09:04:28,462 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-28 09:04:28,462 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-28 09:04:28,462 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-28 09:04:28,462 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:28,462 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-28 09:04:28,463 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-28 09:04:28,463 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration3_Loop [2021-12-28 09:04:28,463 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-28 09:04:28,463 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-28 09:04:28,464 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-28 09:04:28,472 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-28 09:04:28,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-28 09:04:28,507 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-28 09:04:28,507 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-28 09:04:28,508 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:28,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:04:28,509 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-28 09:04:28,520 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-28 09:04:28,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:04:28,527 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:04:28,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:04:28,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:04:28,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:04:28,529 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:04:28,529 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:04:28,534 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-28 09:04:28,534 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-28 09:04:28,536 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-28 09:04:28,536 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-28 09:04:28,536 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:28,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:04:28,537 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-28 09:04:28,538 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-28 09:04:28,539 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-28 09:04:28,539 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-28 09:04:28,539 INFO L513 LassoAnalysis]: Proved termination. [2021-12-28 09:04:28,539 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2021-12-28 09:04:28,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-12-28 09:04:28,555 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-28 09:04:28,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:04:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:04:28,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-28 09:04:28,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:04:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:04:28,619 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 09:04:28,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:04:28,622 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-28 09:04:28,623 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-28 09:04:28,623 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-28 09:04:28,629 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-28 09:04:28,629 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-28 09:04:28,633 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-28 09:04:28,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2021-12-28 09:04:28,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 10 letters. Loop has 2 letters. [2021-12-28 09:04:28,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:04:28,634 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-28 09:04:28,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:04:28,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:04:28,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-28 09:04:28,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:04:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:04:28,674 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 09:04:28,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:04:28,677 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-28 09:04:28,678 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-28 09:04:28,678 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-28 09:04:28,683 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-28 09:04:28,683 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-28 09:04:28,687 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-28 09:04:28,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2021-12-28 09:04:28,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 10 letters. Loop has 2 letters. [2021-12-28 09:04:28,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:04:28,688 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-28 09:04:28,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:04:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:04:28,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-28 09:04:28,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:04:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:04:28,727 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 09:04:28,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:04:28,730 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-28 09:04:28,731 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-28 09:04:28,731 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-28 09:04:28,742 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-28 09:04:28,743 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-28 09:04:28,745 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-28 09:04:28,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2021-12-28 09:04:28,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 2 letters. [2021-12-28 09:04:28,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:04:28,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 12 letters. Loop has 2 letters. [2021-12-28 09:04:28,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:04:28,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 4 letters. [2021-12-28 09:04:28,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:04:28,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2021-12-28 09:04:28,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-28 09:04:28,753 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 14 states and 16 transitions. [2021-12-28 09:04:28,753 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2021-12-28 09:04:28,754 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-12-28 09:04:28,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2021-12-28 09:04:28,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-28 09:04:28,755 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-12-28 09:04:28,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2021-12-28 09:04:28,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2021-12-28 09:04:28,756 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-28 09:04:28,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-12-28 09:04:28,757 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-12-28 09:04:28,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:04:28,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-28 09:04:28,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2021-12-28 09:04:28,759 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-28 09:04:28,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:04:28,804 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2021-12-28 09:04:28,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-28 09:04:28,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 34 transitions. [2021-12-28 09:04:28,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-28 09:04:28,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 26 states and 28 transitions. [2021-12-28 09:04:28,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2021-12-28 09:04:28,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2021-12-28 09:04:28,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2021-12-28 09:04:28,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-28 09:04:28,808 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2021-12-28 09:04:28,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2021-12-28 09:04:28,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2021-12-28 09:04:28,810 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-28 09:04:28,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2021-12-28 09:04:28,810 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2021-12-28 09:04:28,811 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2021-12-28 09:04:28,811 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-28 09:04:28,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 27 transitions. [2021-12-28 09:04:28,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-28 09:04:28,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:04:28,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:04:28,812 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 1, 1] [2021-12-28 09:04:28,812 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-28 09:04:28,812 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;havoc main_~i~0#1;main_~i~0#1 := 0; 516#L10-2 assume !!(main_~i~0#1 < 100); 515#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 508#L10-2 assume !!(main_~i~0#1 < 100); 509#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 532#L10-2 assume !!(main_~i~0#1 < 100); 531#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 530#L10-2 assume !!(main_~i~0#1 < 100); 529#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 528#L10-2 assume !!(main_~i~0#1 < 100); 527#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 526#L10-2 assume !!(main_~i~0#1 < 100); 525#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 524#L10-2 assume !!(main_~i~0#1 < 100); 523#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 522#L10-2 assume !!(main_~i~0#1 < 100); 521#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 520#L10-2 assume !!(main_~i~0#1 < 100); 519#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 518#L10-2 assume !!(main_~i~0#1 < 100); 512#L10 [2021-12-28 09:04:28,813 INFO L793 eck$LassoCheckResult]: Loop: 512#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 517#L10-2 assume !!(main_~i~0#1 < 100); 512#L10 [2021-12-28 09:04:28,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:04:28,813 INFO L85 PathProgramCache]: Analyzing trace with hash -926509747, now seen corresponding path program 3 times [2021-12-28 09:04:28,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:04:28,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515759576] [2021-12-28 09:04:28,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:04:28,814 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:04:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:04:28,824 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:04:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:04:28,833 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:04:28,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:04:28,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1406, now seen corresponding path program 1 times [2021-12-28 09:04:28,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:04:28,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658335230] [2021-12-28 09:04:28,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:04:28,834 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:04:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:04:28,837 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:04:28,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:04:28,839 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:04:28,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:04:28,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1317636150, now seen corresponding path program 4 times [2021-12-28 09:04:28,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:04:28,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619639039] [2021-12-28 09:04:28,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:04:28,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:04:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:04:28,849 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:04:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:04:28,858 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:04:28,890 INFO L210 LassoAnalysis]: Preferences: [2021-12-28 09:04:28,890 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-28 09:04:28,890 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-28 09:04:28,890 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-28 09:04:28,890 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-28 09:04:28,891 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:28,891 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-28 09:04:28,891 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-28 09:04:28,891 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration4_Loop [2021-12-28 09:04:28,891 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-28 09:04:28,895 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-28 09:04:28,895 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-28 09:04:28,896 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-28 09:04:28,900 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-28 09:04:28,902 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-28 09:04:28,929 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-28 09:04:28,929 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-28 09:04:28,930 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:28,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:04:28,931 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-28 09:04:28,942 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-28 09:04:28,942 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-28 09:04:28,951 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-28 09:04:28,982 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-28 09:04:28,982 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:28,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:04:28,984 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-28 09:04:28,993 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-28 09:04:28,993 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-28 09:04:29,015 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-28 09:04:29,039 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-28 09:04:29,045 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-28 09:04:29,045 INFO L210 LassoAnalysis]: Preferences: [2021-12-28 09:04:29,045 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-28 09:04:29,045 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-28 09:04:29,045 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-28 09:04:29,045 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-28 09:04:29,046 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:29,046 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-28 09:04:29,046 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-28 09:04:29,046 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration4_Loop [2021-12-28 09:04:29,046 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-28 09:04:29,046 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-28 09:04:29,046 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-28 09:04:29,052 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-28 09:04:29,054 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-28 09:04:29,089 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-28 09:04:29,089 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-28 09:04:29,089 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:29,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:04:29,090 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-28 09:04:29,091 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-28 09:04:29,093 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-28 09:04:29,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:04:29,099 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:04:29,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:04:29,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:04:29,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:04:29,100 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:04:29,100 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:04:29,114 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-28 09:04:29,117 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-28 09:04:29,117 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-28 09:04:29,117 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:29,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:04:29,120 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-28 09:04:29,127 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-28 09:04:29,127 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-28 09:04:29,127 INFO L513 LassoAnalysis]: Proved termination. [2021-12-28 09:04:29,128 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 99 Supporting invariants [] [2021-12-28 09:04:29,128 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-28 09:04:29,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2021-12-28 09:04:29,143 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-28 09:04:29,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:04:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:04:29,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-28 09:04:29,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:04:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:04:29,213 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 09:04:29,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:04:29,232 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-28 09:04:29,232 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-28 09:04:29,232 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-28 09:04:29,241 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-28 09:04:29,242 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-28 09:04:29,242 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-28 09:04:29,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2021-12-28 09:04:29,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 21 letters. Loop has 2 letters. [2021-12-28 09:04:29,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:04:29,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 23 letters. Loop has 2 letters. [2021-12-28 09:04:29,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:04:29,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 21 letters. Loop has 4 letters. [2021-12-28 09:04:29,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:04:29,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 42 transitions. [2021-12-28 09:04:29,244 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-28 09:04:29,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 28 states and 31 transitions. [2021-12-28 09:04:29,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-12-28 09:04:29,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-12-28 09:04:29,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2021-12-28 09:04:29,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-28 09:04:29,245 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2021-12-28 09:04:29,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2021-12-28 09:04:29,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2021-12-28 09:04:29,246 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-28 09:04:29,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2021-12-28 09:04:29,246 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2021-12-28 09:04:29,247 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2021-12-28 09:04:29,247 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-28 09:04:29,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. [2021-12-28 09:04:29,247 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-28 09:04:29,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:04:29,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:04:29,248 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [12, 10, 1, 1, 1] [2021-12-28 09:04:29,248 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-28 09:04:29,248 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;havoc main_~i~0#1;main_~i~0#1 := 0; 661#L10-2 assume !!(main_~i~0#1 < 100); 662#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 667#L10-2 assume !!(main_~i~0#1 < 100); 668#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 663#L10-2 assume !!(main_~i~0#1 < 100); 664#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 687#L10-2 assume !!(main_~i~0#1 < 100); 686#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 685#L10-2 assume !!(main_~i~0#1 < 100); 684#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 683#L10-2 assume !!(main_~i~0#1 < 100); 682#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 681#L10-2 assume !!(main_~i~0#1 < 100); 680#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 679#L10-2 assume !!(main_~i~0#1 < 100); 678#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 677#L10-2 assume !!(main_~i~0#1 < 100); 676#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 675#L10-2 assume !!(main_~i~0#1 < 100); 674#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 673#L10-2 assume !!(main_~i~0#1 < 100); 671#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 669#L10-2 assume !!(main_~i~0#1 < 100); 670#L10 [2021-12-28 09:04:29,248 INFO L793 eck$LassoCheckResult]: Loop: 670#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 672#L10-2 assume !!(main_~i~0#1 < 100); 670#L10 [2021-12-28 09:04:29,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:04:29,249 INFO L85 PathProgramCache]: Analyzing trace with hash 767012677, now seen corresponding path program 3 times [2021-12-28 09:04:29,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:04:29,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838213614] [2021-12-28 09:04:29,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:04:29,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:04:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:04:29,348 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-28 09:04:29,348 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:04:29,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838213614] [2021-12-28 09:04:29,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838213614] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 09:04:29,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49466793] [2021-12-28 09:04:29,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-28 09:04:29,348 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 09:04:29,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:04:29,350 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 09:04:29,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-12-28 09:04:29,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2021-12-28 09:04:29,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 09:04:29,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-28 09:04:29,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:04:29,442 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-28 09:04:29,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 09:04:29,480 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-28 09:04:29,659 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-28 09:04:29,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49466793] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 09:04:29,659 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 09:04:29,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2021-12-28 09:04:29,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773400924] [2021-12-28 09:04:29,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 09:04:29,660 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-28 09:04:29,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:04:29,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1406, now seen corresponding path program 2 times [2021-12-28 09:04:29,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:04:29,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960307876] [2021-12-28 09:04:29,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:04:29,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:04:29,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:04:29,664 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:04:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:04:29,666 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:04:29,678 INFO L210 LassoAnalysis]: Preferences: [2021-12-28 09:04:29,678 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-28 09:04:29,678 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-28 09:04:29,678 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-28 09:04:29,678 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-28 09:04:29,678 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:29,678 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-28 09:04:29,678 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-28 09:04:29,679 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration5_Loop [2021-12-28 09:04:29,679 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-28 09:04:29,679 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-28 09:04:29,679 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-28 09:04:29,681 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-28 09:04:29,683 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-28 09:04:29,713 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-28 09:04:29,714 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-28 09:04:29,715 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:29,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:04:29,716 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-28 09:04:29,724 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-28 09:04:29,724 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-28 09:04:29,731 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-28 09:04:29,746 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-28 09:04:29,746 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-28 09:04:29,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2021-12-28 09:04:29,766 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:29,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:04:29,767 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-28 09:04:29,768 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-28 09:04:29,769 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-28 09:04:29,769 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-28 09:04:29,779 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-28 09:04:29,779 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-28 09:04:29,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2021-12-28 09:04:29,795 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:29,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:04:29,795 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-28 09:04:29,796 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-28 09:04:29,797 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-28 09:04:29,797 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-28 09:04:29,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2021-12-28 09:04:29,818 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:29,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:04:29,819 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-28 09:04:29,820 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-28 09:04:29,821 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-28 09:04:29,821 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-28 09:04:29,845 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-28 09:04:29,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2021-12-28 09:04:29,848 INFO L210 LassoAnalysis]: Preferences: [2021-12-28 09:04:29,848 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-28 09:04:29,848 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-28 09:04:29,848 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-28 09:04:29,848 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-28 09:04:29,848 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:29,848 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-28 09:04:29,848 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-28 09:04:29,848 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration5_Loop [2021-12-28 09:04:29,849 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-28 09:04:29,849 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-28 09:04:29,849 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-28 09:04:29,851 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-28 09:04:29,853 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-28 09:04:29,885 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-28 09:04:29,885 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-28 09:04:29,885 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:29,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:04:29,886 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-28 09:04:29,888 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-28 09:04:29,888 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-28 09:04:29,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:04:29,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:04:29,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:04:29,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:04:29,895 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:04:29,895 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:04:29,915 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:04:29,941 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-28 09:04:29,942 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:29,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:04:29,944 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:04:29,948 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-28 09:04:29,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:04:29,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:04:29,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:04:29,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:04:29,957 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:04:29,957 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:04:29,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-12-28 09:04:29,976 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:04:30,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2021-12-28 09:04:30,000 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:30,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:04:30,001 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-28 09:04:30,004 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-28 09:04:30,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:04:30,011 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:04:30,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:04:30,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:04:30,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:04:30,012 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:04:30,012 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:04:30,014 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-28 09:04:30,025 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-28 09:04:30,027 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-28 09:04:30,027 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-28 09:04:30,028 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:04:30,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:04:30,032 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-28 09:04:30,033 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-28 09:04:30,034 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-28 09:04:30,034 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-28 09:04:30,034 INFO L513 LassoAnalysis]: Proved termination. [2021-12-28 09:04:30,034 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 99 Supporting invariants [] [2021-12-28 09:04:30,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2021-12-28 09:04:30,060 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-28 09:04:30,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:04:30,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:04:30,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-28 09:04:30,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:04:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:04:30,134 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 09:04:30,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:04:30,153 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-28 09:04:30,153 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-28 09:04:30,153 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-28 09:04:30,163 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-28 09:04:30,163 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-28 09:04:30,164 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-28 09:04:30,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2021-12-28 09:04:30,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 25 letters. Loop has 2 letters. [2021-12-28 09:04:30,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:04:30,165 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-28 09:04:30,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:04:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:04:30,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-28 09:04:30,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:04:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:04:30,240 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 09:04:30,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:04:30,257 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-28 09:04:30,261 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-28 09:04:30,262 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-28 09:04:30,264 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-28 09:04:30,274 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-28 09:04:30,275 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-28 09:04:30,275 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-28 09:04:30,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2021-12-28 09:04:30,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 25 letters. Loop has 2 letters. [2021-12-28 09:04:30,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:04:30,275 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-28 09:04:30,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:04:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:04:30,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-28 09:04:30,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:04:30,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:04:30,334 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 09:04:30,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:04:30,348 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-28 09:04:30,348 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-28 09:04:30,349 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-28 09:04:30,356 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-28 09:04:30,356 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-28 09:04:30,357 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-28 09:04:30,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-28 09:04:30,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 25 letters. Loop has 2 letters. [2021-12-28 09:04:30,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:04:30,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 27 letters. Loop has 2 letters. [2021-12-28 09:04:30,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:04:30,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 25 letters. Loop has 4 letters. [2021-12-28 09:04:30,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:04:30,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 45 transitions. [2021-12-28 09:04:30,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-28 09:04:30,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 29 states and 32 transitions. [2021-12-28 09:04:30,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2021-12-28 09:04:30,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2021-12-28 09:04:30,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 32 transitions. [2021-12-28 09:04:30,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-28 09:04:30,360 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 32 transitions. [2021-12-28 09:04:30,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 32 transitions. [2021-12-28 09:04:30,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2021-12-28 09:04:30,361 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-28 09:04:30,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2021-12-28 09:04:30,362 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2021-12-28 09:04:30,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:04:30,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-28 09:04:30,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2021-12-28 09:04:30,363 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-28 09:04:30,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:04:30,420 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2021-12-28 09:04:30,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-28 09:04:30,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 65 transitions. [2021-12-28 09:04:30,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-28 09:04:30,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 51 states and 53 transitions. [2021-12-28 09:04:30,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2021-12-28 09:04:30,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2021-12-28 09:04:30,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 53 transitions. [2021-12-28 09:04:30,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-28 09:04:30,423 INFO L681 BuchiCegarLoop]: Abstraction has 51 states and 53 transitions. [2021-12-28 09:04:30,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 53 transitions. [2021-12-28 09:04:30,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2021-12-28 09:04:30,426 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-28 09:04:30,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2021-12-28 09:04:30,426 INFO L704 BuchiCegarLoop]: Abstraction has 50 states and 52 transitions. [2021-12-28 09:04:30,426 INFO L587 BuchiCegarLoop]: Abstraction has 50 states and 52 transitions. [2021-12-28 09:04:30,426 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-28 09:04:30,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 52 transitions. [2021-12-28 09:04:30,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-28 09:04:30,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:04:30,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:04:30,428 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [24, 22, 1, 1, 1] [2021-12-28 09:04:30,428 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-12-28 09:04:30,429 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;havoc main_~i~0#1;main_~i~0#1 := 0; 1333#L10-2 assume !!(main_~i~0#1 < 100); 1334#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1339#L10-2 assume !!(main_~i~0#1 < 100); 1340#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1335#L10-2 assume !!(main_~i~0#1 < 100); 1336#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1382#L10-2 assume !!(main_~i~0#1 < 100); 1381#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1380#L10-2 assume !!(main_~i~0#1 < 100); 1379#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1378#L10-2 assume !!(main_~i~0#1 < 100); 1377#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1376#L10-2 assume !!(main_~i~0#1 < 100); 1375#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1374#L10-2 assume !!(main_~i~0#1 < 100); 1373#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1372#L10-2 assume !!(main_~i~0#1 < 100); 1371#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1370#L10-2 assume !!(main_~i~0#1 < 100); 1369#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1368#L10-2 assume !!(main_~i~0#1 < 100); 1367#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1366#L10-2 assume !!(main_~i~0#1 < 100); 1365#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1364#L10-2 assume !!(main_~i~0#1 < 100); 1363#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1362#L10-2 assume !!(main_~i~0#1 < 100); 1361#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1360#L10-2 assume !!(main_~i~0#1 < 100); 1359#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1358#L10-2 assume !!(main_~i~0#1 < 100); 1357#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1356#L10-2 assume !!(main_~i~0#1 < 100); 1355#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1354#L10-2 assume !!(main_~i~0#1 < 100); 1353#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1352#L10-2 assume !!(main_~i~0#1 < 100); 1351#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1350#L10-2 assume !!(main_~i~0#1 < 100); 1349#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1348#L10-2 assume !!(main_~i~0#1 < 100); 1347#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1346#L10-2 assume !!(main_~i~0#1 < 100); 1345#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1344#L10-2 assume !!(main_~i~0#1 < 100); 1343#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 1341#L10-2 assume !!(main_~i~0#1 < 100); 1342#L10 [2021-12-28 09:04:30,429 INFO L793 eck$LassoCheckResult]: Loop: 1342#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1344#L10-2 assume !!(main_~i~0#1 < 100); 1343#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 1341#L10-2 assume !!(main_~i~0#1 < 100); 1342#L10 [2021-12-28 09:04:30,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:04:30,429 INFO L85 PathProgramCache]: Analyzing trace with hash -694298463, now seen corresponding path program 4 times [2021-12-28 09:04:30,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:04:30,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936826569] [2021-12-28 09:04:30,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:04:30,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:04:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:04:30,707 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-28 09:04:30,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:04:30,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936826569] [2021-12-28 09:04:30,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936826569] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 09:04:30,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109800790] [2021-12-28 09:04:30,707 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-28 09:04:30,707 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 09:04:30,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:04:30,708 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 09:04:30,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2021-12-28 09:04:30,741 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-28 09:04:30,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 09:04:30,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-28 09:04:30,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:04:30,856 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-28 09:04:30,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 09:04:31,534 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-28 09:04:31,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109800790] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 09:04:31,535 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 09:04:31,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2021-12-28 09:04:31,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9534574] [2021-12-28 09:04:31,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 09:04:31,535 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-28 09:04:31,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:04:31,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 1 times [2021-12-28 09:04:31,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:04:31,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262386251] [2021-12-28 09:04:31,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:04:31,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:04:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:04:31,539 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:04:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:04:31,541 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:04:31,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:04:31,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-28 09:04:31,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2021-12-28 09:04:31,567 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-28 09:04:31,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:04:31,701 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2021-12-28 09:04:31,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-12-28 09:04:31,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 125 transitions. [2021-12-28 09:04:31,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-28 09:04:31,707 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 99 states and 101 transitions. [2021-12-28 09:04:31,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2021-12-28 09:04:31,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2021-12-28 09:04:31,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 101 transitions. [2021-12-28 09:04:31,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-28 09:04:31,707 INFO L681 BuchiCegarLoop]: Abstraction has 99 states and 101 transitions. [2021-12-28 09:04:31,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 101 transitions. [2021-12-28 09:04:31,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2021-12-28 09:04:31,722 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-28 09:04:31,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2021-12-28 09:04:31,725 INFO L704 BuchiCegarLoop]: Abstraction has 98 states and 100 transitions. [2021-12-28 09:04:31,725 INFO L587 BuchiCegarLoop]: Abstraction has 98 states and 100 transitions. [2021-12-28 09:04:31,725 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-28 09:04:31,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 100 transitions. [2021-12-28 09:04:31,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-28 09:04:31,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:04:31,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:04:31,729 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [48, 46, 1, 1, 1] [2021-12-28 09:04:31,731 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-12-28 09:04:31,732 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;havoc main_~i~0#1;main_~i~0#1 := 0; 1845#L10-2 assume !!(main_~i~0#1 < 100); 1846#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1851#L10-2 assume !!(main_~i~0#1 < 100); 1852#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1847#L10-2 assume !!(main_~i~0#1 < 100); 1848#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1942#L10-2 assume !!(main_~i~0#1 < 100); 1941#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1940#L10-2 assume !!(main_~i~0#1 < 100); 1939#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1938#L10-2 assume !!(main_~i~0#1 < 100); 1937#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1936#L10-2 assume !!(main_~i~0#1 < 100); 1935#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1934#L10-2 assume !!(main_~i~0#1 < 100); 1933#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1932#L10-2 assume !!(main_~i~0#1 < 100); 1931#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1930#L10-2 assume !!(main_~i~0#1 < 100); 1929#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1928#L10-2 assume !!(main_~i~0#1 < 100); 1927#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1926#L10-2 assume !!(main_~i~0#1 < 100); 1925#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1924#L10-2 assume !!(main_~i~0#1 < 100); 1923#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1922#L10-2 assume !!(main_~i~0#1 < 100); 1921#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1920#L10-2 assume !!(main_~i~0#1 < 100); 1919#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1918#L10-2 assume !!(main_~i~0#1 < 100); 1917#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1916#L10-2 assume !!(main_~i~0#1 < 100); 1915#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1914#L10-2 assume !!(main_~i~0#1 < 100); 1913#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1912#L10-2 assume !!(main_~i~0#1 < 100); 1911#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1910#L10-2 assume !!(main_~i~0#1 < 100); 1909#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1908#L10-2 assume !!(main_~i~0#1 < 100); 1907#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1906#L10-2 assume !!(main_~i~0#1 < 100); 1905#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1904#L10-2 assume !!(main_~i~0#1 < 100); 1903#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1902#L10-2 assume !!(main_~i~0#1 < 100); 1901#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1900#L10-2 assume !!(main_~i~0#1 < 100); 1899#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1898#L10-2 assume !!(main_~i~0#1 < 100); 1897#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1896#L10-2 assume !!(main_~i~0#1 < 100); 1895#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1894#L10-2 assume !!(main_~i~0#1 < 100); 1893#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1892#L10-2 assume !!(main_~i~0#1 < 100); 1891#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1890#L10-2 assume !!(main_~i~0#1 < 100); 1889#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1888#L10-2 assume !!(main_~i~0#1 < 100); 1887#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1886#L10-2 assume !!(main_~i~0#1 < 100); 1885#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1884#L10-2 assume !!(main_~i~0#1 < 100); 1883#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1882#L10-2 assume !!(main_~i~0#1 < 100); 1881#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1880#L10-2 assume !!(main_~i~0#1 < 100); 1879#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1878#L10-2 assume !!(main_~i~0#1 < 100); 1877#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1876#L10-2 assume !!(main_~i~0#1 < 100); 1875#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1874#L10-2 assume !!(main_~i~0#1 < 100); 1873#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1872#L10-2 assume !!(main_~i~0#1 < 100); 1871#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1870#L10-2 assume !!(main_~i~0#1 < 100); 1869#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1868#L10-2 assume !!(main_~i~0#1 < 100); 1867#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1866#L10-2 assume !!(main_~i~0#1 < 100); 1865#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1864#L10-2 assume !!(main_~i~0#1 < 100); 1863#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1862#L10-2 assume !!(main_~i~0#1 < 100); 1861#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1860#L10-2 assume !!(main_~i~0#1 < 100); 1859#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1858#L10-2 assume !!(main_~i~0#1 < 100); 1857#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1856#L10-2 assume !!(main_~i~0#1 < 100); 1855#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 1853#L10-2 assume !!(main_~i~0#1 < 100); 1854#L10 [2021-12-28 09:04:31,733 INFO L793 eck$LassoCheckResult]: Loop: 1854#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1856#L10-2 assume !!(main_~i~0#1 < 100); 1855#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 1853#L10-2 assume !!(main_~i~0#1 < 100); 1854#L10 [2021-12-28 09:04:31,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:04:31,733 INFO L85 PathProgramCache]: Analyzing trace with hash -818401447, now seen corresponding path program 5 times [2021-12-28 09:04:31,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:04:31,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789634974] [2021-12-28 09:04:31,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:04:31,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:04:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:04:32,614 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-28 09:04:32,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:04:32,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789634974] [2021-12-28 09:04:32,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789634974] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 09:04:32,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419590152] [2021-12-28 09:04:32,614 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-28 09:04:32,614 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 09:04:32,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:04:32,616 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 09:04:32,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-12-28 09:04:32,688 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2021-12-28 09:04:32,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 09:04:32,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-28 09:04:32,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:04:32,877 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-28 09:04:32,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 09:04:33,214 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-28 09:04:33,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419590152] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 09:04:33,215 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 09:04:33,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 52 [2021-12-28 09:04:33,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585670566] [2021-12-28 09:04:33,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 09:04:33,217 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-28 09:04:33,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:04:33,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 2 times [2021-12-28 09:04:33,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:04:33,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806088612] [2021-12-28 09:04:33,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:04:33,219 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:04:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:04:33,224 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:04:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:04:33,229 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:04:33,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:04:33,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-12-28 09:04:33,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2021-12-28 09:04:33,256 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. cyclomatic complexity: 3 Second operand has 52 states, 52 states have (on average 2.019230769230769) internal successors, (105), 52 states have internal predecessors, (105), 0 states have call successors, (0), 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-28 09:04:33,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:04:33,378 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2021-12-28 09:04:33,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-12-28 09:04:33,379 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 113 transitions. [2021-12-28 09:04:33,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-28 09:04:33,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 107 states and 109 transitions. [2021-12-28 09:04:33,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2021-12-28 09:04:33,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2021-12-28 09:04:33,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 109 transitions. [2021-12-28 09:04:33,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-28 09:04:33,382 INFO L681 BuchiCegarLoop]: Abstraction has 107 states and 109 transitions. [2021-12-28 09:04:33,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 109 transitions. [2021-12-28 09:04:33,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2021-12-28 09:04:33,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 105 states have internal predecessors, (108), 0 states have call successors, (0), 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-28 09:04:33,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2021-12-28 09:04:33,392 INFO L704 BuchiCegarLoop]: Abstraction has 106 states and 108 transitions. [2021-12-28 09:04:33,392 INFO L587 BuchiCegarLoop]: Abstraction has 106 states and 108 transitions. [2021-12-28 09:04:33,392 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-28 09:04:33,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 108 transitions. [2021-12-28 09:04:33,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-28 09:04:33,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:04:33,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:04:33,399 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [52, 50, 1, 1, 1] [2021-12-28 09:04:33,399 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-12-28 09:04:33,400 INFO L791 eck$LassoCheckResult]: Stem: 2689#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2690#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 2685#L10-2 assume !!(main_~i~0#1 < 100); 2686#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2691#L10-2 assume !!(main_~i~0#1 < 100); 2692#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2687#L10-2 assume !!(main_~i~0#1 < 100); 2688#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2790#L10-2 assume !!(main_~i~0#1 < 100); 2789#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2788#L10-2 assume !!(main_~i~0#1 < 100); 2787#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2786#L10-2 assume !!(main_~i~0#1 < 100); 2785#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2784#L10-2 assume !!(main_~i~0#1 < 100); 2783#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2782#L10-2 assume !!(main_~i~0#1 < 100); 2781#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2780#L10-2 assume !!(main_~i~0#1 < 100); 2779#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2778#L10-2 assume !!(main_~i~0#1 < 100); 2777#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2776#L10-2 assume !!(main_~i~0#1 < 100); 2775#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2774#L10-2 assume !!(main_~i~0#1 < 100); 2773#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2772#L10-2 assume !!(main_~i~0#1 < 100); 2771#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2770#L10-2 assume !!(main_~i~0#1 < 100); 2769#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2768#L10-2 assume !!(main_~i~0#1 < 100); 2767#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2766#L10-2 assume !!(main_~i~0#1 < 100); 2765#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2764#L10-2 assume !!(main_~i~0#1 < 100); 2763#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2762#L10-2 assume !!(main_~i~0#1 < 100); 2761#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2760#L10-2 assume !!(main_~i~0#1 < 100); 2759#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2758#L10-2 assume !!(main_~i~0#1 < 100); 2757#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2756#L10-2 assume !!(main_~i~0#1 < 100); 2755#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2754#L10-2 assume !!(main_~i~0#1 < 100); 2753#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2752#L10-2 assume !!(main_~i~0#1 < 100); 2751#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2750#L10-2 assume !!(main_~i~0#1 < 100); 2749#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2748#L10-2 assume !!(main_~i~0#1 < 100); 2747#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2746#L10-2 assume !!(main_~i~0#1 < 100); 2745#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2744#L10-2 assume !!(main_~i~0#1 < 100); 2743#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2742#L10-2 assume !!(main_~i~0#1 < 100); 2741#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2740#L10-2 assume !!(main_~i~0#1 < 100); 2739#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2738#L10-2 assume !!(main_~i~0#1 < 100); 2737#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2736#L10-2 assume !!(main_~i~0#1 < 100); 2735#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2734#L10-2 assume !!(main_~i~0#1 < 100); 2733#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2732#L10-2 assume !!(main_~i~0#1 < 100); 2731#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2730#L10-2 assume !!(main_~i~0#1 < 100); 2729#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2728#L10-2 assume !!(main_~i~0#1 < 100); 2727#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2726#L10-2 assume !!(main_~i~0#1 < 100); 2725#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2724#L10-2 assume !!(main_~i~0#1 < 100); 2723#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2722#L10-2 assume !!(main_~i~0#1 < 100); 2721#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2720#L10-2 assume !!(main_~i~0#1 < 100); 2719#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2718#L10-2 assume !!(main_~i~0#1 < 100); 2717#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2716#L10-2 assume !!(main_~i~0#1 < 100); 2715#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2714#L10-2 assume !!(main_~i~0#1 < 100); 2713#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2712#L10-2 assume !!(main_~i~0#1 < 100); 2711#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2710#L10-2 assume !!(main_~i~0#1 < 100); 2709#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2708#L10-2 assume !!(main_~i~0#1 < 100); 2707#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2706#L10-2 assume !!(main_~i~0#1 < 100); 2705#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2704#L10-2 assume !!(main_~i~0#1 < 100); 2703#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2702#L10-2 assume !!(main_~i~0#1 < 100); 2701#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2700#L10-2 assume !!(main_~i~0#1 < 100); 2699#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2698#L10-2 assume !!(main_~i~0#1 < 100); 2697#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2696#L10-2 assume !!(main_~i~0#1 < 100); 2695#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 2693#L10-2 assume !!(main_~i~0#1 < 100); 2694#L10 [2021-12-28 09:04:33,400 INFO L793 eck$LassoCheckResult]: Loop: 2694#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2696#L10-2 assume !!(main_~i~0#1 < 100); 2695#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 2693#L10-2 assume !!(main_~i~0#1 < 100); 2694#L10 [2021-12-28 09:04:33,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:04:33,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1468745677, now seen corresponding path program 6 times [2021-12-28 09:04:33,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:04:33,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777787463] [2021-12-28 09:04:33,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:04:33,401 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:04:33,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:04:33,461 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:04:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:04:33,489 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:04:33,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:04:33,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 3 times [2021-12-28 09:04:33,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:04:33,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847055843] [2021-12-28 09:04:33,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:04:33,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:04:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:04:33,494 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:04:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:04:33,495 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:04:33,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:04:33,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1914756667, now seen corresponding path program 7 times [2021-12-28 09:04:33,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:04:33,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408031955] [2021-12-28 09:04:33,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:04:33,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:04:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:04:33,533 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:04:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:04:33,560 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:04:34,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.12 09:04:34 BoogieIcfgContainer [2021-12-28 09:04:34,512 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-28 09:04:34,513 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-28 09:04:34,513 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-28 09:04:34,513 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-28 09:04:34,514 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 09:04:26" (3/4) ... [2021-12-28 09:04:34,515 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-12-28 09:04:34,547 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-28 09:04:34,548 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-28 09:04:34,548 INFO L158 Benchmark]: Toolchain (without parser) took 8636.07ms. Allocated memory was 54.5MB in the beginning and 86.0MB in the end (delta: 31.5MB). Free memory was 31.6MB in the beginning and 38.3MB in the end (delta: -6.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-12-28 09:04:34,548 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 54.5MB. Free memory is still 36.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 09:04:34,549 INFO L158 Benchmark]: CACSL2BoogieTranslator took 132.73ms. Allocated memory is still 54.5MB. Free memory was 31.5MB in the beginning and 36.7MB in the end (delta: -5.2MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2021-12-28 09:04:34,549 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.71ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 36.5MB in the beginning and 53.4MB in the end (delta: -16.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 09:04:34,549 INFO L158 Benchmark]: Boogie Preprocessor took 13.09ms. Allocated memory is still 69.2MB. Free memory was 53.4MB in the beginning and 52.6MB in the end (delta: 886.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 09:04:34,549 INFO L158 Benchmark]: RCFGBuilder took 200.72ms. Allocated memory is still 69.2MB. Free memory was 52.3MB in the beginning and 44.7MB in the end (delta: 7.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-28 09:04:34,550 INFO L158 Benchmark]: BuchiAutomizer took 8190.55ms. Allocated memory was 69.2MB in the beginning and 86.0MB in the end (delta: 16.8MB). Free memory was 44.7MB in the beginning and 41.7MB in the end (delta: 3.0MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. [2021-12-28 09:04:34,550 INFO L158 Benchmark]: Witness Printer took 34.72ms. Allocated memory is still 86.0MB. Free memory was 41.7MB in the beginning and 38.3MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 09:04:34,551 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 54.5MB. Free memory is still 36.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 132.73ms. Allocated memory is still 54.5MB. Free memory was 31.5MB in the beginning and 36.7MB in the end (delta: -5.2MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.71ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 36.5MB in the beginning and 53.4MB in the end (delta: -16.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 13.09ms. Allocated memory is still 69.2MB. Free memory was 53.4MB in the beginning and 52.6MB in the end (delta: 886.3kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 200.72ms. Allocated memory is still 69.2MB. Free memory was 52.3MB in the beginning and 44.7MB in the end (delta: 7.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 8190.55ms. Allocated memory was 69.2MB in the beginning and 86.0MB in the end (delta: 16.8MB). Free memory was 44.7MB in the beginning and 41.7MB in the end (delta: 3.0MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. * Witness Printer took 34.72ms. Allocated memory is still 86.0MB. Free memory was 41.7MB in the beginning and 38.3MB in the end (delta: 3.4MB). 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 i and consists of 4 locations. One deterministic module has affine ranking function i and consists of 3 locations. One deterministic module has affine ranking function -2 * i + 99 and consists of 3 locations. One nondeterministic module has affine ranking function i and consists of 3 locations. One nondeterministic module has affine ranking function -2 * i + 99 and consists of 3 locations. 6 modules have a trivial ranking function, the largest among these consists of 52 locations. The remainder module has 106 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.1s and 8 iterations. TraceHistogramMax:52. Analysis of lassos took 6.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 9. Automata minimization 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 9 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 106 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.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 79 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 351 IncrementalHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 54 mSDtfsCounter, 351 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT3 SILN2 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax199 hnf100 lsp50 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq149 hnf94 smp100 dnf100 smp100 tf111 neg97 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 10]: 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 {i=49, \result=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 10]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] i = 0 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND FALSE !(i < 50) [L11] i = i-1 [L9] COND TRUE i < 100 Loop: [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND FALSE !(i < 50) [L11] i = i-1 [L9] COND TRUE i < 100 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-12-28 09:04:34,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2021-12-28 09:04:34,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2021-12-28 09:04:35,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2021-12-28 09:04:35,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-28 09:04:35,405 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-28 09:04:35,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)