./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursive/MultCommutative-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/recursive/MultCommutative-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash a755472942b72da612d26a2f3af20ed4332f07b5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 03:05:42,234 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:05:42,237 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:05:42,250 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:05:42,251 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:05:42,252 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:05:42,254 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:05:42,257 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:05:42,259 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:05:42,260 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:05:42,262 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:05:42,263 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:05:42,263 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:05:42,265 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:05:42,266 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:05:42,267 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:05:42,269 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:05:42,270 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:05:42,272 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:05:42,274 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:05:42,279 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:05:42,284 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:05:42,289 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:05:42,293 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:05:42,299 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:05:42,299 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:05:42,300 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:05:42,301 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:05:42,303 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:05:42,304 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:05:42,304 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:05:42,305 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:05:42,308 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:05:42,309 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:05:42,311 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:05:42,312 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:05:42,313 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:05:42,313 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:05:42,314 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:05:42,315 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:05:42,318 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:05:42,319 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 03:05:42,365 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:05:42,366 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:05:42,368 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:05:42,368 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:05:42,369 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:05:42,369 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:05:42,369 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:05:42,370 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:05:42,370 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:05:42,370 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:05:42,372 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:05:42,372 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:05:42,373 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:05:42,373 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:05:42,374 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:05:42,374 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:05:42,374 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:05:42,375 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:05:42,375 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:05:42,375 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:05:42,375 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:05:42,376 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:05:42,376 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:05:42,376 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:05:42,376 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:05:42,377 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:05:42,377 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:05:42,377 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:05:42,378 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:05:42,378 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:05:42,378 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:05:42,380 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:05:42,382 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:05:42,382 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a755472942b72da612d26a2f3af20ed4332f07b5 [2020-07-29 03:05:42,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:05:42,797 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:05:42,801 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:05:42,803 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:05:42,804 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:05:42,805 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/MultCommutative-2.c [2020-07-29 03:05:42,897 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf6c889f1/0fa17d1ffcb442f3ad96c7b3679afd67/FLAG47b05e562 [2020-07-29 03:05:43,426 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:05:43,427 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/MultCommutative-2.c [2020-07-29 03:05:43,436 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf6c889f1/0fa17d1ffcb442f3ad96c7b3679afd67/FLAG47b05e562 [2020-07-29 03:05:43,767 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf6c889f1/0fa17d1ffcb442f3ad96c7b3679afd67 [2020-07-29 03:05:43,771 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:05:43,774 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:05:43,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:05:43,775 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:05:43,779 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:05:43,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:05:43" (1/1) ... [2020-07-29 03:05:43,785 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6457a5b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:43, skipping insertion in model container [2020-07-29 03:05:43,786 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:05:43" (1/1) ... [2020-07-29 03:05:43,795 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:05:43,822 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:05:44,031 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:05:44,037 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:05:44,056 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:05:44,072 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:05:44,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:44 WrapperNode [2020-07-29 03:05:44,073 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:05:44,074 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:05:44,074 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:05:44,075 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:05:44,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:44" (1/1) ... [2020-07-29 03:05:44,091 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:44" (1/1) ... [2020-07-29 03:05:44,177 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:05:44,178 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:05:44,179 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:05:44,179 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:05:44,190 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:44" (1/1) ... [2020-07-29 03:05:44,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:44" (1/1) ... [2020-07-29 03:05:44,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:44" (1/1) ... [2020-07-29 03:05:44,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:44" (1/1) ... [2020-07-29 03:05:44,196 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:44" (1/1) ... [2020-07-29 03:05:44,199 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:44" (1/1) ... [2020-07-29 03:05:44,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:44" (1/1) ... [2020-07-29 03:05:44,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:05:44,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:05:44,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:05:44,203 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:05:44,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:44,276 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2020-07-29 03:05:44,276 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2020-07-29 03:05:44,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:05:44,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:05:44,582 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:05:44,583 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-29 03:05:44,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:05:44 BoogieIcfgContainer [2020-07-29 03:05:44,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:05:44,590 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:05:44,590 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:05:44,595 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:05:44,596 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:05:44,597 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:05:43" (1/3) ... [2020-07-29 03:05:44,598 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e07cc52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:05:44, skipping insertion in model container [2020-07-29 03:05:44,599 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:05:44,599 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:44" (2/3) ... [2020-07-29 03:05:44,599 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e07cc52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:05:44, skipping insertion in model container [2020-07-29 03:05:44,600 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:05:44,600 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:05:44" (3/3) ... [2020-07-29 03:05:44,602 INFO L371 chiAutomizerObserver]: Analyzing ICFG MultCommutative-2.c [2020-07-29 03:05:44,706 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:05:44,707 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:05:44,707 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:05:44,707 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:05:44,708 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:05:44,708 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:05:44,708 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:05:44,708 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:05:44,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-07-29 03:05:44,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 03:05:44,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:44,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:44,785 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 03:05:44,786 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:05:44,786 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:05:44,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-07-29 03:05:44,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 03:05:44,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:44,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:44,794 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 03:05:44,794 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:05:44,801 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_~m~0, main_~n~0, main_~res1~0, main_~res2~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; 8#L27true assume !(main_~m~0 < 0 || main_~m~0 > 46340);main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 10#L31true assume !(main_~n~0 < 0 || main_~n~0 > 46340); 16#L34true call main_#t~ret4 := mult(main_~m~0, main_~n~0);< 4#multENTRYtrue [2020-07-29 03:05:44,802 INFO L796 eck$LassoCheckResult]: Loop: 4#multENTRYtrue ~n := #in~n;~m := #in~m; 6#L16true assume ~m < 0; 3#L17true call #t~ret0 := mult(~n, -~m);< 4#multENTRYtrue [2020-07-29 03:05:44,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:44,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1390425, now seen corresponding path program 1 times [2020-07-29 03:05:44,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:44,819 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744490523] [2020-07-29 03:05:44,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:44,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:44,912 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:44,920 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:44,939 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:05:44,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:44,942 INFO L82 PathProgramCache]: Analyzing trace with hash 29924, now seen corresponding path program 1 times [2020-07-29 03:05:44,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:44,942 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8478032] [2020-07-29 03:05:44,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:44,956 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:44,961 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:44,964 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:05:44,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:44,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1527521652, now seen corresponding path program 1 times [2020-07-29 03:05:44,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:44,968 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374841331] [2020-07-29 03:05:44,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:45,103 INFO L280 TraceCheckUtils]: 0: Hoare triple {29#true} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_~m~0, main_~n~0, main_~res1~0, main_~res2~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; {29#true} is VALID [2020-07-29 03:05:45,105 INFO L280 TraceCheckUtils]: 1: Hoare triple {29#true} assume !(main_~m~0 < 0 || main_~m~0 > 46340);main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; {29#true} is VALID [2020-07-29 03:05:45,107 INFO L280 TraceCheckUtils]: 2: Hoare triple {29#true} assume !(main_~n~0 < 0 || main_~n~0 > 46340); {31#(<= 0 ULTIMATE.start_main_~n~0)} is VALID [2020-07-29 03:05:45,109 INFO L263 TraceCheckUtils]: 3: Hoare triple {31#(<= 0 ULTIMATE.start_main_~n~0)} call main_#t~ret4 := mult(main_~m~0, main_~n~0); {32#(<= 0 |mult_#in~m|)} is VALID [2020-07-29 03:05:45,110 INFO L280 TraceCheckUtils]: 4: Hoare triple {32#(<= 0 |mult_#in~m|)} ~n := #in~n;~m := #in~m; {33#(<= 0 mult_~m)} is VALID [2020-07-29 03:05:45,111 INFO L280 TraceCheckUtils]: 5: Hoare triple {33#(<= 0 mult_~m)} assume ~m < 0; {30#false} is VALID [2020-07-29 03:05:45,112 INFO L263 TraceCheckUtils]: 6: Hoare triple {30#false} call #t~ret0 := mult(~n, -~m); {30#false} is VALID [2020-07-29 03:05:45,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:05:45,115 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374841331] [2020-07-29 03:05:45,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:05:45,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:05:45,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690400665] [2020-07-29 03:05:45,277 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:05:45,277 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:05:45,278 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:05:45,278 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:05:45,278 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:05:45,278 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:45,278 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:05:45,279 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:05:45,279 INFO L133 ssoRankerPreferences]: Filename of dumped script: MultCommutative-2.c_Iteration1_Loop [2020-07-29 03:05:45,279 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:05:45,279 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:05:45,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:45,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:45,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:45,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:45,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:45,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:45,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:45,542 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:05:45,543 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:45,555 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:45,557 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:45,568 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:45,569 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret1=0} Honda state: {mult_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:45,614 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:45,614 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:45,618 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:45,619 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~n=0} Honda state: {mult_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:45,658 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:45,658 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:45,662 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:45,663 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#res=0} Honda state: {mult_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:45,689 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:45,690 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:45,694 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:45,694 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~m=0} Honda state: {mult_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:45,724 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:45,724 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:45,728 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:45,729 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret0=0} Honda state: {mult_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:45,760 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:45,760 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:45,764 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:45,765 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#in~n=0} Honda state: {mult_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:05:45,791 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:45,791 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:45,829 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:05:45,830 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:45,923 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:05:45,928 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:05:45,928 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:05:45,928 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:05:45,928 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:05:45,928 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:05:45,929 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:45,929 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:05:45,929 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:05:45,929 INFO L133 ssoRankerPreferences]: Filename of dumped script: MultCommutative-2.c_Iteration1_Loop [2020-07-29 03:05:45,929 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:05:45,929 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:05:45,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:45,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:45,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:45,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:45,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:45,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:45,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:46,130 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:05:46,138 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:05:46,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:46,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:46,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:46,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:46,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:46,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:46,161 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:46,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:46,166 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:05:46,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:46,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:46,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:46,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:46,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:46,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:46,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:46,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:46,222 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:05:46,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:46,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:46,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:46,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:46,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:46,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:46,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:46,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:46,283 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:05:46,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:46,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:46,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:46,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:46,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:46,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:46,345 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:46,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:46,348 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:05:46,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:46,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:46,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:46,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:46,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:46,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:46,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:46,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:46,409 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:46,451 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:46,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:46,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:46,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:46,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:46,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:46,456 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:46,456 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:46,459 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:05:46,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:46,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:46,502 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:46,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:46,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:46,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:46,504 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:46,505 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:46,508 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:05:46,517 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 03:05:46,517 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:05:46,536 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:05:46,537 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:05:46,537 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:05:46,538 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_#in~m) = -1*mult_#in~m Supporting invariants [] Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:46,574 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:05:46,578 INFO L393 LassoCheck]: Loop: "~n := #in~n;~m := #in~m;" "assume ~m < 0;" "call #t~ret0 := mult(~n, -~m);"< [2020-07-29 03:05:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:46,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:46,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:05:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:46,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:46,659 INFO L280 TraceCheckUtils]: 0: Hoare triple {34#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_~m~0, main_~n~0, main_~res1~0, main_~res2~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; {34#unseeded} is VALID [2020-07-29 03:05:46,661 INFO L280 TraceCheckUtils]: 1: Hoare triple {34#unseeded} assume !(main_~m~0 < 0 || main_~m~0 > 46340);main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; {34#unseeded} is VALID [2020-07-29 03:05:46,663 INFO L280 TraceCheckUtils]: 2: Hoare triple {34#unseeded} assume !(main_~n~0 < 0 || main_~n~0 > 46340); {34#unseeded} is VALID [2020-07-29 03:05:46,664 INFO L263 TraceCheckUtils]: 3: Hoare triple {34#unseeded} call main_#t~ret4 := mult(main_~m~0, main_~n~0); {34#unseeded} is VALID [2020-07-29 03:05:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:46,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 03:05:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:46,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:46,768 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#(>= oldRank0 (* (- 1) |mult_#in~m|))} ~n := #in~n;~m := #in~m; {61#(<= 0 (+ mult_~m oldRank0))} is VALID [2020-07-29 03:05:46,770 INFO L280 TraceCheckUtils]: 1: Hoare triple {61#(<= 0 (+ mult_~m oldRank0))} assume ~m < 0; {65#(and (<= 0 (+ mult_~m oldRank0)) (< mult_~m 0))} is VALID [2020-07-29 03:05:46,772 INFO L263 TraceCheckUtils]: 2: Hoare triple {65#(and (<= 0 (+ mult_~m oldRank0)) (< mult_~m 0))} call #t~ret0 := mult(~n, -~m); {47#(or (and (> oldRank0 (* (- 1) |mult_#in~m|)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:05:46,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:05:46,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:05:46,804 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:05:46,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 03:05:46,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:46,816 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 03:05:46,818 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 4 states. [2020-07-29 03:05:47,076 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 4 states. Result 50 states and 65 transitions. Complement of second has 12 states. [2020-07-29 03:05:47,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:05:47,077 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:47,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-07-29 03:05:47,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 03:05:47,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:47,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:47,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 03:05:47,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:05:47,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:47,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:47,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 65 transitions. [2020-07-29 03:05:47,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 03:05:47,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:47,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:47,097 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states. [2020-07-29 03:05:47,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 03:05:47,103 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 03:05:47,103 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 03:05:47,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:05:47,106 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:05:47,106 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 50 states and 65 transitions. cyclomatic complexity: 17 [2020-07-29 03:05:47,108 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 03:05:47,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 03:05:47,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 03:05:47,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 3 letters. [2020-07-29 03:05:47,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:47,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:47,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:47,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:05:47,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:05:47,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:05:47,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 50 letters. Loop has 50 letters. [2020-07-29 03:05:47,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 50 letters. Loop has 50 letters. [2020-07-29 03:05:47,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 50 letters. Loop has 50 letters. [2020-07-29 03:05:47,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 03:05:47,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 03:05:47,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 21 letters. Loop has 21 letters. [2020-07-29 03:05:47,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:05:47,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:05:47,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:05:47,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:05:47,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:05:47,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:05:47,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:05:47,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:05:47,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:05:47,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 03:05:47,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 03:05:47,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 3 letters. [2020-07-29 03:05:47,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 03:05:47,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 03:05:47,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 3 letters. [2020-07-29 03:05:47,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:05:47,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:05:47,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:05:47,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:47,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:47,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:47,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:05:47,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:05:47,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:05:47,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:05:47,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:05:47,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:05:47,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:05:47,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:05:47,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:05:47,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:05:47,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:05:47,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:05:47,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:47,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:47,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 65 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:47,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,139 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:47,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 03:05:47,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-07-29 03:05:47,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 3 letters. [2020-07-29 03:05:47,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 3 letters. [2020-07-29 03:05:47,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 6 letters. [2020-07-29 03:05:47,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:47,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 65 transitions. cyclomatic complexity: 17 [2020-07-29 03:05:47,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 03:05:47,172 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 31 states and 44 transitions. [2020-07-29 03:05:47,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-07-29 03:05:47,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2020-07-29 03:05:47,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 44 transitions. [2020-07-29 03:05:47,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:05:47,176 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2020-07-29 03:05:47,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 44 transitions. [2020-07-29 03:05:47,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2020-07-29 03:05:47,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:05:47,212 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states and 44 transitions. Second operand 27 states. [2020-07-29 03:05:47,213 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states and 44 transitions. Second operand 27 states. [2020-07-29 03:05:47,216 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. Second operand 27 states. [2020-07-29 03:05:47,220 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:05:47,233 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2020-07-29 03:05:47,234 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2020-07-29 03:05:47,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:47,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:47,238 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 31 states and 44 transitions. [2020-07-29 03:05:47,238 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 31 states and 44 transitions. [2020-07-29 03:05:47,239 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:05:47,251 INFO L93 Difference]: Finished difference Result 87 states and 113 transitions. [2020-07-29 03:05:47,252 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 113 transitions. [2020-07-29 03:05:47,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:47,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:47,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:05:47,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:05:47,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-29 03:05:47,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2020-07-29 03:05:47,260 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2020-07-29 03:05:47,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:05:47,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:05:47,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:05:47,265 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand 5 states. [2020-07-29 03:05:47,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:05:47,455 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2020-07-29 03:05:47,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 03:05:47,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:05:47,469 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:05:47,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2020-07-29 03:05:47,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 03:05:47,477 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 26 states and 33 transitions. [2020-07-29 03:05:47,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2020-07-29 03:05:47,478 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2020-07-29 03:05:47,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2020-07-29 03:05:47,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:05:47,479 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-07-29 03:05:47,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2020-07-29 03:05:47,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2020-07-29 03:05:47,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:05:47,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states and 33 transitions. Second operand 22 states. [2020-07-29 03:05:47,484 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states and 33 transitions. Second operand 22 states. [2020-07-29 03:05:47,485 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 22 states. [2020-07-29 03:05:47,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:05:47,488 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2020-07-29 03:05:47,489 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2020-07-29 03:05:47,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:47,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:47,490 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 26 states and 33 transitions. [2020-07-29 03:05:47,491 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 26 states and 33 transitions. [2020-07-29 03:05:47,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:05:47,495 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2020-07-29 03:05:47,495 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2020-07-29 03:05:47,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:47,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:47,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:05:47,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:05:47,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-29 03:05:47,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2020-07-29 03:05:47,500 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-07-29 03:05:47,500 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-07-29 03:05:47,500 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:05:47,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2020-07-29 03:05:47,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 03:05:47,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:47,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:47,504 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:05:47,504 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:05:47,505 INFO L794 eck$LassoCheckResult]: Stem: 504#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_~m~0, main_~n~0, main_~res1~0, main_~res2~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; 502#L27 assume !(main_~m~0 < 0 || main_~m~0 > 46340);main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 503#L31 assume !(main_~n~0 < 0 || main_~n~0 > 46340); 497#L34 call main_#t~ret4 := mult(main_~m~0, main_~n~0);< 496#multENTRY ~n := #in~n;~m := #in~m; 498#L16 assume !(~m < 0); 499#L19 assume !(0 == ~m); 492#L22 call #t~ret1 := mult(~n, ~m - 1);< 495#multENTRY [2020-07-29 03:05:47,505 INFO L796 eck$LassoCheckResult]: Loop: 495#multENTRY ~n := #in~n;~m := #in~m; 510#L16 assume ~m < 0; 491#L17 call #t~ret0 := mult(~n, -~m);< 495#multENTRY [2020-07-29 03:05:47,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:47,506 INFO L82 PathProgramCache]: Analyzing trace with hash -108528961, now seen corresponding path program 1 times [2020-07-29 03:05:47,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:47,507 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80854041] [2020-07-29 03:05:47,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:47,545 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:47,568 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:47,573 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:05:47,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:47,579 INFO L82 PathProgramCache]: Analyzing trace with hash 29924, now seen corresponding path program 2 times [2020-07-29 03:05:47,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:47,580 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884599475] [2020-07-29 03:05:47,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:47,591 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:47,602 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:47,604 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:05:47,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:47,607 INFO L82 PathProgramCache]: Analyzing trace with hash 924096870, now seen corresponding path program 1 times [2020-07-29 03:05:47,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:47,611 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648595779] [2020-07-29 03:05:47,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:47,685 INFO L280 TraceCheckUtils]: 0: Hoare triple {572#true} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_~m~0, main_~n~0, main_~res1~0, main_~res2~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; {572#true} is VALID [2020-07-29 03:05:47,685 INFO L280 TraceCheckUtils]: 1: Hoare triple {572#true} assume !(main_~m~0 < 0 || main_~m~0 > 46340);main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; {572#true} is VALID [2020-07-29 03:05:47,686 INFO L280 TraceCheckUtils]: 2: Hoare triple {572#true} assume !(main_~n~0 < 0 || main_~n~0 > 46340); {572#true} is VALID [2020-07-29 03:05:47,686 INFO L263 TraceCheckUtils]: 3: Hoare triple {572#true} call main_#t~ret4 := mult(main_~m~0, main_~n~0); {572#true} is VALID [2020-07-29 03:05:47,686 INFO L280 TraceCheckUtils]: 4: Hoare triple {572#true} ~n := #in~n;~m := #in~m; {572#true} is VALID [2020-07-29 03:05:47,687 INFO L280 TraceCheckUtils]: 5: Hoare triple {572#true} assume !(~m < 0); {574#(< 0 (+ mult_~m 1))} is VALID [2020-07-29 03:05:47,689 INFO L280 TraceCheckUtils]: 6: Hoare triple {574#(< 0 (+ mult_~m 1))} assume !(0 == ~m); {575#(< 0 mult_~m)} is VALID [2020-07-29 03:05:47,691 INFO L263 TraceCheckUtils]: 7: Hoare triple {575#(< 0 mult_~m)} call #t~ret1 := mult(~n, ~m - 1); {576#(<= 0 |mult_#in~m|)} is VALID [2020-07-29 03:05:47,692 INFO L280 TraceCheckUtils]: 8: Hoare triple {576#(<= 0 |mult_#in~m|)} ~n := #in~n;~m := #in~m; {574#(< 0 (+ mult_~m 1))} is VALID [2020-07-29 03:05:47,694 INFO L280 TraceCheckUtils]: 9: Hoare triple {574#(< 0 (+ mult_~m 1))} assume ~m < 0; {573#false} is VALID [2020-07-29 03:05:47,694 INFO L263 TraceCheckUtils]: 10: Hoare triple {573#false} call #t~ret0 := mult(~n, -~m); {573#false} is VALID [2020-07-29 03:05:47,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:05:47,696 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648595779] [2020-07-29 03:05:47,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:05:47,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:05:47,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046081967] [2020-07-29 03:05:47,771 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:05:47,771 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:05:47,772 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:05:47,772 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:05:47,772 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:05:47,772 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:47,773 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:05:47,773 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:05:47,773 INFO L133 ssoRankerPreferences]: Filename of dumped script: MultCommutative-2.c_Iteration2_Loop [2020-07-29 03:05:47,773 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:05:47,773 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:05:47,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:47,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:47,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:47,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:47,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:47,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:47,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:47,947 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:05:47,948 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:05:47,960 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:47,960 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:47,966 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:47,966 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret0=0} Honda state: {mult_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:48,009 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:48,009 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:48,013 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:48,013 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~m=0} Honda state: {mult_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:48,050 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:48,050 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:48,054 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:48,054 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret1=0} Honda state: {mult_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:48,089 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:48,089 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:48,093 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:48,093 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#res=0} Honda state: {mult_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:48,117 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:48,118 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:48,126 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:48,126 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~n=0} Honda state: {mult_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:48,151 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:48,151 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:48,177 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:05:48,177 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:48,224 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:05:48,226 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:05:48,226 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:05:48,226 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:05:48,226 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:05:48,226 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:05:48,226 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:48,226 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:05:48,226 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:05:48,226 INFO L133 ssoRankerPreferences]: Filename of dumped script: MultCommutative-2.c_Iteration2_Loop [2020-07-29 03:05:48,227 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:05:48,227 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:05:48,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:48,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:48,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:48,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:48,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:48,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:48,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:48,402 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:05:48,403 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:05:48,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:48,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:48,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:48,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:48,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:48,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:48,420 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:48,420 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:48,429 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:48,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:48,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:48,457 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:48,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:48,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:48,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:48,458 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:48,458 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:48,460 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:48,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:48,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:48,484 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:48,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:48,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:48,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:48,487 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:48,487 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:48,489 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:48,512 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:48,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:48,514 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:48,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:48,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:48,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:48,516 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:48,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:48,519 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:48,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:48,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:48,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:48,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:48,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:48,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:48,548 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:48,548 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:48,550 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:05:48,553 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 03:05:48,554 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:48,556 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:05:48,556 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:05:48,556 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:05:48,556 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_#in~m) = -1*mult_#in~m Supporting invariants [] [2020-07-29 03:05:48,581 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:05:48,583 INFO L393 LassoCheck]: Loop: "~n := #in~n;~m := #in~m;" "assume ~m < 0;" "call #t~ret0 := mult(~n, -~m);"< [2020-07-29 03:05:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:48,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:48,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 03:05:48,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:48,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:48,641 INFO L280 TraceCheckUtils]: 0: Hoare triple {577#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_~m~0, main_~n~0, main_~res1~0, main_~res2~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; {577#unseeded} is VALID [2020-07-29 03:05:48,642 INFO L280 TraceCheckUtils]: 1: Hoare triple {577#unseeded} assume !(main_~m~0 < 0 || main_~m~0 > 46340);main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; {577#unseeded} is VALID [2020-07-29 03:05:48,642 INFO L280 TraceCheckUtils]: 2: Hoare triple {577#unseeded} assume !(main_~n~0 < 0 || main_~n~0 > 46340); {577#unseeded} is VALID [2020-07-29 03:05:48,643 INFO L263 TraceCheckUtils]: 3: Hoare triple {577#unseeded} call main_#t~ret4 := mult(main_~m~0, main_~n~0); {577#unseeded} is VALID [2020-07-29 03:05:48,644 INFO L280 TraceCheckUtils]: 4: Hoare triple {577#unseeded} ~n := #in~n;~m := #in~m; {577#unseeded} is VALID [2020-07-29 03:05:48,645 INFO L280 TraceCheckUtils]: 5: Hoare triple {577#unseeded} assume !(~m < 0); {577#unseeded} is VALID [2020-07-29 03:05:48,645 INFO L280 TraceCheckUtils]: 6: Hoare triple {577#unseeded} assume !(0 == ~m); {577#unseeded} is VALID [2020-07-29 03:05:48,646 INFO L263 TraceCheckUtils]: 7: Hoare triple {577#unseeded} call #t~ret1 := mult(~n, ~m - 1); {577#unseeded} is VALID [2020-07-29 03:05:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:48,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 03:05:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:48,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:48,714 INFO L280 TraceCheckUtils]: 0: Hoare triple {580#(>= oldRank0 (* (- 1) |mult_#in~m|))} ~n := #in~n;~m := #in~m; {616#(<= 0 (+ mult_~m oldRank0))} is VALID [2020-07-29 03:05:48,715 INFO L280 TraceCheckUtils]: 1: Hoare triple {616#(<= 0 (+ mult_~m oldRank0))} assume ~m < 0; {620#(and (<= 0 (+ mult_~m oldRank0)) (< mult_~m 0))} is VALID [2020-07-29 03:05:48,717 INFO L263 TraceCheckUtils]: 2: Hoare triple {620#(and (<= 0 (+ mult_~m oldRank0)) (< mult_~m 0))} call #t~ret0 := mult(~n, -~m); {590#(or (and (> oldRank0 (* (- 1) |mult_#in~m|)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:05:48,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:05:48,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:05:48,728 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:05:48,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:05:48,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,729 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 03:05:48,729 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 6 Second operand 4 states. [2020-07-29 03:05:48,967 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 72 states and 91 transitions. Complement of second has 15 states. [2020-07-29 03:05:48,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 03:05:48,968 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:48,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. cyclomatic complexity: 6 [2020-07-29 03:05:48,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:48,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:48,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 03:05:48,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:05:48,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:48,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:48,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 91 transitions. [2020-07-29 03:05:48,973 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 03:05:48,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:48,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:48,975 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 22 states and 27 transitions. cyclomatic complexity: 6 [2020-07-29 03:05:48,976 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 03:05:48,976 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 03:05:48,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:05:48,978 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:05:48,978 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 72 states and 91 transitions. cyclomatic complexity: 22 [2020-07-29 03:05:48,981 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 03:05:48,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:05:48,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:05:48,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 91 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:05:48,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:48,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:48,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 91 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:48,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:05:48,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:05:48,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 91 transitions. cyclomatic complexity: 22 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:05:48,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 6 Stem has 72 letters. Loop has 72 letters. [2020-07-29 03:05:48,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 72 letters. Loop has 72 letters. [2020-07-29 03:05:48,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 91 transitions. cyclomatic complexity: 22 Stem has 72 letters. Loop has 72 letters. [2020-07-29 03:05:48,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 6 Stem has 22 letters. Loop has 22 letters. [2020-07-29 03:05:48,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 22 letters. Loop has 22 letters. [2020-07-29 03:05:48,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 91 transitions. cyclomatic complexity: 22 Stem has 22 letters. Loop has 22 letters. [2020-07-29 03:05:48,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:05:48,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:05:48,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 91 transitions. cyclomatic complexity: 22 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:05:48,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:05:48,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:05:48,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 91 transitions. cyclomatic complexity: 22 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:05:48,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:05:48,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:05:48,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 91 transitions. cyclomatic complexity: 22 Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:05:48,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:48,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:48,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 91 transitions. cyclomatic complexity: 22 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:48,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:05:48,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:05:48,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 91 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:05:48,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:05:48,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:05:48,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 91 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:05:48,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:48,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:48,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 91 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:48,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:05:48,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:05:48,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 91 transitions. cyclomatic complexity: 22 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:05:48,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:05:48,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:05:48,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 91 transitions. cyclomatic complexity: 22 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:05:48,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:05:48,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:05:48,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 91 transitions. cyclomatic complexity: 22 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:05:48,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:05:48,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:05:48,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 91 transitions. cyclomatic complexity: 22 Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:05:48,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:05:48,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:05:48,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:48,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 91 transitions. cyclomatic complexity: 22 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:05:49,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:49,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:05:49,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:49,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:05:49,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:49,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 91 transitions. cyclomatic complexity: 22 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:05:49,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:49,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:05:49,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:49,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:05:49,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:49,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 91 transitions. cyclomatic complexity: 22 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:05:49,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:49,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:05:49,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:49,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:05:49,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:49,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 91 transitions. cyclomatic complexity: 22 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:05:49,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:49,003 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:49,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 03:05:49,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-29 03:05:49,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:05:49,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:49,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:05:49,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:49,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 8 letters. Loop has 6 letters. [2020-07-29 03:05:49,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:49,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 91 transitions. cyclomatic complexity: 22 [2020-07-29 03:05:49,011 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 03:05:49,016 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 50 states and 65 transitions. [2020-07-29 03:05:49,016 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2020-07-29 03:05:49,016 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2020-07-29 03:05:49,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 65 transitions. [2020-07-29 03:05:49,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:05:49,017 INFO L688 BuchiCegarLoop]: Abstraction has 50 states and 65 transitions. [2020-07-29 03:05:49,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 65 transitions. [2020-07-29 03:05:49,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2020-07-29 03:05:49,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:05:49,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states and 65 transitions. Second operand 43 states. [2020-07-29 03:05:49,021 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states and 65 transitions. Second operand 43 states. [2020-07-29 03:05:49,021 INFO L87 Difference]: Start difference. First operand 50 states and 65 transitions. Second operand 43 states. [2020-07-29 03:05:49,022 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:05:49,030 INFO L93 Difference]: Finished difference Result 93 states and 116 transitions. [2020-07-29 03:05:49,031 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2020-07-29 03:05:49,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:49,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:49,033 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 50 states and 65 transitions. [2020-07-29 03:05:49,033 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 50 states and 65 transitions. [2020-07-29 03:05:49,034 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:05:49,054 INFO L93 Difference]: Finished difference Result 123 states and 155 transitions. [2020-07-29 03:05:49,055 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 155 transitions. [2020-07-29 03:05:49,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:49,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:49,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:05:49,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:05:49,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-29 03:05:49,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2020-07-29 03:05:49,065 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2020-07-29 03:05:49,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:05:49,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:05:49,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:05:49,066 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand 5 states. [2020-07-29 03:05:49,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:05:49,266 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2020-07-29 03:05:49,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 03:05:49,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:05:49,282 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:05:49,282 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 59 transitions. [2020-07-29 03:05:49,287 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-07-29 03:05:49,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 41 states and 47 transitions. [2020-07-29 03:05:49,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2020-07-29 03:05:49,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2020-07-29 03:05:49,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2020-07-29 03:05:49,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:05:49,290 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2020-07-29 03:05:49,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2020-07-29 03:05:49,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-29 03:05:49,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:05:49,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states and 47 transitions. Second operand 41 states. [2020-07-29 03:05:49,294 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states and 47 transitions. Second operand 41 states. [2020-07-29 03:05:49,294 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 41 states. [2020-07-29 03:05:49,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:05:49,296 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2020-07-29 03:05:49,297 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2020-07-29 03:05:49,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:49,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:49,297 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states and 47 transitions. [2020-07-29 03:05:49,298 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states and 47 transitions. [2020-07-29 03:05:49,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:05:49,300 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2020-07-29 03:05:49,300 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2020-07-29 03:05:49,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:49,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:49,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:05:49,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:05:49,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-29 03:05:49,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2020-07-29 03:05:49,303 INFO L711 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2020-07-29 03:05:49,303 INFO L591 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2020-07-29 03:05:49,303 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:05:49,303 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 47 transitions. [2020-07-29 03:05:49,304 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-07-29 03:05:49,304 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:49,304 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:49,305 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:05:49,305 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:05:49,305 INFO L794 eck$LassoCheckResult]: Stem: 1278#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_~m~0, main_~n~0, main_~res1~0, main_~res2~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; 1275#L27 assume !(main_~m~0 < 0 || main_~m~0 > 46340);main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 1276#L31 assume !(main_~n~0 < 0 || main_~n~0 > 46340); 1277#L34 call main_#t~ret4 := mult(main_~m~0, main_~n~0);< 1284#multENTRY ~n := #in~n;~m := #in~m; 1296#L16 assume !(~m < 0); 1293#L19 assume 0 == ~m;#res := 0; 1292#multFINAL assume true; 1286#multEXIT >#45#return; 1283#L34-1 main_~res1~0 := main_#t~ret4;havoc main_#t~ret4; 1268#L35 call main_#t~ret5 := mult(main_~n~0, main_~m~0);< 1269#multENTRY [2020-07-29 03:05:49,305 INFO L796 eck$LassoCheckResult]: Loop: 1269#multENTRY ~n := #in~n;~m := #in~m; 1291#L16 assume ~m < 0; 1267#L17 call #t~ret0 := mult(~n, -~m);< 1269#multENTRY [2020-07-29 03:05:49,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:49,306 INFO L82 PathProgramCache]: Analyzing trace with hash 922353405, now seen corresponding path program 1 times [2020-07-29 03:05:49,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:49,306 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849225992] [2020-07-29 03:05:49,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:49,314 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:49,321 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:49,323 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:05:49,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:49,324 INFO L82 PathProgramCache]: Analyzing trace with hash 29924, now seen corresponding path program 3 times [2020-07-29 03:05:49,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:49,324 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102661418] [2020-07-29 03:05:49,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:49,328 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:49,330 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:49,331 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:05:49,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:49,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1370471320, now seen corresponding path program 1 times [2020-07-29 03:05:49,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:49,332 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264400535] [2020-07-29 03:05:49,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:49,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-29 03:05:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:49,407 INFO L280 TraceCheckUtils]: 0: Hoare triple {1397#true} ~n := #in~n;~m := #in~m; {1397#true} is VALID [2020-07-29 03:05:49,408 INFO L280 TraceCheckUtils]: 1: Hoare triple {1397#true} assume !(~m < 0); {1397#true} is VALID [2020-07-29 03:05:49,408 INFO L280 TraceCheckUtils]: 2: Hoare triple {1397#true} assume 0 == ~m;#res := 0; {1397#true} is VALID [2020-07-29 03:05:49,408 INFO L280 TraceCheckUtils]: 3: Hoare triple {1397#true} assume true; {1397#true} is VALID [2020-07-29 03:05:49,409 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1397#true} {1399#(<= 0 ULTIMATE.start_main_~m~0)} #45#return; {1399#(<= 0 ULTIMATE.start_main_~m~0)} is VALID [2020-07-29 03:05:49,410 INFO L280 TraceCheckUtils]: 0: Hoare triple {1397#true} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_~m~0, main_~n~0, main_~res1~0, main_~res2~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; {1397#true} is VALID [2020-07-29 03:05:49,411 INFO L280 TraceCheckUtils]: 1: Hoare triple {1397#true} assume !(main_~m~0 < 0 || main_~m~0 > 46340);main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; {1399#(<= 0 ULTIMATE.start_main_~m~0)} is VALID [2020-07-29 03:05:49,412 INFO L280 TraceCheckUtils]: 2: Hoare triple {1399#(<= 0 ULTIMATE.start_main_~m~0)} assume !(main_~n~0 < 0 || main_~n~0 > 46340); {1399#(<= 0 ULTIMATE.start_main_~m~0)} is VALID [2020-07-29 03:05:49,413 INFO L263 TraceCheckUtils]: 3: Hoare triple {1399#(<= 0 ULTIMATE.start_main_~m~0)} call main_#t~ret4 := mult(main_~m~0, main_~n~0); {1397#true} is VALID [2020-07-29 03:05:49,413 INFO L280 TraceCheckUtils]: 4: Hoare triple {1397#true} ~n := #in~n;~m := #in~m; {1397#true} is VALID [2020-07-29 03:05:49,413 INFO L280 TraceCheckUtils]: 5: Hoare triple {1397#true} assume !(~m < 0); {1397#true} is VALID [2020-07-29 03:05:49,413 INFO L280 TraceCheckUtils]: 6: Hoare triple {1397#true} assume 0 == ~m;#res := 0; {1397#true} is VALID [2020-07-29 03:05:49,414 INFO L280 TraceCheckUtils]: 7: Hoare triple {1397#true} assume true; {1397#true} is VALID [2020-07-29 03:05:49,415 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1397#true} {1399#(<= 0 ULTIMATE.start_main_~m~0)} #45#return; {1399#(<= 0 ULTIMATE.start_main_~m~0)} is VALID [2020-07-29 03:05:49,417 INFO L280 TraceCheckUtils]: 9: Hoare triple {1399#(<= 0 ULTIMATE.start_main_~m~0)} main_~res1~0 := main_#t~ret4;havoc main_#t~ret4; {1399#(<= 0 ULTIMATE.start_main_~m~0)} is VALID [2020-07-29 03:05:49,418 INFO L263 TraceCheckUtils]: 10: Hoare triple {1399#(<= 0 ULTIMATE.start_main_~m~0)} call main_#t~ret5 := mult(main_~n~0, main_~m~0); {1405#(<= 0 |mult_#in~m|)} is VALID [2020-07-29 03:05:49,419 INFO L280 TraceCheckUtils]: 11: Hoare triple {1405#(<= 0 |mult_#in~m|)} ~n := #in~n;~m := #in~m; {1406#(<= 0 mult_~m)} is VALID [2020-07-29 03:05:49,420 INFO L280 TraceCheckUtils]: 12: Hoare triple {1406#(<= 0 mult_~m)} assume ~m < 0; {1398#false} is VALID [2020-07-29 03:05:49,421 INFO L263 TraceCheckUtils]: 13: Hoare triple {1398#false} call #t~ret0 := mult(~n, -~m); {1398#false} is VALID [2020-07-29 03:05:49,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:05:49,422 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264400535] [2020-07-29 03:05:49,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:05:49,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:05:49,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313434089] [2020-07-29 03:05:49,490 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:05:49,490 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:05:49,490 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:05:49,490 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:05:49,490 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:05:49,490 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:49,490 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:05:49,490 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:05:49,490 INFO L133 ssoRankerPreferences]: Filename of dumped script: MultCommutative-2.c_Iteration3_Loop [2020-07-29 03:05:49,491 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:05:49,491 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:05:49,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:49,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:49,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:49,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:49,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:49,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:49,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:49,648 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:05:49,648 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:49,650 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:49,651 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:49,653 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:49,654 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~m=0} Honda state: {mult_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:49,679 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:49,679 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:49,682 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:49,682 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret0=0} Honda state: {mult_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:49,706 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:49,706 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:49,709 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:49,709 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret1=0} Honda state: {mult_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:49,733 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:49,733 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:49,737 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:49,737 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#res=0} Honda state: {mult_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:49,760 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:49,760 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:49,768 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:49,768 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#in~n=0} Honda state: {mult_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:49,793 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:49,793 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:49,796 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:49,796 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~n=0} Honda state: {mult_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:49,821 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:49,821 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:05:49,849 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:05:49,849 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:49,912 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:05:49,914 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:05:49,914 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:05:49,914 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:05:49,914 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:05:49,914 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:05:49,914 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:49,915 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:05:49,915 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:05:49,915 INFO L133 ssoRankerPreferences]: Filename of dumped script: MultCommutative-2.c_Iteration3_Loop [2020-07-29 03:05:49,915 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:05:49,915 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:05:49,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:49,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:49,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:49,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:49,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:49,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:49,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:50,086 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:05:50,086 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:50,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:50,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:50,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:50,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:50,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:50,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:50,094 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:50,094 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:50,096 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:50,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:50,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:50,122 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:50,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:50,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:50,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:50,123 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:50,123 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:50,131 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:50,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:50,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:50,165 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:50,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:50,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:50,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:50,167 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:50,167 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:50,169 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:50,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:50,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:50,195 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:50,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:50,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:50,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:50,196 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:50,196 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:50,197 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:50,220 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:50,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:50,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:50,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:50,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:50,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:50,223 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:50,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:50,225 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:50,259 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:50,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:50,261 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:50,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:50,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:50,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:50,262 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:50,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:50,272 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:05:50,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:50,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:50,305 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:50,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:50,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:50,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:50,306 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:50,306 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:50,308 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:05:50,310 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 03:05:50,311 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:50,314 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:05:50,314 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:05:50,314 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:05:50,315 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_#in~m) = -1*mult_#in~m Supporting invariants [] [2020-07-29 03:05:50,338 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:05:50,349 INFO L393 LassoCheck]: Loop: "~n := #in~n;~m := #in~m;" "assume ~m < 0;" "call #t~ret0 := mult(~n, -~m);"< [2020-07-29 03:05:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:50,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:50,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 03:05:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:50,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:50,417 INFO L280 TraceCheckUtils]: 0: Hoare triple {1407#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_~m~0, main_~n~0, main_~res1~0, main_~res2~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; {1407#unseeded} is VALID [2020-07-29 03:05:50,418 INFO L280 TraceCheckUtils]: 1: Hoare triple {1407#unseeded} assume !(main_~m~0 < 0 || main_~m~0 > 46340);main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; {1407#unseeded} is VALID [2020-07-29 03:05:50,419 INFO L280 TraceCheckUtils]: 2: Hoare triple {1407#unseeded} assume !(main_~n~0 < 0 || main_~n~0 > 46340); {1407#unseeded} is VALID [2020-07-29 03:05:50,420 INFO L263 TraceCheckUtils]: 3: Hoare triple {1407#unseeded} call main_#t~ret4 := mult(main_~m~0, main_~n~0); {1434#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:05:50,420 INFO L280 TraceCheckUtils]: 4: Hoare triple {1434#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n;~m := #in~m; {1434#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:05:50,421 INFO L280 TraceCheckUtils]: 5: Hoare triple {1434#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~m < 0); {1434#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:05:50,422 INFO L280 TraceCheckUtils]: 6: Hoare triple {1434#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 0 == ~m;#res := 0; {1434#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:05:50,422 INFO L280 TraceCheckUtils]: 7: Hoare triple {1434#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {1434#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:05:50,424 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1434#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {1407#unseeded} #45#return; {1407#unseeded} is VALID [2020-07-29 03:05:50,424 INFO L280 TraceCheckUtils]: 9: Hoare triple {1407#unseeded} main_~res1~0 := main_#t~ret4;havoc main_#t~ret4; {1407#unseeded} is VALID [2020-07-29 03:05:50,425 INFO L263 TraceCheckUtils]: 10: Hoare triple {1407#unseeded} call main_#t~ret5 := mult(main_~n~0, main_~m~0); {1407#unseeded} is VALID [2020-07-29 03:05:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:50,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 03:05:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:50,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:50,500 INFO L280 TraceCheckUtils]: 0: Hoare triple {1410#(>= oldRank0 (* (- 1) |mult_#in~m|))} ~n := #in~n;~m := #in~m; {1456#(<= 0 (+ mult_~m oldRank0))} is VALID [2020-07-29 03:05:50,500 INFO L280 TraceCheckUtils]: 1: Hoare triple {1456#(<= 0 (+ mult_~m oldRank0))} assume ~m < 0; {1460#(and (<= 0 (+ mult_~m oldRank0)) (< mult_~m 0))} is VALID [2020-07-29 03:05:50,502 INFO L263 TraceCheckUtils]: 2: Hoare triple {1460#(and (<= 0 (+ mult_~m oldRank0)) (< mult_~m 0))} call #t~ret0 := mult(~n, -~m); {1420#(or (and (> oldRank0 (* (- 1) |mult_#in~m|)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:05:50,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:05:50,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:05:50,519 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:05:50,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:05:50,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,520 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2020-07-29 03:05:50,521 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 47 transitions. cyclomatic complexity: 9 Second operand 5 states. [2020-07-29 03:05:50,689 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 47 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 81 states and 90 transitions. Complement of second has 14 states. [2020-07-29 03:05:50,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:05:50,690 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:50,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 47 transitions. cyclomatic complexity: 9 [2020-07-29 03:05:50,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:50,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:50,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 03:05:50,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:05:50,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:50,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:50,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 90 transitions. [2020-07-29 03:05:50,694 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 03:05:50,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:50,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:50,695 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 47 transitions. cyclomatic complexity: 9 [2020-07-29 03:05:50,698 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2020-07-29 03:05:50,698 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 03:05:50,700 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:05:50,700 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:05:50,700 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 81 states and 90 transitions. cyclomatic complexity: 13 [2020-07-29 03:05:50,703 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 03:05:50,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 47 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:05:50,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:05:50,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 90 transitions. cyclomatic complexity: 13 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:05:50,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 47 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:50,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:50,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 90 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:50,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 47 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:50,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:50,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 90 transitions. cyclomatic complexity: 13 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:50,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 47 transitions. cyclomatic complexity: 9 Stem has 81 letters. Loop has 81 letters. [2020-07-29 03:05:50,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 81 letters. Loop has 81 letters. [2020-07-29 03:05:50,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 90 transitions. cyclomatic complexity: 13 Stem has 81 letters. Loop has 81 letters. [2020-07-29 03:05:50,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 47 transitions. cyclomatic complexity: 9 Stem has 41 letters. Loop has 41 letters. [2020-07-29 03:05:50,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 41 letters. Loop has 41 letters. [2020-07-29 03:05:50,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 90 transitions. cyclomatic complexity: 13 Stem has 41 letters. Loop has 41 letters. [2020-07-29 03:05:50,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 47 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:05:50,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:05:50,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 90 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:05:50,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 47 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:50,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:50,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 90 transitions. cyclomatic complexity: 13 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:50,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 47 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:05:50,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:05:50,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 90 transitions. cyclomatic complexity: 13 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:05:50,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 47 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:05:50,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:05:50,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 90 transitions. cyclomatic complexity: 13 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:05:50,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 47 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:05:50,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:05:50,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 90 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:05:50,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 47 transitions. cyclomatic complexity: 9 Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:05:50,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:05:50,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 90 transitions. cyclomatic complexity: 13 Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:05:50,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 47 transitions. cyclomatic complexity: 9 Stem has 19 letters. Loop has 3 letters. [2020-07-29 03:05:50,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 03:05:50,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 90 transitions. cyclomatic complexity: 13 Stem has 19 letters. Loop has 3 letters. [2020-07-29 03:05:50,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 47 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:05:50,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:05:50,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 90 transitions. cyclomatic complexity: 13 Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:05:50,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 47 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:05:50,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:05:50,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 90 transitions. cyclomatic complexity: 13 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:05:50,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 47 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:05:50,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:05:50,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 90 transitions. cyclomatic complexity: 13 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:05:50,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 47 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:05:50,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:05:50,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 90 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:05:50,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 47 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:50,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:50,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 90 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:50,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 47 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:50,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:50,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 90 transitions. cyclomatic complexity: 13 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:50,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 47 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:05:50,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:05:50,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 90 transitions. cyclomatic complexity: 13 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:05:50,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 47 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:05:50,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:05:50,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 90 transitions. cyclomatic complexity: 13 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:05:50,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 47 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:05:50,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:05:50,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 90 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:05:50,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 47 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 4 letters. [2020-07-29 03:05:50,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 4 letters. [2020-07-29 03:05:50,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 90 transitions. cyclomatic complexity: 13 Stem has 18 letters. Loop has 4 letters. [2020-07-29 03:05:50,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 47 transitions. cyclomatic complexity: 9 Stem has 19 letters. Loop has 4 letters. [2020-07-29 03:05:50,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 19 letters. Loop has 4 letters. [2020-07-29 03:05:50,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 90 transitions. cyclomatic complexity: 13 Stem has 19 letters. Loop has 4 letters. [2020-07-29 03:05:50,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 47 transitions. cyclomatic complexity: 9 Stem has 20 letters. Loop has 4 letters. [2020-07-29 03:05:50,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 4 letters. [2020-07-29 03:05:50,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 90 transitions. cyclomatic complexity: 13 Stem has 20 letters. Loop has 4 letters. [2020-07-29 03:05:50,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 47 transitions. cyclomatic complexity: 9 Stem has 21 letters. Loop has 4 letters. [2020-07-29 03:05:50,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 21 letters. Loop has 4 letters. [2020-07-29 03:05:50,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 90 transitions. cyclomatic complexity: 13 Stem has 21 letters. Loop has 4 letters. [2020-07-29 03:05:50,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,735 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:50,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 03:05:50,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2020-07-29 03:05:50,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:05:50,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:05:50,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 11 letters. Loop has 6 letters. [2020-07-29 03:05:50,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:50,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 90 transitions. cyclomatic complexity: 13 [2020-07-29 03:05:50,743 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 03:05:50,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 62 states and 70 transitions. [2020-07-29 03:05:50,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2020-07-29 03:05:50,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2020-07-29 03:05:50,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 70 transitions. [2020-07-29 03:05:50,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:05:50,747 INFO L688 BuchiCegarLoop]: Abstraction has 62 states and 70 transitions. [2020-07-29 03:05:50,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 70 transitions. [2020-07-29 03:05:50,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 35. [2020-07-29 03:05:50,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:05:50,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states and 70 transitions. Second operand 35 states. [2020-07-29 03:05:50,751 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states and 70 transitions. Second operand 35 states. [2020-07-29 03:05:50,752 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 35 states. [2020-07-29 03:05:50,752 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:05:50,756 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2020-07-29 03:05:50,757 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2020-07-29 03:05:50,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:50,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:50,758 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 62 states and 70 transitions. [2020-07-29 03:05:50,758 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 62 states and 70 transitions. [2020-07-29 03:05:50,759 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:05:50,764 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2020-07-29 03:05:50,765 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2020-07-29 03:05:50,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:50,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:50,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:05:50,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:05:50,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-29 03:05:50,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2020-07-29 03:05:50,768 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2020-07-29 03:05:50,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:05:50,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:05:50,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:05:50,769 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 5 states. [2020-07-29 03:05:50,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:05:50,879 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-29 03:05:50,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 03:05:50,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:05:50,898 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:05:50,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 40 transitions. [2020-07-29 03:05:50,901 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 03:05:50,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 35 states and 39 transitions. [2020-07-29 03:05:50,909 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2020-07-29 03:05:50,909 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2020-07-29 03:05:50,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 39 transitions. [2020-07-29 03:05:50,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:05:50,910 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 39 transitions. [2020-07-29 03:05:50,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 39 transitions. [2020-07-29 03:05:50,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2020-07-29 03:05:50,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:05:50,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states and 39 transitions. Second operand 31 states. [2020-07-29 03:05:50,917 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states and 39 transitions. Second operand 31 states. [2020-07-29 03:05:50,917 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 31 states. [2020-07-29 03:05:50,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:05:50,921 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-29 03:05:50,921 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-29 03:05:50,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:50,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:50,922 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 35 states and 39 transitions. [2020-07-29 03:05:50,922 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 35 states and 39 transitions. [2020-07-29 03:05:50,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:05:50,923 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-29 03:05:50,923 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-29 03:05:50,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:50,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:50,924 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:05:50,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:05:50,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-29 03:05:50,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-07-29 03:05:50,926 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-07-29 03:05:50,926 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-07-29 03:05:50,926 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:05:50,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2020-07-29 03:05:50,927 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 03:05:50,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:50,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:50,928 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:05:50,928 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:05:50,928 INFO L794 eck$LassoCheckResult]: Stem: 1977#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_~m~0, main_~n~0, main_~res1~0, main_~res2~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; 1974#L27 assume !(main_~m~0 < 0 || main_~m~0 > 46340);main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 1975#L31 assume !(main_~n~0 < 0 || main_~n~0 > 46340); 1976#L34 call main_#t~ret4 := mult(main_~m~0, main_~n~0);< 1983#multENTRY ~n := #in~n;~m := #in~m; 1990#L16 assume !(~m < 0); 1988#L19 assume 0 == ~m;#res := 0; 1987#multFINAL assume true; 1986#multEXIT >#45#return; 1982#L34-1 main_~res1~0 := main_#t~ret4;havoc main_#t~ret4; 1972#L35 call main_#t~ret5 := mult(main_~n~0, main_~m~0);< 1969#multENTRY [2020-07-29 03:05:50,928 INFO L796 eck$LassoCheckResult]: Loop: 1969#multENTRY ~n := #in~n;~m := #in~m; 1971#L16 assume !(~m < 0); 1973#L19 assume !(0 == ~m); 1970#L22 call #t~ret1 := mult(~n, ~m - 1);< 1969#multENTRY [2020-07-29 03:05:50,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:50,929 INFO L82 PathProgramCache]: Analyzing trace with hash 922353405, now seen corresponding path program 2 times [2020-07-29 03:05:50,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:50,929 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131033518] [2020-07-29 03:05:50,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:50,948 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:50,967 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:50,969 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:05:50,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:50,970 INFO L82 PathProgramCache]: Analyzing trace with hash 929639, now seen corresponding path program 1 times [2020-07-29 03:05:50,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:50,970 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872939863] [2020-07-29 03:05:50,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:50,975 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:50,980 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:50,981 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:05:50,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:50,982 INFO L82 PathProgramCache]: Analyzing trace with hash 465064035, now seen corresponding path program 1 times [2020-07-29 03:05:50,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:50,983 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475757091] [2020-07-29 03:05:50,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:50,992 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:50,998 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:51,001 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:05:51,084 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:05:51,084 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:05:51,084 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:05:51,085 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:05:51,085 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:05:51,085 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:51,085 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:05:51,085 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:05:51,085 INFO L133 ssoRankerPreferences]: Filename of dumped script: MultCommutative-2.c_Iteration4_Loop [2020-07-29 03:05:51,085 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:05:51,085 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:05:51,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:51,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:51,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:51,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:51,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:51,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:51,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:51,272 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:05:51,272 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:51,290 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:51,290 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:51,295 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:51,295 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret0=0} Honda state: {mult_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:51,327 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:51,327 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:51,330 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:51,330 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret1=0} Honda state: {mult_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:51,353 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:51,353 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:51,355 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:51,355 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#res=0} Honda state: {mult_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:51,379 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:51,379 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:51,382 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:51,382 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~n=0} Honda state: {mult_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:51,406 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:51,406 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:51,408 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:51,409 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#in~n=0} Honda state: {mult_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:51,432 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:51,432 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:51,458 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:05:51,458 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:51,528 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:05:51,529 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:05:51,529 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:05:51,529 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:05:51,529 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:05:51,530 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:05:51,530 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:51,530 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:05:51,530 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:05:51,530 INFO L133 ssoRankerPreferences]: Filename of dumped script: MultCommutative-2.c_Iteration4_Loop [2020-07-29 03:05:51,530 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:05:51,530 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:05:51,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:51,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:51,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:51,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:51,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:51,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:51,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:51,703 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:05:51,703 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:05:51,707 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:51,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:51,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:51,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:51,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:51,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:51,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:51,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:51,712 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:51,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:51,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:51,739 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:51,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:51,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:51,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:51,740 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:51,740 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:51,741 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:05:51,766 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:51,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:51,767 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:51,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:51,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:51,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:51,768 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:51,768 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:51,769 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:51,792 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:51,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:51,794 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:51,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:51,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:51,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:51,795 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:51,795 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:51,796 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:51,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:51,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:51,823 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:51,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:51,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:51,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:51,823 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:51,824 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:51,825 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:51,849 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:51,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:51,850 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:51,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:51,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:51,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:51,851 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:51,852 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:51,854 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:51,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:51,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:51,880 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:51,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:51,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:51,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:51,881 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:51,881 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:51,883 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:05:51,886 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 03:05:51,887 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:51,890 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:05:51,890 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:05:51,890 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:05:51,890 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_#in~m) = 1*mult_#in~m Supporting invariants [] [2020-07-29 03:05:51,912 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:05:51,914 INFO L393 LassoCheck]: Loop: "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume !(0 == ~m);" "call #t~ret1 := mult(~n, ~m - 1);"< [2020-07-29 03:05:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:51,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:51,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 03:05:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:51,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:51,986 INFO L280 TraceCheckUtils]: 0: Hoare triple {2079#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_~m~0, main_~n~0, main_~res1~0, main_~res2~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; {2079#unseeded} is VALID [2020-07-29 03:05:51,986 INFO L280 TraceCheckUtils]: 1: Hoare triple {2079#unseeded} assume !(main_~m~0 < 0 || main_~m~0 > 46340);main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; {2079#unseeded} is VALID [2020-07-29 03:05:51,988 INFO L280 TraceCheckUtils]: 2: Hoare triple {2079#unseeded} assume !(main_~n~0 < 0 || main_~n~0 > 46340); {2079#unseeded} is VALID [2020-07-29 03:05:51,989 INFO L263 TraceCheckUtils]: 3: Hoare triple {2079#unseeded} call main_#t~ret4 := mult(main_~m~0, main_~n~0); {2106#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:05:51,989 INFO L280 TraceCheckUtils]: 4: Hoare triple {2106#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n;~m := #in~m; {2106#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:05:51,991 INFO L280 TraceCheckUtils]: 5: Hoare triple {2106#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~m < 0); {2106#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:05:51,991 INFO L280 TraceCheckUtils]: 6: Hoare triple {2106#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 0 == ~m;#res := 0; {2106#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:05:51,992 INFO L280 TraceCheckUtils]: 7: Hoare triple {2106#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2106#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 03:05:51,993 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {2106#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2079#unseeded} #45#return; {2079#unseeded} is VALID [2020-07-29 03:05:51,994 INFO L280 TraceCheckUtils]: 9: Hoare triple {2079#unseeded} main_~res1~0 := main_#t~ret4;havoc main_#t~ret4; {2079#unseeded} is VALID [2020-07-29 03:05:51,994 INFO L263 TraceCheckUtils]: 10: Hoare triple {2079#unseeded} call main_#t~ret5 := mult(main_~n~0, main_~m~0); {2079#unseeded} is VALID [2020-07-29 03:05:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:52,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 03:05:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:52,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:52,082 INFO L280 TraceCheckUtils]: 0: Hoare triple {2082#(>= oldRank0 |mult_#in~m|)} ~n := #in~n;~m := #in~m; {2128#(<= mult_~m oldRank0)} is VALID [2020-07-29 03:05:52,083 INFO L280 TraceCheckUtils]: 1: Hoare triple {2128#(<= mult_~m oldRank0)} assume !(~m < 0); {2132#(and (<= mult_~m oldRank0) (<= 0 mult_~m))} is VALID [2020-07-29 03:05:52,083 INFO L280 TraceCheckUtils]: 2: Hoare triple {2132#(and (<= mult_~m oldRank0) (<= 0 mult_~m))} assume !(0 == ~m); {2136#(and (not (= 0 mult_~m)) (<= mult_~m oldRank0) (<= 0 mult_~m))} is VALID [2020-07-29 03:05:52,090 INFO L263 TraceCheckUtils]: 3: Hoare triple {2136#(and (not (= 0 mult_~m)) (<= mult_~m oldRank0) (<= 0 mult_~m))} call #t~ret1 := mult(~n, ~m - 1); {2092#(or (and (> oldRank0 |mult_#in~m|) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:05:52,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:05:52,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 03:05:52,111 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:05:52,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:52,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,112 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2020-07-29 03:05:52,112 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 35 transitions. cyclomatic complexity: 6 Second operand 6 states. [2020-07-29 03:05:52,290 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 35 transitions. cyclomatic complexity: 6. Second operand 6 states. Result 41 states and 45 transitions. Complement of second has 17 states. [2020-07-29 03:05:52,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 03:05:52,290 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:52,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. cyclomatic complexity: 6 [2020-07-29 03:05:52,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:52,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:52,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-29 03:05:52,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:05:52,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:52,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:52,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 45 transitions. [2020-07-29 03:05:52,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:05:52,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:52,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:52,293 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 35 transitions. cyclomatic complexity: 6 [2020-07-29 03:05:52,295 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 03:05:52,295 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states. [2020-07-29 03:05:52,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:05:52,296 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:05:52,296 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 45 transitions. cyclomatic complexity: 6 [2020-07-29 03:05:52,297 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 03:05:52,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 35 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:52,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:52,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 45 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:52,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 35 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 4 letters. [2020-07-29 03:05:52,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 03:05:52,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 45 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 4 letters. [2020-07-29 03:05:52,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 35 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:52,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:52,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 45 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:52,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 35 transitions. cyclomatic complexity: 6 Stem has 41 letters. Loop has 41 letters. [2020-07-29 03:05:52,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 41 letters. Loop has 41 letters. [2020-07-29 03:05:52,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 45 transitions. cyclomatic complexity: 6 Stem has 41 letters. Loop has 41 letters. [2020-07-29 03:05:52,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 35 transitions. cyclomatic complexity: 6 Stem has 31 letters. Loop has 31 letters. [2020-07-29 03:05:52,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 31 letters. Loop has 31 letters. [2020-07-29 03:05:52,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 45 transitions. cyclomatic complexity: 6 Stem has 31 letters. Loop has 31 letters. [2020-07-29 03:05:52,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 35 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:05:52,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:05:52,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 45 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:05:52,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 35 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:05:52,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:05:52,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 45 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:05:52,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 35 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:05:52,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:05:52,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 45 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:05:52,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 35 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:52,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:52,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 45 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:52,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 35 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:05:52,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:05:52,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 45 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:05:52,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 35 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:52,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:52,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 45 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:52,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 35 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:05:52,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:05:52,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 45 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:05:52,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 35 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:05:52,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:05:52,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 45 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:05:52,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 35 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:05:52,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:05:52,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 45 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:05:52,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 35 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 4 letters. [2020-07-29 03:05:52,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 03:05:52,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 45 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 4 letters. [2020-07-29 03:05:52,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 35 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:05:52,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:05:52,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 45 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:05:52,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 35 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:52,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:52,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 45 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:52,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 35 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:05:52,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:05:52,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 45 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:05:52,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 35 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:05:52,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:05:52,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 45 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:05:52,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,314 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:52,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 03:05:52,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2020-07-29 03:05:52,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:52,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:05:52,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 11 letters. Loop has 8 letters. [2020-07-29 03:05:52,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:52,316 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 45 transitions. cyclomatic complexity: 6 [2020-07-29 03:05:52,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:05:52,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 15 states and 15 transitions. [2020-07-29 03:05:52,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-07-29 03:05:52,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-07-29 03:05:52,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 15 transitions. [2020-07-29 03:05:52,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:05:52,319 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 15 transitions. [2020-07-29 03:05:52,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 15 transitions. [2020-07-29 03:05:52,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 8. [2020-07-29 03:05:52,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:05:52,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 15 transitions. Second operand 8 states. [2020-07-29 03:05:52,320 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 15 transitions. Second operand 8 states. [2020-07-29 03:05:52,320 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2020-07-29 03:05:52,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:05:52,321 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2020-07-29 03:05:52,321 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2020-07-29 03:05:52,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:52,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:52,321 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 15 states and 15 transitions. [2020-07-29 03:05:52,321 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 15 states and 15 transitions. [2020-07-29 03:05:52,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:05:52,322 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2020-07-29 03:05:52,322 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2020-07-29 03:05:52,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:52,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:52,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:05:52,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:05:52,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 03:05:52,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2020-07-29 03:05:52,323 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 8 transitions. [2020-07-29 03:05:52,323 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 8 transitions. [2020-07-29 03:05:52,323 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:05:52,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 8 transitions. [2020-07-29 03:05:52,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:05:52,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:52,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:52,324 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 03:05:52,324 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:05:52,325 INFO L794 eck$LassoCheckResult]: Stem: 2213#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_~m~0, main_~n~0, main_~res1~0, main_~res2~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; 2214#L27 assume !(main_~m~0 < 0 || main_~m~0 > 46340);main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 2207#L31 assume !(main_~n~0 < 0 || main_~n~0 > 46340); 2208#L34 call main_#t~ret4 := mult(main_~m~0, main_~n~0);< 2209#multENTRY [2020-07-29 03:05:52,325 INFO L796 eck$LassoCheckResult]: Loop: 2209#multENTRY ~n := #in~n;~m := #in~m; 2210#L16 assume !(~m < 0); 2212#L19 assume !(0 == ~m); 2211#L22 call #t~ret1 := mult(~n, ~m - 1);< 2209#multENTRY [2020-07-29 03:05:52,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:52,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1390425, now seen corresponding path program 2 times [2020-07-29 03:05:52,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:52,326 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043303074] [2020-07-29 03:05:52,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:52,329 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:52,331 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:52,333 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:05:52,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:52,333 INFO L82 PathProgramCache]: Analyzing trace with hash 929639, now seen corresponding path program 2 times [2020-07-29 03:05:52,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:52,334 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340481732] [2020-07-29 03:05:52,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:52,337 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:52,339 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:52,340 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:05:52,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:52,341 INFO L82 PathProgramCache]: Analyzing trace with hash -108528961, now seen corresponding path program 2 times [2020-07-29 03:05:52,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:52,341 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461935581] [2020-07-29 03:05:52,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:52,346 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:52,349 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:52,351 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:05:52,433 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:05:52,433 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:05:52,433 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:05:52,433 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:05:52,433 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:05:52,433 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:52,434 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:05:52,434 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:05:52,434 INFO L133 ssoRankerPreferences]: Filename of dumped script: MultCommutative-2.c_Iteration5_Loop [2020-07-29 03:05:52,434 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:05:52,434 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:05:52,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:52,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:52,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:52,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:52,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:52,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:52,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:52,587 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:05:52,588 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:52,591 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:52,591 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:52,594 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:52,594 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret0=0} Honda state: {mult_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:52,619 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:52,619 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:52,622 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:52,622 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~n=0} Honda state: {mult_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:52,647 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:52,647 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:52,650 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:52,650 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~m=0} Honda state: {mult_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:05:52,673 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:52,673 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:52,677 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:52,677 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret1=0} Honda state: {mult_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:52,699 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:52,699 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:52,702 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:52,702 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#res=0} Honda state: {mult_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:52,723 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:52,724 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:52,726 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:52,726 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#in~n=0} Honda state: {mult_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:52,750 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:52,750 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:52,775 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:05:52,775 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:52,834 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:05:52,835 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:05:52,836 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:05:52,836 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:05:52,836 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:05:52,836 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:05:52,836 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:52,836 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:05:52,836 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:05:52,836 INFO L133 ssoRankerPreferences]: Filename of dumped script: MultCommutative-2.c_Iteration5_Loop [2020-07-29 03:05:52,837 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:05:52,837 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:05:52,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:52,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:52,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:52,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:52,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:52,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:52,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:53,021 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:05:53,022 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:53,025 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:53,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:53,026 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:53,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:53,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:53,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:53,027 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:53,027 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:53,029 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:53,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:53,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:53,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:53,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:53,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:53,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:53,054 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:53,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:53,056 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:53,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:53,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:53,080 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:53,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:53,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:53,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:53,080 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:53,081 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:53,082 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:53,106 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:53,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:53,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:53,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:53,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:53,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:53,108 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:53,109 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:53,112 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:53,139 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:53,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:53,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:53,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:53,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:53,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:53,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:53,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:53,144 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:53,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:53,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:53,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:53,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:53,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:53,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:53,171 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:53,171 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:53,174 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:05:53,228 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:53,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:53,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:53,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts Waiting until toolchain timeout for monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:53,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:53,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:53,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:53,233 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:53,241 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:05:53,245 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 03:05:53,245 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:53,252 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:05:53,252 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:05:53,252 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:05:53,252 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_#in~m) = 1*mult_#in~m Supporting invariants [] [2020-07-29 03:05:53,299 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:05:53,302 INFO L393 LassoCheck]: Loop: "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume !(0 == ~m);" "call #t~ret1 := mult(~n, ~m - 1);"< [2020-07-29 03:05:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:53,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:53,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:05:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:53,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:53,335 INFO L280 TraceCheckUtils]: 0: Hoare triple {2254#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_~m~0, main_~n~0, main_~res1~0, main_~res2~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; {2254#unseeded} is VALID [2020-07-29 03:05:53,336 INFO L280 TraceCheckUtils]: 1: Hoare triple {2254#unseeded} assume !(main_~m~0 < 0 || main_~m~0 > 46340);main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; {2254#unseeded} is VALID [2020-07-29 03:05:53,337 INFO L280 TraceCheckUtils]: 2: Hoare triple {2254#unseeded} assume !(main_~n~0 < 0 || main_~n~0 > 46340); {2254#unseeded} is VALID [2020-07-29 03:05:53,338 INFO L263 TraceCheckUtils]: 3: Hoare triple {2254#unseeded} call main_#t~ret4 := mult(main_~m~0, main_~n~0); {2254#unseeded} is VALID [2020-07-29 03:05:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:53,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 03:05:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:53,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:53,447 INFO L280 TraceCheckUtils]: 0: Hoare triple {2257#(>= oldRank0 |mult_#in~m|)} ~n := #in~n;~m := #in~m; {2281#(<= mult_~m oldRank0)} is VALID [2020-07-29 03:05:53,448 INFO L280 TraceCheckUtils]: 1: Hoare triple {2281#(<= mult_~m oldRank0)} assume !(~m < 0); {2285#(and (<= mult_~m oldRank0) (<= 0 mult_~m))} is VALID [2020-07-29 03:05:53,449 INFO L280 TraceCheckUtils]: 2: Hoare triple {2285#(and (<= mult_~m oldRank0) (<= 0 mult_~m))} assume !(0 == ~m); {2289#(and (not (= 0 mult_~m)) (<= mult_~m oldRank0) (<= 0 mult_~m))} is VALID [2020-07-29 03:05:53,450 INFO L263 TraceCheckUtils]: 3: Hoare triple {2289#(and (not (= 0 mult_~m)) (<= mult_~m oldRank0) (<= 0 mult_~m))} call #t~ret1 := mult(~n, ~m - 1); {2267#(or (and (> oldRank0 |mult_#in~m|) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:05:53,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:05:53,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:05:53,466 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:05:53,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:05:53,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:53,467 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-07-29 03:05:53,467 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 8 transitions. cyclomatic complexity: 1 Second operand 5 states. [2020-07-29 03:05:53,584 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 8 transitions. cyclomatic complexity: 1. Second operand 5 states. Result 18 states and 18 transitions. Complement of second has 15 states. [2020-07-29 03:05:53,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 03:05:53,584 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:53,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 8 transitions. cyclomatic complexity: 1 [2020-07-29 03:05:53,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:53,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:53,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 03:05:53,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:05:53,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:53,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:53,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 18 transitions. [2020-07-29 03:05:53,587 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:05:53,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:05:53,587 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 8 transitions. cyclomatic complexity: 1 [2020-07-29 03:05:53,588 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 03:05:53,588 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 03:05:53,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:05:53,589 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:05:53,589 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 18 transitions. cyclomatic complexity: 1 [2020-07-29 03:05:53,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 18 transitions. cyclomatic complexity: 1 [2020-07-29 03:05:53,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:05:53,590 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:05:53,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 8 transitions. cyclomatic complexity: 1 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:05:53,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:53,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:05:53,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:53,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 18 transitions. cyclomatic complexity: 1 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:05:53,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:53,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 8 transitions. cyclomatic complexity: 1 Stem has 1 letters. Loop has 4 letters. [2020-07-29 03:05:53,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:53,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 03:05:53,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:53,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 18 transitions. cyclomatic complexity: 1 Stem has 1 letters. Loop has 4 letters. [2020-07-29 03:05:53,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:53,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 8 transitions. cyclomatic complexity: 1 Stem has 18 letters. Loop has 18 letters. [2020-07-29 03:05:53,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:53,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 03:05:53,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:53,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 18 transitions. cyclomatic complexity: 1 Stem has 18 letters. Loop has 18 letters. [2020-07-29 03:05:53,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:53,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 8 transitions. cyclomatic complexity: 1 Stem has 8 letters. Loop has 8 letters. [2020-07-29 03:05:53,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:53,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 03:05:53,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:53,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 18 transitions. cyclomatic complexity: 1 Stem has 8 letters. Loop has 8 letters. [2020-07-29 03:05:53,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:53,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 8 transitions. cyclomatic complexity: 1 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:05:53,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:53,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:05:53,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:53,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 18 transitions. cyclomatic complexity: 1 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:05:53,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:53,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 8 transitions. cyclomatic complexity: 1 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:05:53,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:53,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:05:53,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:53,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 18 transitions. cyclomatic complexity: 1 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:05:53,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:53,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 8 transitions. cyclomatic complexity: 1 Stem has 5 letters. Loop has 4 letters. [2020-07-29 03:05:53,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:53,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 03:05:53,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:53,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 18 transitions. cyclomatic complexity: 1 Stem has 5 letters. Loop has 4 letters. [2020-07-29 03:05:53,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:53,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 8 transitions. cyclomatic complexity: 1 Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:05:53,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:53,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:05:53,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:53,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 18 transitions. cyclomatic complexity: 1 Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:05:53,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:53,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 8 transitions. cyclomatic complexity: 1 Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:05:53,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:53,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:05:53,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:53,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 18 transitions. cyclomatic complexity: 1 Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:05:53,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:53,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 8 transitions. cyclomatic complexity: 1 Stem has 1 letters. Loop has 4 letters. [2020-07-29 03:05:53,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:53,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 03:05:53,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:53,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 18 transitions. cyclomatic complexity: 1 Stem has 1 letters. Loop has 4 letters. [2020-07-29 03:05:53,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:53,607 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:53,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 03:05:53,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2020-07-29 03:05:53,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:05:53,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:53,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:05:53,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:53,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 4 letters. Loop has 8 letters. [2020-07-29 03:05:53,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:53,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 18 transitions. cyclomatic complexity: 1 [2020-07-29 03:05:53,611 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:05:53,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2020-07-29 03:05:53,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:05:53,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:05:53,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:05:53,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:05:53,613 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:05:53,613 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:05:53,613 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:05:53,613 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 03:05:53,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:05:53,614 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:05:53,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:05:53,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:05:53 BoogieIcfgContainer [2020-07-29 03:05:53,624 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:05:53,625 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:05:53,625 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:05:53,625 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:05:53,626 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:05:44" (3/4) ... [2020-07-29 03:05:53,632 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:05:53,632 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:05:53,644 INFO L168 Benchmark]: Toolchain (without parser) took 9862.52 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 315.1 MB). Free memory was 961.6 MB in the beginning and 1.3 GB in the end (delta: -289.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2020-07-29 03:05:53,645 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:05:53,648 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.56 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:05:53,650 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -166.7 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2020-07-29 03:05:53,651 INFO L168 Benchmark]: Boogie Preprocessor took 24.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:05:53,652 INFO L168 Benchmark]: RCFGBuilder took 386.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2020-07-29 03:05:53,653 INFO L168 Benchmark]: BuchiAutomizer took 9034.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 194.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -160.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. [2020-07-29 03:05:53,653 INFO L168 Benchmark]: Witness Printer took 7.51 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:05:53,660 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 298.56 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 102.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -166.7 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 386.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9034.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 194.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -160.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. * Witness Printer took 7.51 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * \old(m) and consists of 4 locations. One deterministic module has affine ranking function -1 * \old(m) and consists of 5 locations. One deterministic module has affine ranking function -1 * \old(m) and consists of 5 locations. One deterministic module has affine ranking function \old(m) and consists of 6 locations. One deterministic module has affine ranking function \old(m) and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.9s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 5.8s. Construction of modules took 0.3s. Büchi inclusion checks took 2.2s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 3. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 53 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 41 states and ocurred in iteration 2. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 120 SDtfs, 129 SDslu, 102 SDs, 0 SdLazy, 165 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT3 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf103 lsp80 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq162 hnf94 smp84 dnf100 smp100 tf112 neg97 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 28 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...