./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/recursive/MultCommutative_true-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/svcomp/c/recursive/MultCommutative_true-unreach-call_true-no-overflow_true-termination.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.24-2e94e6a [2019-01-01 23:53:52,415 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:53:52,417 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:53:52,430 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:53:52,430 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:53:52,431 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:53:52,432 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:53:52,436 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:53:52,438 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:53:52,439 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:53:52,440 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:53:52,440 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:53:52,442 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:53:52,443 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:53:52,444 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:53:52,445 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:53:52,446 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:53:52,448 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:53:52,450 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:53:52,452 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:53:52,453 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:53:52,454 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:53:52,457 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:53:52,457 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:53:52,457 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:53:52,458 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:53:52,460 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:53:52,460 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:53:52,461 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:53:52,463 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:53:52,463 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:53:52,464 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:53:52,464 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:53:52,464 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:53:52,465 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:53:52,466 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:53:52,467 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:53:52,485 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:53:52,486 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:53:52,489 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:53:52,489 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:53:52,490 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:53:52,490 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:53:52,490 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:53:52,490 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:53:52,490 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:53:52,491 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:53:52,491 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:53:52,491 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:53:52,491 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:53:52,491 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:53:52,491 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:53:52,492 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:53:52,492 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:53:52,492 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:53:52,492 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:53:52,492 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:53:52,493 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:53:52,496 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:53:52,496 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:53:52,496 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:53:52,496 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:53:52,497 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:53:52,497 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:53:52,497 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:53:52,497 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:53:52,497 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:53:52,498 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:53:52,501 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:53:52,501 INFO L133 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 [2019-01-01 23:53:52,559 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:53:52,574 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:53:52,582 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:53:52,584 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:53:52,585 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:53:52,586 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive/MultCommutative_true-unreach-call_true-no-overflow_true-termination.c [2019-01-01 23:53:52,661 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/167b3bd3d/3fbaf5103b944a05991deeaf33085281/FLAG494a74431 [2019-01-01 23:53:53,153 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:53:53,154 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive/MultCommutative_true-unreach-call_true-no-overflow_true-termination.c [2019-01-01 23:53:53,160 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/167b3bd3d/3fbaf5103b944a05991deeaf33085281/FLAG494a74431 [2019-01-01 23:53:53,518 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/167b3bd3d/3fbaf5103b944a05991deeaf33085281 [2019-01-01 23:53:53,522 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:53:53,524 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:53:53,526 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:53:53,526 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:53:53,530 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:53:53,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:53:53" (1/1) ... [2019-01-01 23:53:53,535 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@762fb217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:53, skipping insertion in model container [2019-01-01 23:53:53,535 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:53:53" (1/1) ... [2019-01-01 23:53:53,544 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:53:53,562 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:53:53,771 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:53:53,776 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:53:53,796 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:53:53,812 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:53:53,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:53 WrapperNode [2019-01-01 23:53:53,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:53:53,814 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:53:53,814 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:53:53,814 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:53:53,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:53" (1/1) ... [2019-01-01 23:53:53,830 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:53" (1/1) ... [2019-01-01 23:53:53,852 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:53:53,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:53:53,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:53:53,852 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:53:53,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:53" (1/1) ... [2019-01-01 23:53:53,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:53" (1/1) ... [2019-01-01 23:53:53,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:53" (1/1) ... [2019-01-01 23:53:53,865 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:53" (1/1) ... [2019-01-01 23:53:53,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:53" (1/1) ... [2019-01-01 23:53:53,869 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:53" (1/1) ... [2019-01-01 23:53:53,870 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:53" (1/1) ... [2019-01-01 23:53:53,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:53:53,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:53:53,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:53:53,876 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:53:53,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:53" (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 [2019-01-01 23:53:54,016 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2019-01-01 23:53:54,016 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2019-01-01 23:53:54,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:53:54,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:53:54,328 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:53:54,328 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-01 23:53:54,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:53:54 BoogieIcfgContainer [2019-01-01 23:53:54,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:53:54,329 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:53:54,330 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:53:54,333 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:53:54,334 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:53:54,334 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:53:53" (1/3) ... [2019-01-01 23:53:54,335 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b42ae99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:53:54, skipping insertion in model container [2019-01-01 23:53:54,335 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:53:54,336 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:53" (2/3) ... [2019-01-01 23:53:54,336 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b42ae99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:53:54, skipping insertion in model container [2019-01-01 23:53:54,336 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:53:54,336 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:53:54" (3/3) ... [2019-01-01 23:53:54,338 INFO L375 chiAutomizerObserver]: Analyzing ICFG MultCommutative_true-unreach-call_true-no-overflow_true-termination.c [2019-01-01 23:53:54,411 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:53:54,412 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:53:54,413 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:53:54,413 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:53:54,413 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:53:54,413 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:53:54,413 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:53:54,414 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:53:54,414 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:53:54,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-01-01 23:53:54,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 23:53:54,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:54,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:54,471 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 23:53:54,472 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 23:53:54,472 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:53:54,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-01-01 23:53:54,475 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 23:53:54,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:54,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:54,476 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 23:53:54,477 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 23:53:54,485 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 [2019-01-01 23:53:54,486 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 [2019-01-01 23:53:54,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:54,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1390425, now seen corresponding path program 1 times [2019-01-01 23:53:54,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:54,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:54,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:54,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:54,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:54,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:54,602 INFO L82 PathProgramCache]: Analyzing trace with hash 29924, now seen corresponding path program 1 times [2019-01-01 23:53:54,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:54,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:54,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:54,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:54,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:54,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:54,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1527521652, now seen corresponding path program 1 times [2019-01-01 23:53:54,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:54,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:54,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:54,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:54,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:54,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:53:54,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:53:54,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:53:55,077 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:55,078 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:55,078 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:55,078 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:55,079 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:53:55,079 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:55,079 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:55,079 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:55,079 INFO L131 ssoRankerPreferences]: Filename of dumped script: MultCommutative_true-unreach-call_true-no-overflow_true-termination.c_Iteration1_Loop [2019-01-01 23:53:55,079 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:55,080 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:55,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:55,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:55,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:55,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:55,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:55,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:55,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:55,468 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:55,468 INFO L412 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 [2019-01-01 23:53:55,477 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:55,477 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:55,488 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:55,488 INFO L448 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 [2019-01-01 23:53:55,519 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:55,519 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:55,522 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:55,523 INFO L448 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 [2019-01-01 23:53:55,543 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:55,543 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:55,548 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:55,548 INFO L448 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 [2019-01-01 23:53:55,568 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:55,568 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:55,573 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:55,573 INFO L448 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 [2019-01-01 23:53:55,599 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:55,599 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:55,603 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:55,603 INFO L448 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 [2019-01-01 23:53:55,626 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:55,626 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:55,646 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:55,647 INFO L448 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) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:55,673 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:55,673 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2019-01-01 23:53:55,698 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:53:55,698 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:55,726 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:53:55,728 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:55,729 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:55,729 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:55,729 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:55,729 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:53:55,729 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:55,729 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:55,730 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:55,730 INFO L131 ssoRankerPreferences]: Filename of dumped script: MultCommutative_true-unreach-call_true-no-overflow_true-termination.c_Iteration1_Loop [2019-01-01 23:53:55,730 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:55,730 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:55,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:55,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:55,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:55,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:55,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:55,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:55,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:56,015 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:56,021 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:53:56,023 INFO L122 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 [2019-01-01 23:53:56,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:56,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:56,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:56,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:56,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:56,029 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:56,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:56,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:56,032 INFO L122 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 [2019-01-01 23:53:56,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:56,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:56,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:56,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:56,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:56,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:56,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:56,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:56,038 INFO L122 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 [2019-01-01 23:53:56,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:56,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:56,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:56,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:56,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:56,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:56,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:56,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:56,044 INFO L122 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 [2019-01-01 23:53:56,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:56,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:56,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:56,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:56,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:56,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:56,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:56,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:56,051 INFO L122 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 [2019-01-01 23:53:56,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:56,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:56,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:56,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:56,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:56,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:56,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:56,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:56,057 INFO L122 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 [2019-01-01 23:53:56,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:56,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:56,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:56,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:56,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:56,060 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:56,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:56,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:56,063 INFO L122 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 [2019-01-01 23:53:56,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:56,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:56,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:56,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:56,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:56,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:56,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:56,085 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:53:56,092 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-01-01 23:53:56,093 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 23:53:56,095 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:53:56,095 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:53:56,096 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:53:56,096 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_#in~m) = -1*mult_#in~m Supporting invariants [] [2019-01-01 23:53:56,098 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:53:56,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:56,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:56,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:56,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:53:56,541 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 [2019-01-01 23:53:56,543 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 4 states. [2019-01-01 23:53:56,946 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 4 states. Result 50 states and 65 transitions. Complement of second has 12 states. [2019-01-01 23:53:56,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 23:53:56,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:53:56,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-01-01 23:53:56,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-01 23:53:56,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:56,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-01 23:53:56,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:56,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 6 letters. [2019-01-01 23:53:56,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:56,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 65 transitions. [2019-01-01 23:53:56,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 23:53:56,977 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 31 states and 44 transitions. [2019-01-01 23:53:56,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-01-01 23:53:56,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-01 23:53:56,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 44 transitions. [2019-01-01 23:53:56,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:53:56,981 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2019-01-01 23:53:57,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 44 transitions. [2019-01-01 23:53:57,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2019-01-01 23:53:57,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-01 23:53:57,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2019-01-01 23:53:57,032 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-01-01 23:53:57,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:53:57,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:53:57,038 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand 5 states. [2019-01-01 23:53:57,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:53:57,223 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2019-01-01 23:53:57,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:53:57,225 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2019-01-01 23:53:57,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 23:53:57,231 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 26 states and 33 transitions. [2019-01-01 23:53:57,231 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-01-01 23:53:57,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-01 23:53:57,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2019-01-01 23:53:57,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:53:57,232 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-01-01 23:53:57,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2019-01-01 23:53:57,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2019-01-01 23:53:57,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-01 23:53:57,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-01-01 23:53:57,238 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-01-01 23:53:57,238 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-01-01 23:53:57,238 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:53:57,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2019-01-01 23:53:57,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 23:53:57,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:57,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:57,240 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:53:57,240 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 23:53:57,241 INFO L794 eck$LassoCheckResult]: Stem: 199#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; 197#L27 assume !(main_~m~0 < 0 || main_~m~0 > 46340);main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 198#L31 assume !(main_~n~0 < 0 || main_~n~0 > 46340); 192#L34 call main_#t~ret4 := mult(main_~m~0, main_~n~0);< 191#multENTRY ~n := #in~n;~m := #in~m; 193#L16 assume !(~m < 0); 194#L19 assume !(0 == ~m); 187#L22 call #t~ret1 := mult(~n, ~m - 1);< 190#multENTRY [2019-01-01 23:53:57,241 INFO L796 eck$LassoCheckResult]: Loop: 190#multENTRY ~n := #in~n;~m := #in~m; 205#L16 assume ~m < 0; 186#L17 call #t~ret0 := mult(~n, -~m);< 190#multENTRY [2019-01-01 23:53:57,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:57,241 INFO L82 PathProgramCache]: Analyzing trace with hash -108528961, now seen corresponding path program 1 times [2019-01-01 23:53:57,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:57,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:57,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:57,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:57,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:57,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:57,263 INFO L82 PathProgramCache]: Analyzing trace with hash 29924, now seen corresponding path program 2 times [2019-01-01 23:53:57,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:57,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:57,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:57,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:57,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:57,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:57,273 INFO L82 PathProgramCache]: Analyzing trace with hash 924096870, now seen corresponding path program 1 times [2019-01-01 23:53:57,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:57,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:57,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:57,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:53:57,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:57,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:53:57,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:53:57,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:53:57,453 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:57,453 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:57,453 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:57,454 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:57,454 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:53:57,454 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:57,454 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:57,454 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:57,454 INFO L131 ssoRankerPreferences]: Filename of dumped script: MultCommutative_true-unreach-call_true-no-overflow_true-termination.c_Iteration2_Loop [2019-01-01 23:53:57,454 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:57,455 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:57,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:57,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:57,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:57,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:57,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:57,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:57,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:57,548 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:57,549 INFO L412 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:57,554 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:57,554 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:57,569 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:57,569 INFO L448 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 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:57,598 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:57,598 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:57,600 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:57,601 INFO L448 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 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:57,622 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:57,622 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:57,625 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:57,625 INFO L448 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 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:57,647 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:57,647 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:57,652 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:57,652 INFO L448 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 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:57,673 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:57,673 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:57,677 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:57,678 INFO L448 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 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 [2019-01-01 23:53:57,698 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:57,699 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:57,703 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:57,703 INFO L448 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 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:57,726 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:57,726 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:57,749 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:53:57,749 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:57,775 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:53:57,777 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:57,777 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:57,777 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:57,777 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:57,777 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:53:57,778 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:57,778 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:57,778 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:57,778 INFO L131 ssoRankerPreferences]: Filename of dumped script: MultCommutative_true-unreach-call_true-no-overflow_true-termination.c_Iteration2_Loop [2019-01-01 23:53:57,778 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:57,778 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:57,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:57,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:57,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:57,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:57,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:57,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:57,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:57,914 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:57,914 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:53:57,915 INFO L122 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 [2019-01-01 23:53:57,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:57,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:57,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:57,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:57,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:57,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:57,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:57,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:57,920 INFO L122 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 [2019-01-01 23:53:57,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:57,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:57,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:57,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:57,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:57,921 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:57,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:57,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:57,923 INFO L122 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 [2019-01-01 23:53:57,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:57,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:57,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:57,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:57,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:57,925 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:57,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:57,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:57,927 INFO L122 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 [2019-01-01 23:53:57,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:57,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:57,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:57,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:57,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:57,928 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:57,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:57,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:57,930 INFO L122 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 [2019-01-01 23:53:57,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:57,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:57,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:57,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:57,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:57,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:57,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:57,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:57,934 INFO L122 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 [2019-01-01 23:53:57,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:57,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:57,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:57,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:57,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:57,936 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:57,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:57,941 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:53:57,943 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-01-01 23:53:57,944 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 23:53:57,944 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:53:57,944 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:53:57,944 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:53:57,945 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_#in~m) = -1*mult_#in~m Supporting invariants [] [2019-01-01 23:53:57,945 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:53:58,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:58,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:58,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:58,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:53:58,171 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 [2019-01-01 23:53:58,171 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-01-01 23:53:58,329 INFO L76 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. [2019-01-01 23:53:58,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 23:53:58,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:53:58,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2019-01-01 23:53:58,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-01 23:53:58,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:58,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 11 letters. Loop has 3 letters. [2019-01-01 23:53:58,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:58,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 8 letters. Loop has 6 letters. [2019-01-01 23:53:58,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:58,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 91 transitions. [2019-01-01 23:53:58,338 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 23:53:58,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 50 states and 65 transitions. [2019-01-01 23:53:58,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2019-01-01 23:53:58,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2019-01-01 23:53:58,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 65 transitions. [2019-01-01 23:53:58,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:53:58,342 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 65 transitions. [2019-01-01 23:53:58,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 65 transitions. [2019-01-01 23:53:58,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2019-01-01 23:53:58,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-01 23:53:58,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2019-01-01 23:53:58,350 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2019-01-01 23:53:58,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:53:58,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:53:58,351 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand 5 states. [2019-01-01 23:53:58,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:53:58,439 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2019-01-01 23:53:58,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 23:53:58,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 59 transitions. [2019-01-01 23:53:58,442 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-01 23:53:58,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 41 states and 47 transitions. [2019-01-01 23:53:58,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2019-01-01 23:53:58,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2019-01-01 23:53:58,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2019-01-01 23:53:58,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:53:58,446 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-01-01 23:53:58,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2019-01-01 23:53:58,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-01 23:53:58,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-01 23:53:58,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-01-01 23:53:58,454 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-01-01 23:53:58,454 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-01-01 23:53:58,454 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:53:58,454 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 47 transitions. [2019-01-01 23:53:58,455 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-01 23:53:58,455 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:58,455 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:58,457 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:53:58,457 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 23:53:58,457 INFO L794 eck$LassoCheckResult]: Stem: 461#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; 458#L27 assume !(main_~m~0 < 0 || main_~m~0 > 46340);main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 459#L31 assume !(main_~n~0 < 0 || main_~n~0 > 46340); 460#L34 call main_#t~ret4 := mult(main_~m~0, main_~n~0);< 467#multENTRY ~n := #in~n;~m := #in~m; 479#L16 assume !(~m < 0); 476#L19 assume 0 == ~m;#res := 0; 475#multFINAL assume true; 469#multEXIT >#45#return; 466#L34-1 main_~res1~0 := main_#t~ret4;havoc main_#t~ret4; 451#L35 call main_#t~ret5 := mult(main_~n~0, main_~m~0);< 452#multENTRY [2019-01-01 23:53:58,457 INFO L796 eck$LassoCheckResult]: Loop: 452#multENTRY ~n := #in~n;~m := #in~m; 474#L16 assume ~m < 0; 450#L17 call #t~ret0 := mult(~n, -~m);< 452#multENTRY [2019-01-01 23:53:58,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:58,458 INFO L82 PathProgramCache]: Analyzing trace with hash 922353405, now seen corresponding path program 1 times [2019-01-01 23:53:58,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:58,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:58,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:58,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:58,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:58,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:58,488 INFO L82 PathProgramCache]: Analyzing trace with hash 29924, now seen corresponding path program 3 times [2019-01-01 23:53:58,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:58,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:58,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:58,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:58,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:58,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:58,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:58,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1370471320, now seen corresponding path program 1 times [2019-01-01 23:53:58,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:58,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:58,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:58,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:53:58,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:58,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:53:58,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:53:58,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:53:58,598 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:58,598 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:58,598 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:58,598 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:58,599 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:53:58,599 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:58,599 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:58,599 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:58,599 INFO L131 ssoRankerPreferences]: Filename of dumped script: MultCommutative_true-unreach-call_true-no-overflow_true-termination.c_Iteration3_Loop [2019-01-01 23:53:58,599 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:58,599 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:58,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:58,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:58,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:58,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:58,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:58,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:58,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:58,713 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:58,713 INFO L412 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) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:58,716 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:58,717 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:58,719 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:58,719 INFO L448 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 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 [2019-01-01 23:53:58,740 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:58,740 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:58,742 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:58,743 INFO L448 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 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 [2019-01-01 23:53:58,763 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:58,763 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:58,765 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:58,766 INFO L448 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 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 [2019-01-01 23:53:58,788 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:58,789 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:58,791 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:58,792 INFO L448 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 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 [2019-01-01 23:53:58,838 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:58,839 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2019-01-01 23:53:58,862 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:53:58,862 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:58,894 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:53:58,896 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:58,896 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:58,896 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:58,896 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:58,896 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:53:58,896 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:58,896 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:58,897 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:58,897 INFO L131 ssoRankerPreferences]: Filename of dumped script: MultCommutative_true-unreach-call_true-no-overflow_true-termination.c_Iteration3_Loop [2019-01-01 23:53:58,897 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:58,897 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:58,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:58,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:58,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:58,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:58,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:58,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:58,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:58,975 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:58,975 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:53:58,976 INFO L122 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 [2019-01-01 23:53:58,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:58,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:58,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:58,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:58,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:58,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:58,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:58,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:58,982 INFO L122 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 [2019-01-01 23:53:58,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:58,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:58,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:58,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:58,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:58,984 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:58,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:58,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:58,988 INFO L122 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 [2019-01-01 23:53:58,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:58,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:58,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:58,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:58,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:58,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:58,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:58,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:58,995 INFO L122 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 [2019-01-01 23:53:58,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:58,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:58,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:58,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:58,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:58,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:58,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:58,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:59,001 INFO L122 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 [2019-01-01 23:53:59,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:59,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:59,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:59,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:59,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:59,005 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:59,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:59,009 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:53:59,011 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-01-01 23:53:59,011 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 23:53:59,011 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:53:59,011 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:53:59,013 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:53:59,013 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_#in~m) = -1*mult_#in~m Supporting invariants [] [2019-01-01 23:53:59,013 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:53:59,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:59,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:59,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:59,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:53:59,212 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 [2019-01-01 23:53:59,212 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 47 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-01-01 23:53:59,303 INFO L76 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. [2019-01-01 23:53:59,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 23:53:59,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 23:53:59,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-01-01 23:53:59,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 11 letters. Loop has 3 letters. [2019-01-01 23:53:59,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:59,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-01 23:53:59,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:59,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 11 letters. Loop has 6 letters. [2019-01-01 23:53:59,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:59,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 90 transitions. [2019-01-01 23:53:59,309 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 23:53:59,311 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 62 states and 70 transitions. [2019-01-01 23:53:59,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2019-01-01 23:53:59,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2019-01-01 23:53:59,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 70 transitions. [2019-01-01 23:53:59,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:53:59,312 INFO L705 BuchiCegarLoop]: Abstraction has 62 states and 70 transitions. [2019-01-01 23:53:59,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 70 transitions. [2019-01-01 23:53:59,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 35. [2019-01-01 23:53:59,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-01 23:53:59,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2019-01-01 23:53:59,318 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2019-01-01 23:53:59,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:53:59,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:53:59,319 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 5 states. [2019-01-01 23:53:59,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:53:59,356 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-01-01 23:53:59,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:53:59,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 40 transitions. [2019-01-01 23:53:59,358 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 23:53:59,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 35 states and 39 transitions. [2019-01-01 23:53:59,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2019-01-01 23:53:59,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2019-01-01 23:53:59,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 39 transitions. [2019-01-01 23:53:59,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:53:59,361 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-01-01 23:53:59,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 39 transitions. [2019-01-01 23:53:59,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-01-01 23:53:59,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-01 23:53:59,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-01-01 23:53:59,366 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-01-01 23:53:59,367 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-01-01 23:53:59,367 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 23:53:59,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2019-01-01 23:53:59,370 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 23:53:59,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:59,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:59,370 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:53:59,370 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 23:53:59,372 INFO L794 eck$LassoCheckResult]: Stem: 736#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; 733#L27 assume !(main_~m~0 < 0 || main_~m~0 > 46340);main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 734#L31 assume !(main_~n~0 < 0 || main_~n~0 > 46340); 735#L34 call main_#t~ret4 := mult(main_~m~0, main_~n~0);< 742#multENTRY ~n := #in~n;~m := #in~m; 749#L16 assume !(~m < 0); 747#L19 assume 0 == ~m;#res := 0; 746#multFINAL assume true; 745#multEXIT >#45#return; 741#L34-1 main_~res1~0 := main_#t~ret4;havoc main_#t~ret4; 729#L35 call main_#t~ret5 := mult(main_~n~0, main_~m~0);< 728#multENTRY [2019-01-01 23:53:59,372 INFO L796 eck$LassoCheckResult]: Loop: 728#multENTRY ~n := #in~n;~m := #in~m; 730#L16 assume !(~m < 0); 732#L19 assume !(0 == ~m); 731#L22 call #t~ret1 := mult(~n, ~m - 1);< 728#multENTRY [2019-01-01 23:53:59,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:59,372 INFO L82 PathProgramCache]: Analyzing trace with hash 922353405, now seen corresponding path program 2 times [2019-01-01 23:53:59,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:59,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:59,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:59,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:59,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:59,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:59,386 INFO L82 PathProgramCache]: Analyzing trace with hash 929639, now seen corresponding path program 1 times [2019-01-01 23:53:59,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:59,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:59,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:59,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:53:59,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:59,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:59,393 INFO L82 PathProgramCache]: Analyzing trace with hash 465064035, now seen corresponding path program 1 times [2019-01-01 23:53:59,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:59,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:59,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:59,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:59,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:59,485 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:59,485 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:59,485 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:59,485 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:59,485 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:53:59,486 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:59,486 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:59,486 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:59,486 INFO L131 ssoRankerPreferences]: Filename of dumped script: MultCommutative_true-unreach-call_true-no-overflow_true-termination.c_Iteration4_Loop [2019-01-01 23:53:59,486 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:59,486 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:59,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:59,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:59,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:59,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:59,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:59,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:59,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:59,566 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:59,566 INFO L412 LassoAnalysis]: Checking for nontermination... 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 [2019-01-01 23:53:59,575 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:59,575 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:59,578 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:59,578 INFO L448 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 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:59,598 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:59,598 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:59,603 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:59,603 INFO L448 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 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 [2019-01-01 23:53:59,623 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:59,623 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:59,627 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:59,627 INFO L448 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 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 [2019-01-01 23:53:59,648 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:59,649 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2019-01-01 23:53:59,673 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:53:59,673 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:59,696 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:53:59,697 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:59,697 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:59,697 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:59,697 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:59,698 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:53:59,698 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:59,698 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:59,698 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:59,698 INFO L131 ssoRankerPreferences]: Filename of dumped script: MultCommutative_true-unreach-call_true-no-overflow_true-termination.c_Iteration4_Loop [2019-01-01 23:53:59,698 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:59,698 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:59,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:59,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:59,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:59,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:59,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:59,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:59,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:59,866 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:59,867 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:53:59,867 INFO L122 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 [2019-01-01 23:53:59,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:59,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:59,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:59,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:59,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:59,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:59,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:59,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:59,873 INFO L122 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 [2019-01-01 23:53:59,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:59,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:59,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:59,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:59,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:59,875 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:59,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:59,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:59,876 INFO L122 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 [2019-01-01 23:53:59,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:59,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:59,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:59,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:59,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:59,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:59,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:59,880 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:53:59,883 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:53:59,883 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:53:59,883 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:53:59,883 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:53:59,884 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:53:59,884 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_#in~m) = 1*mult_#in~m Supporting invariants [] [2019-01-01 23:53:59,884 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:53:59,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:59,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:59,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:59,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:59,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:53:59,991 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 [2019-01-01 23:53:59,992 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 35 transitions. cyclomatic complexity: 6 Second operand 5 states. [2019-01-01 23:54:00,063 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 35 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 41 states and 45 transitions. Complement of second has 13 states. [2019-01-01 23:54:00,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:00,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 23:54:00,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-01-01 23:54:00,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 11 letters. Loop has 4 letters. [2019-01-01 23:54:00,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:00,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 15 letters. Loop has 4 letters. [2019-01-01 23:54:00,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:00,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 11 letters. Loop has 8 letters. [2019-01-01 23:54:00,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:00,067 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 45 transitions. [2019-01-01 23:54:00,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 23:54:00,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 15 states and 15 transitions. [2019-01-01 23:54:00,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-01 23:54:00,070 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-01 23:54:00,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 15 transitions. [2019-01-01 23:54:00,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:54:00,071 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-01-01 23:54:00,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 15 transitions. [2019-01-01 23:54:00,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 8. [2019-01-01 23:54:00,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-01 23:54:00,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-01 23:54:00,074 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-01 23:54:00,074 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-01 23:54:00,074 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 23:54:00,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 8 transitions. [2019-01-01 23:54:00,075 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 23:54:00,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:54:00,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:54:00,075 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 23:54:00,075 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 23:54:00,075 INFO L794 eck$LassoCheckResult]: Stem: 887#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; 888#L27 assume !(main_~m~0 < 0 || main_~m~0 > 46340);main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 881#L31 assume !(main_~n~0 < 0 || main_~n~0 > 46340); 882#L34 call main_#t~ret4 := mult(main_~m~0, main_~n~0);< 883#multENTRY [2019-01-01 23:54:00,076 INFO L796 eck$LassoCheckResult]: Loop: 883#multENTRY ~n := #in~n;~m := #in~m; 885#L16 assume !(~m < 0); 886#L19 assume !(0 == ~m); 884#L22 call #t~ret1 := mult(~n, ~m - 1);< 883#multENTRY [2019-01-01 23:54:00,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:00,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1390425, now seen corresponding path program 2 times [2019-01-01 23:54:00,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:00,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:00,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:00,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:00,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:00,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:00,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:00,087 INFO L82 PathProgramCache]: Analyzing trace with hash 929639, now seen corresponding path program 2 times [2019-01-01 23:54:00,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:00,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:00,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:00,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:54:00,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:00,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:00,095 INFO L82 PathProgramCache]: Analyzing trace with hash -108528961, now seen corresponding path program 2 times [2019-01-01 23:54:00,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:00,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:00,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:00,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:54:00,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:00,171 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:00,171 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:00,171 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:00,171 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:00,171 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:54:00,172 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:00,172 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:00,172 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:00,172 INFO L131 ssoRankerPreferences]: Filename of dumped script: MultCommutative_true-unreach-call_true-no-overflow_true-termination.c_Iteration5_Loop [2019-01-01 23:54:00,172 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:00,172 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:00,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:00,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:00,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:00,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:00,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:00,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:00,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:00,264 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:00,264 INFO L412 LassoAnalysis]: Checking for nontermination... 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 [2019-01-01 23:54:00,268 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:00,268 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:00,270 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:00,270 INFO L448 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 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 [2019-01-01 23:54:00,291 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:00,291 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:00,293 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:00,294 INFO L448 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:54:00,328 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:00,328 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:00,335 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:00,335 INFO L448 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 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 [2019-01-01 23:54:00,355 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:00,355 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:00,358 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:00,358 INFO L448 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 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 [2019-01-01 23:54:00,379 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:00,379 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:00,383 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:00,383 INFO L448 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 [2019-01-01 23:54:00,405 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:00,405 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2019-01-01 23:54:00,427 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:54:00,427 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:00,448 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:54:00,449 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:00,450 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:00,450 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:00,450 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:00,450 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:54:00,450 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:00,450 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:00,450 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:00,450 INFO L131 ssoRankerPreferences]: Filename of dumped script: MultCommutative_true-unreach-call_true-no-overflow_true-termination.c_Iteration5_Loop [2019-01-01 23:54:00,450 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:00,451 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:00,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:00,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:00,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:00,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:00,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:00,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:00,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:00,584 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:00,585 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:54:00,585 INFO L122 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 [2019-01-01 23:54:00,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:00,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:00,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:00,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:00,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:00,587 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:00,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:00,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:00,589 INFO L122 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 [2019-01-01 23:54:00,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:00,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:00,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:00,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:00,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:00,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:00,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:00,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:00,592 INFO L122 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 [2019-01-01 23:54:00,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:00,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:00,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:00,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:00,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:00,593 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:00,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:00,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:00,604 INFO L122 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 [2019-01-01 23:54:00,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:00,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:00,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:00,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:00,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:00,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:00,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:00,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:00,609 INFO L122 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 [2019-01-01 23:54:00,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:00,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:00,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:00,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:00,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:00,611 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:00,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:00,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:00,617 INFO L122 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 [2019-01-01 23:54:00,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:00,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:00,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:00,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:00,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:00,619 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:00,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:00,625 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:54:00,627 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:54:00,627 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:54:00,632 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:54:00,632 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:54:00,633 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:54:00,633 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_#in~m) = 1*mult_#in~m Supporting invariants [] [2019-01-01 23:54:00,633 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:54:00,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:00,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:00,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:00,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:54:00,753 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 [2019-01-01 23:54:00,754 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 8 transitions. cyclomatic complexity: 1 Second operand 4 states. [2019-01-01 23:54:00,801 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 8 transitions. cyclomatic complexity: 1. Second operand 4 states. Result 18 states and 18 transitions. Complement of second has 11 states. [2019-01-01 23:54:00,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:00,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:54:00,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-01-01 23:54:00,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-01 23:54:00,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:00,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 8 letters. Loop has 4 letters. [2019-01-01 23:54:00,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:00,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 8 letters. [2019-01-01 23:54:00,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:00,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 18 transitions. [2019-01-01 23:54:00,804 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:54:00,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2019-01-01 23:54:00,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:54:00,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:54:00,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:54:00,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:54:00,805 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:54:00,805 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:54:00,805 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:54:00,805 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 23:54:00,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 23:54:00,805 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:54:00,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 23:54:00,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:54:00 BoogieIcfgContainer [2019-01-01 23:54:00,813 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:54:00,813 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:54:00,813 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:54:00,814 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:54:00,814 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:53:54" (3/4) ... [2019-01-01 23:54:00,817 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 23:54:00,817 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:54:00,818 INFO L168 Benchmark]: Toolchain (without parser) took 7295.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.8 MB). Free memory was 952.7 MB in the beginning and 923.7 MB in the end (delta: 29.0 MB). Peak memory consumption was 208.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:54:00,820 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:54:00,820 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.91 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:54:00,821 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.87 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:54:00,823 INFO L168 Benchmark]: Boogie Preprocessor took 22.81 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:54:00,823 INFO L168 Benchmark]: RCFGBuilder took 453.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -130.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:54:00,824 INFO L168 Benchmark]: BuchiAutomizer took 6483.57 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 1.1 GB in the beginning and 923.7 MB in the end (delta: 148.5 MB). Peak memory consumption was 230.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:54:00,825 INFO L168 Benchmark]: Witness Printer took 4.11 ms. Allocated memory is still 1.2 GB. Free memory is still 923.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:54:00,831 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 287.91 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 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 37.87 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.81 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 453.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -130.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6483.57 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 1.1 GB in the beginning and 923.7 MB in the end (delta: 148.5 MB). Peak memory consumption was 230.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.11 ms. Allocated memory is still 1.2 GB. Free memory is still 923.7 MB. 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 5 locations. One deterministic module has affine ranking function \old(m) and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.4s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 4.0s. Construction of modules took 0.6s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 3. Automata minimization 0.0s 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, 138 SDslu, 102 SDs, 0 SdLazy, 159 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT3 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital14 mio100 ax100 hnf100 lsp79 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq164 hnf94 smp87 dnf100 smp100 tf112 neg97 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 24 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...