./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/cstrncmp-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-alloca/cstrncmp-alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 68c0bffd453ebe82049c8a49e9fddf725cfb9d95 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 21:49:21,616 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:49:21,618 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:49:21,632 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:49:21,633 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:49:21,634 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:49:21,636 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:49:21,638 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:49:21,640 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:49:21,641 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:49:21,643 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:49:21,643 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:49:21,644 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:49:21,646 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:49:21,647 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:49:21,648 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:49:21,649 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:49:21,651 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:49:21,653 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:49:21,655 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:49:21,657 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:49:21,658 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:49:21,660 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:49:21,661 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:49:21,661 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:49:21,662 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:49:21,663 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:49:21,665 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:49:21,665 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:49:21,666 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:49:21,667 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:49:21,667 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:49:21,667 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:49:21,668 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:49:21,669 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:49:21,670 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:49:21,670 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:49:21,689 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:49:21,690 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:49:21,693 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:49:21,694 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:49:21,694 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:49:21,695 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:49:21,696 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:49:21,696 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:49:21,697 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:49:21,697 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:49:21,697 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:49:21,697 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:49:21,697 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:49:21,697 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:49:21,698 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:49:21,699 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:49:21,699 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:49:21,699 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:49:21,699 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:49:21,699 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:49:21,700 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:49:21,700 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:49:21,700 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:49:21,700 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:49:21,700 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:49:21,701 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:49:21,704 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:49:21,704 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:49:21,705 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:49:21,707 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 68c0bffd453ebe82049c8a49e9fddf725cfb9d95 [2019-01-01 21:49:21,784 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:49:21,800 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:49:21,808 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:49:21,809 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:49:21,810 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:49:21,812 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/cstrncmp-alloca_true-termination.c.i [2019-01-01 21:49:21,880 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10b3d8568/57646cdae9a5423eb11f6466cdfbf041/FLAG8ae8de1e1 [2019-01-01 21:49:22,488 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:49:22,489 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/cstrncmp-alloca_true-termination.c.i [2019-01-01 21:49:22,503 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10b3d8568/57646cdae9a5423eb11f6466cdfbf041/FLAG8ae8de1e1 [2019-01-01 21:49:22,740 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10b3d8568/57646cdae9a5423eb11f6466cdfbf041 [2019-01-01 21:49:22,744 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:49:22,746 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:49:22,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:49:22,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:49:22,754 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:49:22,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:49:22" (1/1) ... [2019-01-01 21:49:22,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@785fd580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:22, skipping insertion in model container [2019-01-01 21:49:22,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:49:22" (1/1) ... [2019-01-01 21:49:22,770 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:49:22,817 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:49:23,169 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:49:23,185 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:49:23,323 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:49:23,385 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:49:23,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:23 WrapperNode [2019-01-01 21:49:23,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:49:23,386 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:49:23,387 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:49:23,387 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:49:23,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:23" (1/1) ... [2019-01-01 21:49:23,412 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:23" (1/1) ... [2019-01-01 21:49:23,438 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:49:23,439 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:49:23,439 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:49:23,439 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:49:23,450 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:23" (1/1) ... [2019-01-01 21:49:23,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:23" (1/1) ... [2019-01-01 21:49:23,454 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:23" (1/1) ... [2019-01-01 21:49:23,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:23" (1/1) ... [2019-01-01 21:49:23,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:23" (1/1) ... [2019-01-01 21:49:23,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:23" (1/1) ... [2019-01-01 21:49:23,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:23" (1/1) ... [2019-01-01 21:49:23,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:49:23,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:49:23,472 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:49:23,472 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:49:23,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:23" (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 21:49:23,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:49:23,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:49:23,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:49:23,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:49:23,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:49:23,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:49:24,020 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:49:24,021 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-01 21:49:24,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:49:24 BoogieIcfgContainer [2019-01-01 21:49:24,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:49:24,023 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:49:24,023 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:49:24,028 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:49:24,029 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:49:24,030 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:49:22" (1/3) ... [2019-01-01 21:49:24,031 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6bf4f940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:49:24, skipping insertion in model container [2019-01-01 21:49:24,032 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:49:24,032 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:23" (2/3) ... [2019-01-01 21:49:24,032 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6bf4f940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:49:24, skipping insertion in model container [2019-01-01 21:49:24,032 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:49:24,033 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:49:24" (3/3) ... [2019-01-01 21:49:24,036 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncmp-alloca_true-termination.c.i [2019-01-01 21:49:24,094 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:49:24,095 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:49:24,095 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:49:24,095 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:49:24,096 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:49:24,096 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:49:24,096 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:49:24,096 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:49:24,096 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:49:24,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-01 21:49:24,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:49:24,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:49:24,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:49:24,145 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:49:24,146 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:49:24,146 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:49:24,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-01 21:49:24,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:49:24,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:49:24,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:49:24,149 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:49:24,150 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:49:24,159 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet17, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet13;havoc main_#t~nondet13;main_~length2~0 := main_#t~nondet14;havoc main_#t~nondet14; 8#L565true assume !(main_~length1~0 < 1); 13#L565-2true assume !(main_~length2~0 < 1); 7#L568-1true call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc16.base, main_#t~malloc16.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_#t~nondet17;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~short7, cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset, cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset, cstrncmp_#t~post2, cstrncmp_#t~mem3, cstrncmp_#t~mem4, cstrncmp_#t~short5, cstrncmp_#t~mem10, cstrncmp_#t~mem11, cstrncmp_#t~ite12, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n, cstrncmp_~uc1~0, cstrncmp_~uc2~0;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n;havoc cstrncmp_~uc1~0;havoc cstrncmp_~uc2~0; 17#L550true assume !(0 == cstrncmp_~n); 4#L552-5true [2019-01-01 21:49:24,160 INFO L796 eck$LassoCheckResult]: Loop: 4#L552-5true cstrncmp_#t~post2 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post2 - 1;cstrncmp_#t~short5 := cstrncmp_#t~post2 > 0; 14#L552-1true assume cstrncmp_#t~short5;call cstrncmp_#t~mem3 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);call cstrncmp_#t~mem4 := read~int(cstrncmp_~s2.base, cstrncmp_~s2.offset, 1);cstrncmp_#t~short5 := cstrncmp_#t~mem3 == cstrncmp_#t~mem4; 20#L552-3true assume !!cstrncmp_#t~short5;havoc cstrncmp_#t~post2;havoc cstrncmp_#t~mem4;havoc cstrncmp_#t~short5;havoc cstrncmp_#t~mem3;cstrncmp_#t~short7 := 0 == cstrncmp_~n; 11#L553true assume cstrncmp_#t~short7; 15#L553-2true assume !cstrncmp_#t~short7;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~short7;cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post8.base, 1 + cstrncmp_#t~post8.offset;havoc cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset;cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post9.base, 1 + cstrncmp_#t~post9.offset;havoc cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset; 4#L552-5true [2019-01-01 21:49:24,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:24,169 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 1 times [2019-01-01 21:49:24,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:24,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:24,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:24,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:24,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:24,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:24,367 INFO L82 PathProgramCache]: Analyzing trace with hash 52587176, now seen corresponding path program 1 times [2019-01-01 21:49:24,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:24,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:24,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:24,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:24,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:24,435 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 21:49:24,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:49:24,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:49:24,442 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:49:24,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:49:24,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:49:24,462 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2019-01-01 21:49:24,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:49:24,513 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2019-01-01 21:49:24,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:49:24,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2019-01-01 21:49:24,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:49:24,522 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 11 states and 14 transitions. [2019-01-01 21:49:24,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-01 21:49:24,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 21:49:24,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-01-01 21:49:24,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:49:24,526 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-01 21:49:24,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-01-01 21:49:24,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-01 21:49:24,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 21:49:24,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-01-01 21:49:24,553 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-01 21:49:24,553 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-01 21:49:24,553 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:49:24,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-01-01 21:49:24,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:49:24,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:49:24,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:49:24,555 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:49:24,555 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:49:24,555 INFO L794 eck$LassoCheckResult]: Stem: 52#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 46#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet17, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet13;havoc main_#t~nondet13;main_~length2~0 := main_#t~nondet14;havoc main_#t~nondet14; 47#L565 assume !(main_~length1~0 < 1); 53#L565-2 assume !(main_~length2~0 < 1); 54#L568-1 call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc16.base, main_#t~malloc16.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_#t~nondet17;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~short7, cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset, cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset, cstrncmp_#t~post2, cstrncmp_#t~mem3, cstrncmp_#t~mem4, cstrncmp_#t~short5, cstrncmp_#t~mem10, cstrncmp_#t~mem11, cstrncmp_#t~ite12, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n, cstrncmp_~uc1~0, cstrncmp_~uc2~0;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n;havoc cstrncmp_~uc1~0;havoc cstrncmp_~uc2~0; 56#L550 assume !(0 == cstrncmp_~n); 50#L552-5 [2019-01-01 21:49:24,556 INFO L796 eck$LassoCheckResult]: Loop: 50#L552-5 cstrncmp_#t~post2 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post2 - 1;cstrncmp_#t~short5 := cstrncmp_#t~post2 > 0; 51#L552-1 assume cstrncmp_#t~short5;call cstrncmp_#t~mem3 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);call cstrncmp_#t~mem4 := read~int(cstrncmp_~s2.base, cstrncmp_~s2.offset, 1);cstrncmp_#t~short5 := cstrncmp_#t~mem3 == cstrncmp_#t~mem4; 55#L552-3 assume !!cstrncmp_#t~short5;havoc cstrncmp_#t~post2;havoc cstrncmp_#t~mem4;havoc cstrncmp_#t~short5;havoc cstrncmp_#t~mem3;cstrncmp_#t~short7 := 0 == cstrncmp_~n; 48#L553 assume !cstrncmp_#t~short7;call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~short7 := 0 == cstrncmp_#t~mem6; 49#L553-2 assume !cstrncmp_#t~short7;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~short7;cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post8.base, 1 + cstrncmp_#t~post8.offset;havoc cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset;cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post9.base, 1 + cstrncmp_#t~post9.offset;havoc cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset; 50#L552-5 [2019-01-01 21:49:24,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:24,556 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 2 times [2019-01-01 21:49:24,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:24,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:24,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:24,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:24,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:24,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:24,602 INFO L82 PathProgramCache]: Analyzing trace with hash 52587238, now seen corresponding path program 1 times [2019-01-01 21:49:24,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:24,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:24,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:24,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:49:24,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:24,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:24,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:24,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:24,629 INFO L82 PathProgramCache]: Analyzing trace with hash -2120298631, now seen corresponding path program 1 times [2019-01-01 21:49:24,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:24,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:24,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:24,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:24,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:25,516 WARN L181 SmtUtils]: Spent 763.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-01-01 21:49:25,729 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-01 21:49:26,452 WARN L181 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 90 [2019-01-01 21:49:26,659 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-01-01 21:49:26,678 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:49:26,680 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:49:26,680 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:49:26,680 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:49:26,680 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:49:26,681 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:49:26,681 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:49:26,681 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:49:26,681 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncmp-alloca_true-termination.c.i_Iteration2_Lasso [2019-01-01 21:49:26,681 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:49:26,682 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:49:26,712 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 21:49:26,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 21:49:26,749 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 21:49:26,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:26,757 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 21:49:26,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 21:49:26,774 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 21:49:26,784 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 21:49:26,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 21:49:26,809 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 21:49:26,813 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 21:49:26,818 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 21:49:26,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 21:49:26,840 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 21:49:26,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 21:49:26,855 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 21:49:26,872 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 21:49:26,875 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 21:49:26,878 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 21:49:26,881 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 21:49:26,884 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 21:49:26,888 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 21:49:26,890 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 21:49:27,270 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-01-01 21:49:27,563 WARN L181 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-01-01 21:49:27,563 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 21:49:27,566 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 21:49:27,570 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 21:49:27,594 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 21:49:28,612 WARN L181 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-01-01 21:49:28,778 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:49:28,784 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:49:28,786 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 21:49:28,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:28,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:28,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:28,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:28,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:28,792 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:28,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:28,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:28,795 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 21:49:28,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:28,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:28,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:28,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:28,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:28,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:28,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:28,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:28,800 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 21:49:28,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:28,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:28,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:28,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:28,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:28,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:28,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:28,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:28,806 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 21:49:28,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:28,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:28,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:28,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:28,811 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:28,811 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:28,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:28,815 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 21:49:28,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:28,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:28,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:28,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:28,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:28,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:28,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:28,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:28,820 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 21:49:28,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:28,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:28,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:28,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:28,825 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:28,825 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:28,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:28,833 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 21:49:28,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:28,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:28,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:28,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:28,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:28,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:28,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:28,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:28,840 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 21:49:28,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:28,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:28,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:28,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:28,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:28,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:28,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:28,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:28,845 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 21:49:28,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:28,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:28,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:28,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:28,849 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:28,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:28,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:28,853 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 21:49:28,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:28,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:28,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:28,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:28,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:28,854 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:28,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:28,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:28,858 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 21:49:28,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:28,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:28,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:28,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:28,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:28,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:28,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:28,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:28,863 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 21:49:28,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:28,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:28,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:28,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:28,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:28,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:28,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:28,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:28,869 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 21:49:28,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:28,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:28,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:28,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:28,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:28,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:28,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:28,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:28,874 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 21:49:28,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:28,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:28,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:28,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:28,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:28,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:28,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:28,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:28,880 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 21:49:28,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:28,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:28,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:28,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:28,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:28,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:28,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:28,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:28,885 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 21:49:28,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:28,888 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:49:28,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:28,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:28,892 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 21:49:28,892 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:28,922 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:49:28,943 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:49:28,943 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-01 21:49:28,945 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:49:28,948 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:49:28,948 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:49:28,949 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncmp_~n) = 1*ULTIMATE.start_cstrncmp_~n Supporting invariants [] [2019-01-01 21:49:29,211 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2019-01-01 21:49:29,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:29,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:29,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:29,452 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 21:49:29,455 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 21:49:29,456 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 4 states. [2019-01-01 21:49:29,543 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 21 states and 26 transitions. Complement of second has 6 states. [2019-01-01 21:49:29,547 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 21:49:29,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:49:29,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-01-01 21:49:29,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 6 letters. Loop has 5 letters. [2019-01-01 21:49:29,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:29,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 5 letters. [2019-01-01 21:49:29,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:29,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 6 letters. Loop has 10 letters. [2019-01-01 21:49:29,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:29,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2019-01-01 21:49:29,555 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:49:29,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2019-01-01 21:49:29,555 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:49:29,555 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:49:29,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:49:29,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:49:29,558 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:49:29,558 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:49:29,558 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:49:29,558 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:49:29,558 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:49:29,558 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:49:29,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:49:29,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:49:29 BoogieIcfgContainer [2019-01-01 21:49:29,567 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:49:29,568 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:49:29,568 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:49:29,568 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:49:29,570 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:49:24" (3/4) ... [2019-01-01 21:49:29,573 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:49:29,573 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:49:29,574 INFO L168 Benchmark]: Toolchain (without parser) took 6830.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.2 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -88.1 MB). Peak memory consumption was 122.2 MB. Max. memory is 11.5 GB. [2019-01-01 21:49:29,576 INFO L168 Benchmark]: CDTParser took 0.41 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 21:49:29,577 INFO L168 Benchmark]: CACSL2BoogieTranslator took 635.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -173.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:49:29,578 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:49:29,578 INFO L168 Benchmark]: Boogie Preprocessor took 32.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:49:29,580 INFO L168 Benchmark]: RCFGBuilder took 550.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-01-01 21:49:29,581 INFO L168 Benchmark]: BuchiAutomizer took 5544.33 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.4 MB). Peak memory consumption was 122.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:49:29,582 INFO L168 Benchmark]: Witness Printer took 5.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:49:29,588 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.41 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 635.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -173.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 550.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5544.33 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.4 MB). Peak memory consumption was 122.8 MB. Max. memory is 11.5 GB. * Witness Printer took 5.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function n and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 4.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 34 SDtfs, 12 SDslu, 23 SDs, 0 SdLazy, 15 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital236 mio100 ax107 hnf99 lsp81 ukn85 mio100 lsp42 div100 bol100 ite100 ukn100 eq192 hnf88 smp100 dnf187 smp97 tf100 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 63ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...