./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-libowfat/strcat_short_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-libowfat/strcat_short_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 2cfe214f4978682dac68f5565e20ebc7c152d196 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:41:02,805 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:41:02,806 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:41:02,819 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:41:02,820 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:41:02,821 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:41:02,822 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:41:02,824 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:41:02,826 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:41:02,827 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:41:02,828 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:41:02,828 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:41:02,829 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:41:02,830 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:41:02,832 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:41:02,833 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:41:02,834 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:41:02,836 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:41:02,838 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:41:02,840 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:41:02,841 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:41:02,843 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:41:02,845 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:41:02,846 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:41:02,846 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:41:02,847 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:41:02,848 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:41:02,849 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:41:02,850 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:41:02,851 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:41:02,852 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:41:02,852 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:41:02,853 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:41:02,853 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:41:02,854 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:41:02,855 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:41:02,855 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:41:02,872 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:41:02,872 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:41:02,873 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:41:02,873 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:41:02,874 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:41:02,874 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:41:02,874 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:41:02,874 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:41:02,874 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:41:02,875 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:41:02,875 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:41:02,875 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:41:02,875 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:41:02,875 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:41:02,875 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:41:02,876 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:41:02,876 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:41:02,876 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:41:02,876 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:41:02,876 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:41:02,876 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:41:02,877 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:41:02,877 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:41:02,877 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:41:02,877 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:41:02,877 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:41:02,878 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:41:02,878 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:41:02,879 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:41:02,879 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 -> 2cfe214f4978682dac68f5565e20ebc7c152d196 [2019-01-01 21:41:02,914 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:41:02,934 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:41:02,941 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:41:02,942 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:41:02,944 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:41:02,944 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-libowfat/strcat_short_true-termination.c.i [2019-01-01 21:41:03,009 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2a0586a3/ec6f31179b074f83a40b611fb9514de1/FLAGee05d1b1b [2019-01-01 21:41:03,511 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:41:03,512 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-libowfat/strcat_short_true-termination.c.i [2019-01-01 21:41:03,529 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2a0586a3/ec6f31179b074f83a40b611fb9514de1/FLAGee05d1b1b [2019-01-01 21:41:03,828 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2a0586a3/ec6f31179b074f83a40b611fb9514de1 [2019-01-01 21:41:03,831 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:41:03,833 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:41:03,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:41:03,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:41:03,838 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:41:03,839 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:41:03" (1/1) ... [2019-01-01 21:41:03,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@588abb48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:03, skipping insertion in model container [2019-01-01 21:41:03,842 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:41:03" (1/1) ... [2019-01-01 21:41:03,851 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:41:03,906 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:41:04,302 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:41:04,313 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:41:04,456 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:41:04,517 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:41:04,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:04 WrapperNode [2019-01-01 21:41:04,518 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:41:04,518 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:41:04,519 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:41:04,519 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:41:04,529 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:41:04" (1/1) ... [2019-01-01 21:41:04,557 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:41:04" (1/1) ... [2019-01-01 21:41:04,598 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:41:04,599 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:41:04,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:41:04,599 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:41:04,612 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:04" (1/1) ... [2019-01-01 21:41:04,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:04" (1/1) ... [2019-01-01 21:41:04,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:04" (1/1) ... [2019-01-01 21:41:04,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:04" (1/1) ... [2019-01-01 21:41:04,637 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:04" (1/1) ... [2019-01-01 21:41:04,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:04" (1/1) ... [2019-01-01 21:41:04,650 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:04" (1/1) ... [2019-01-01 21:41:04,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:41:04,661 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:41:04,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:41:04,662 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:41:04,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:04" (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:41:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:41:04,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:41:04,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:41:04,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:41:04,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:41:04,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:41:05,174 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:41:05,175 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2019-01-01 21:41:05,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:41:05 BoogieIcfgContainer [2019-01-01 21:41:05,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:41:05,177 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:41:05,177 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:41:05,181 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:41:05,182 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:41:05,182 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:41:03" (1/3) ... [2019-01-01 21:41:05,183 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39d6066d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:41:05, skipping insertion in model container [2019-01-01 21:41:05,183 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:41:05,183 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:04" (2/3) ... [2019-01-01 21:41:05,184 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39d6066d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:41:05, skipping insertion in model container [2019-01-01 21:41:05,184 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:41:05,184 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:41:05" (3/3) ... [2019-01-01 21:41:05,186 INFO L375 chiAutomizerObserver]: Analyzing ICFG strcat_short_true-termination.c.i [2019-01-01 21:41:05,251 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:41:05,253 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:41:05,253 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:41:05,253 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:41:05,253 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:41:05,253 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:41:05,254 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:41:05,254 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:41:05,254 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:41:05,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-01 21:41:05,304 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-01 21:41:05,304 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:41:05,304 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:41:05,315 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:41:05,315 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:41:05,315 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:41:05,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-01 21:41:05,318 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-01 21:41:05,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:41:05,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:41:05,319 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:41:05,319 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:41:05,330 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out_end~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 7#L523true assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 20#L527true assume !(main_~out_len~0 < 1);main_~out_end~0 := main_#t~nondet12;havoc main_#t~nondet12; 16#L529true assume !(main_~out_len~0 < main_~out_end~0 + main_~in_len~0);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + main_~out_end~0, 1);strcat_#in~s.base, strcat_#in~s.offset, strcat_#in~t.base, strcat_#in~t.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcat_#res.base, strcat_#res.offset;havoc strcat_#t~ret5, strcat_#t~mem6, strcat_#t~pre7.base, strcat_#t~pre7.offset, strcat_#t~pre8.base, strcat_#t~pre8.offset, strcat_~s.base, strcat_~s.offset, strcat_~t.base, strcat_~t.offset, strcat_~dest~0.base, strcat_~dest~0.offset;strcat_~s.base, strcat_~s.offset := strcat_#in~s.base, strcat_#in~s.offset;strcat_~t.base, strcat_~t.offset := strcat_#in~t.base, strcat_#in~t.offset;strcat_~dest~0.base, strcat_~dest~0.offset := strcat_~s.base, strcat_~s.offset;strlen_#in~s.base, strlen_#in~s.offset := strcat_~s.base, strcat_~s.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 14#L508true assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 3#L509-4true [2019-01-01 21:41:05,331 INFO L796 eck$LassoCheckResult]: Loop: 3#L509-4true call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 15#L509-1true assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 19#L509-3true strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 3#L509-4true [2019-01-01 21:41:05,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:05,340 INFO L82 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2019-01-01 21:41:05,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:05,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:05,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:05,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:41:05,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:05,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:05,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:05,586 INFO L82 PathProgramCache]: Analyzing trace with hash 55771, now seen corresponding path program 1 times [2019-01-01 21:41:05,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:05,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:05,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:05,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:41:05,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:05,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:05,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1271629391, now seen corresponding path program 1 times [2019-01-01 21:41:05,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:05,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:05,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:05,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:41:05,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:05,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:05,919 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-01 21:41:07,077 WARN L181 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 126 DAG size of output: 108 [2019-01-01 21:41:07,280 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-01 21:41:07,294 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:41:07,295 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:41:07,296 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:41:07,296 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:41:07,296 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:41:07,296 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:41:07,297 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:41:07,297 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:41:07,297 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcat_short_true-termination.c.i_Iteration1_Lasso [2019-01-01 21:41:07,297 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:41:07,298 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:41:07,330 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:41:07,366 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:41:07,374 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:41:07,377 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:41:07,380 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:41:07,389 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:41:07,400 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:41:07,861 WARN L181 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-01-01 21:41:07,962 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:41:07,967 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:41:07,975 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:41:07,976 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:41:07,980 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:41:07,982 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:41:07,984 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:41:07,987 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:41:07,991 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:41:07,993 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:41:07,995 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:41:07,998 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:41:08,001 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:41:08,004 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:41:08,005 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:41:08,007 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:41:08,241 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-01 21:41:08,462 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-01-01 21:41:09,133 WARN L181 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-01-01 21:41:09,347 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:41:09,354 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:41:09,357 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:41:09,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:09,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:09,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:09,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:09,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:09,366 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:09,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:09,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:09,372 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:41:09,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:09,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:09,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:09,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:09,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:09,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:09,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:09,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:09,382 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:41:09,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:09,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:09,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:09,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:09,389 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:09,390 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:09,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:09,400 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:41:09,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:09,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:09,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:09,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:09,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:09,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:09,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:09,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:09,408 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:41:09,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:09,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:09,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:09,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:09,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:09,410 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:09,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:09,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:09,412 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:41:09,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:09,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:09,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:09,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:09,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:09,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:09,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:09,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:09,416 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:41:09,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:09,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:09,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:09,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:09,419 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:09,419 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:09,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:09,423 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:41:09,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:09,427 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 21:41:09,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:09,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:09,454 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 21:41:09,457 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:09,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:09,599 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:41:09,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:09,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:09,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:09,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:09,603 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:09,604 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:09,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:09,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 21:41:09,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:09,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:09,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:09,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:09,612 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:09,615 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:09,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:09,620 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:41:09,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:09,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:09,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:09,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:09,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:09,625 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:09,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:09,631 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:41:09,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:09,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:09,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:09,633 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:41:09,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:09,636 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:41:09,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:09,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:09,647 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:41:09,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:09,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:09,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:09,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:09,657 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:09,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:09,712 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:41:09,757 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 21:41:09,757 INFO L444 ModelExtractionUtils]: 49 out of 55 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-01 21:41:09,761 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:41:09,762 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:41:09,762 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:41:09,763 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlen_~s.offset, v_rep(select #length ULTIMATE.start_strlen_~s.base)_1) = -1*ULTIMATE.start_strlen_~s.offset + 1*v_rep(select #length ULTIMATE.start_strlen_~s.base)_1 Supporting invariants [] [2019-01-01 21:41:09,855 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-01-01 21:41:09,863 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:41:10,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:41:10,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:41:10,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:41:10,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:41:10,202 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:41:10,217 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:41:10,218 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2019-01-01 21:41:10,288 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 48 states and 63 transitions. Complement of second has 5 states. [2019-01-01 21:41:10,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:41:10,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:41:10,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2019-01-01 21:41:10,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-01 21:41:10,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:41:10,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-01 21:41:10,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:41:10,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 6 letters. Loop has 6 letters. [2019-01-01 21:41:10,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:41:10,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 63 transitions. [2019-01-01 21:41:10,299 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 21:41:10,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 18 states and 21 transitions. [2019-01-01 21:41:10,304 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-01 21:41:10,305 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-01 21:41:10,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-01-01 21:41:10,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:41:10,306 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-01-01 21:41:10,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-01-01 21:41:10,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2019-01-01 21:41:10,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-01 21:41:10,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-01-01 21:41:10,340 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-01-01 21:41:10,340 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-01-01 21:41:10,340 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:41:10,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2019-01-01 21:41:10,343 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:41:10,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:41:10,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:41:10,346 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:41:10,346 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:41:10,346 INFO L794 eck$LassoCheckResult]: Stem: 164#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 163#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out_end~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 161#L523 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 162#L527 assume !(main_~out_len~0 < 1);main_~out_end~0 := main_#t~nondet12;havoc main_#t~nondet12; 167#L529 assume !(main_~out_len~0 < main_~out_end~0 + main_~in_len~0);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + main_~out_end~0, 1);strcat_#in~s.base, strcat_#in~s.offset, strcat_#in~t.base, strcat_#in~t.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcat_#res.base, strcat_#res.offset;havoc strcat_#t~ret5, strcat_#t~mem6, strcat_#t~pre7.base, strcat_#t~pre7.offset, strcat_#t~pre8.base, strcat_#t~pre8.offset, strcat_~s.base, strcat_~s.offset, strcat_~t.base, strcat_~t.offset, strcat_~dest~0.base, strcat_~dest~0.offset;strcat_~s.base, strcat_~s.offset := strcat_#in~s.base, strcat_#in~s.offset;strcat_~t.base, strcat_~t.offset := strcat_#in~t.base, strcat_#in~t.offset;strcat_~dest~0.base, strcat_~dest~0.offset := strcat_~s.base, strcat_~s.offset;strlen_#in~s.base, strlen_#in~s.offset := strcat_~s.base, strcat_~s.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 165#L508 assume strlen_~s.base == 0 && strlen_~s.offset == 0;strlen_#res := 0; 158#L510 strcat_#t~ret5 := strlen_#res;strcat_~s.base, strcat_~s.offset := strcat_~s.base, strcat_~s.offset + strcat_#t~ret5 % 4294967296;havoc strcat_#t~ret5; 159#L516-2 [2019-01-01 21:41:10,351 INFO L796 eck$LassoCheckResult]: Loop: 159#L516-2 assume !false;call strcat_#t~mem6 := read~int(strcat_~t.base, strcat_~t.offset, 1);call write~int(strcat_#t~mem6, strcat_~s.base, strcat_~s.offset, 1); 160#L517 assume !(0 == strcat_#t~mem6);havoc strcat_#t~mem6;strcat_#t~pre7.base, strcat_#t~pre7.offset := strcat_~s.base, 1 + strcat_~s.offset;strcat_~s.base, strcat_~s.offset := strcat_~s.base, 1 + strcat_~s.offset;havoc strcat_#t~pre7.base, strcat_#t~pre7.offset;strcat_#t~pre8.base, strcat_#t~pre8.offset := strcat_~t.base, 1 + strcat_~t.offset;strcat_~t.base, strcat_~t.offset := strcat_~t.base, 1 + strcat_~t.offset;havoc strcat_#t~pre8.base, strcat_#t~pre8.offset; 159#L516-2 [2019-01-01 21:41:10,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:10,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907772, now seen corresponding path program 1 times [2019-01-01 21:41:10,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:10,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:10,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:10,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:41:10,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:41:10,524 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:41:10,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:41:10,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 21:41:10,528 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:41:10,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:10,528 INFO L82 PathProgramCache]: Analyzing trace with hash 2470, now seen corresponding path program 1 times [2019-01-01 21:41:10,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:10,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:10,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:10,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:41:10,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:10,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:10,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 21:41:10,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 21:41:10,711 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-01-01 21:41:10,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:41:10,756 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-01-01 21:41:10,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 21:41:10,758 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2019-01-01 21:41:10,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:41:10,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 17 transitions. [2019-01-01 21:41:10,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-01 21:41:10,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-01-01 21:41:10,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2019-01-01 21:41:10,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:41:10,762 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-01-01 21:41:10,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2019-01-01 21:41:10,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-01 21:41:10,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-01 21:41:10,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-01-01 21:41:10,764 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-01-01 21:41:10,764 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-01-01 21:41:10,765 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:41:10,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2019-01-01 21:41:10,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:41:10,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:41:10,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:41:10,769 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:41:10,769 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:41:10,770 INFO L794 eck$LassoCheckResult]: Stem: 203#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 202#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out_end~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 200#L523 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 201#L527 assume !(main_~out_len~0 < 1);main_~out_end~0 := main_#t~nondet12;havoc main_#t~nondet12; 206#L529 assume !(main_~out_len~0 < main_~out_end~0 + main_~in_len~0);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + main_~out_end~0, 1);strcat_#in~s.base, strcat_#in~s.offset, strcat_#in~t.base, strcat_#in~t.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcat_#res.base, strcat_#res.offset;havoc strcat_#t~ret5, strcat_#t~mem6, strcat_#t~pre7.base, strcat_#t~pre7.offset, strcat_#t~pre8.base, strcat_#t~pre8.offset, strcat_~s.base, strcat_~s.offset, strcat_~t.base, strcat_~t.offset, strcat_~dest~0.base, strcat_~dest~0.offset;strcat_~s.base, strcat_~s.offset := strcat_#in~s.base, strcat_#in~s.offset;strcat_~t.base, strcat_~t.offset := strcat_#in~t.base, strcat_#in~t.offset;strcat_~dest~0.base, strcat_~dest~0.offset := strcat_~s.base, strcat_~s.offset;strlen_#in~s.base, strlen_#in~s.offset := strcat_~s.base, strcat_~s.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 204#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 192#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 194#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 196#L509-5 strlen_#res := strlen_~i~0; 197#L510 strcat_#t~ret5 := strlen_#res;strcat_~s.base, strcat_~s.offset := strcat_~s.base, strcat_~s.offset + strcat_#t~ret5 % 4294967296;havoc strcat_#t~ret5; 198#L516-2 [2019-01-01 21:41:10,772 INFO L796 eck$LassoCheckResult]: Loop: 198#L516-2 assume !false;call strcat_#t~mem6 := read~int(strcat_~t.base, strcat_~t.offset, 1);call write~int(strcat_#t~mem6, strcat_~s.base, strcat_~s.offset, 1); 199#L517 assume !(0 == strcat_#t~mem6);havoc strcat_#t~mem6;strcat_#t~pre7.base, strcat_#t~pre7.offset := strcat_~s.base, 1 + strcat_~s.offset;strcat_~s.base, strcat_~s.offset := strcat_~s.base, 1 + strcat_~s.offset;havoc strcat_#t~pre7.base, strcat_#t~pre7.offset;strcat_#t~pre8.base, strcat_#t~pre8.offset := strcat_~t.base, 1 + strcat_~t.offset;strcat_~t.base, strcat_~t.offset := strcat_~t.base, 1 + strcat_~t.offset;havoc strcat_#t~pre8.base, strcat_#t~pre8.offset; 198#L516-2 [2019-01-01 21:41:10,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:10,773 INFO L82 PathProgramCache]: Analyzing trace with hash 765803698, now seen corresponding path program 1 times [2019-01-01 21:41:10,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:10,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:10,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:10,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:41:10,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:10,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:10,808 INFO L82 PathProgramCache]: Analyzing trace with hash 2470, now seen corresponding path program 2 times [2019-01-01 21:41:10,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:10,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:10,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:10,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:41:10,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:10,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:10,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1497947671, now seen corresponding path program 1 times [2019-01-01 21:41:10,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:10,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:10,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:10,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:41:10,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:11,218 WARN L181 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-01 21:41:11,533 WARN L181 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-01 21:41:12,151 WARN L181 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 122 [2019-01-01 21:41:12,301 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-01-01 21:41:12,304 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:41:12,304 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:41:12,304 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:41:12,305 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:41:12,305 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:41:12,305 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:41:12,305 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:41:12,305 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:41:12,305 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcat_short_true-termination.c.i_Iteration3_Lasso [2019-01-01 21:41:12,305 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:41:12,305 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:41:12,311 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:41:12,350 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:41:12,351 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:41:12,355 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:41:12,357 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:41:12,359 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:41:12,362 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:41:12,364 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:41:12,367 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:41:12,369 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:41:12,373 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:41:12,374 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:41:12,376 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:41:12,377 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:41:12,379 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:41:12,381 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:41:12,383 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:41:12,385 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:41:12,387 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:41:12,391 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:41:13,048 WARN L181 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2019-01-01 21:41:13,239 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-01-01 21:41:13,240 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:41:13,670 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-01 21:41:14,549 WARN L181 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-01-01 21:41:14,672 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:41:14,673 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:41:14,673 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:41:14,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:14,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:14,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:14,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:14,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:14,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:14,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:14,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:14,679 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:41:14,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:14,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:14,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:14,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:14,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:14,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:14,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:14,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:14,681 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:41:14,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:14,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:14,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:14,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:14,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:14,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:14,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:14,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:14,687 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:41:14,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:14,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:14,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:14,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:14,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:14,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:14,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:14,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:14,692 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:41:14,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:14,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:14,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:14,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:14,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:14,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:14,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:14,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:14,698 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:41:14,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:14,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:14,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:14,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:14,702 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:14,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:14,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:14,705 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:41:14,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:14,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:14,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:14,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:14,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:14,708 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:14,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:14,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:14,709 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:41:14,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:14,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:14,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:14,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:14,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:14,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:14,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:14,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:14,716 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:41:14,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:14,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:14,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:14,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:14,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:14,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:14,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:14,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:14,718 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:41:14,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:14,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:14,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:14,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:14,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:14,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:14,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:14,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:14,726 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:41:14,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:14,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:14,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:14,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:14,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:14,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:14,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:14,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:14,731 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:41:14,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:14,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:14,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:14,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:14,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:14,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:14,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:14,737 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:41:14,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:14,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:14,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:14,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:14,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:14,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:14,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:14,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:14,742 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:41:14,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:14,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:14,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:14,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:14,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:14,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:14,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:14,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:14,748 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:41:14,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:14,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:14,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:14,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:14,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:14,749 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:14,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:14,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:14,753 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:41:14,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:14,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:14,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:14,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:14,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:14,754 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:14,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:14,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:14,755 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:41:14,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:14,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:14,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:14,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:14,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:14,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:14,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:14,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:14,762 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:41:14,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:14,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:14,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:14,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:14,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:14,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:14,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:14,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:14,764 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:41:14,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:14,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:14,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:14,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:14,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:14,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:14,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:14,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:14,773 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:41:14,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:14,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:14,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:14,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:14,777 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:14,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:14,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:14,783 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:41:14,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:14,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:14,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:14,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:14,785 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:14,785 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:14,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:14,793 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:41:14,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:14,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:14,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:14,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:14,800 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:14,800 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:14,868 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:41:14,945 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:41:14,945 INFO L444 ModelExtractionUtils]: 50 out of 55 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 21:41:14,945 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:41:14,947 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:41:14,947 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:41:14,948 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strcat_~t.base)_1, ULTIMATE.start_strcat_~t.offset) = 1*v_rep(select #length ULTIMATE.start_strcat_~t.base)_1 - 1*ULTIMATE.start_strcat_~t.offset Supporting invariants [] [2019-01-01 21:41:15,192 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2019-01-01 21:41:15,205 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:41:15,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:41:15,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:41:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:41:15,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:41:15,386 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:41:15,386 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:41:15,386 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-01 21:41:15,438 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 17 states and 20 transitions. Complement of second has 4 states. [2019-01-01 21:41:15,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:41:15,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:41:15,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-01-01 21:41:15,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2019-01-01 21:41:15,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:41:15,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2019-01-01 21:41:15,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:41:15,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2019-01-01 21:41:15,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:41:15,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2019-01-01 21:41:15,444 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:41:15,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 0 states and 0 transitions. [2019-01-01 21:41:15,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:41:15,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:41:15,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:41:15,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:41:15,445 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:41:15,445 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:41:15,445 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:41:15,445 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:41:15,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:41:15,445 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:41:15,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:41:15,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:41:15 BoogieIcfgContainer [2019-01-01 21:41:15,456 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:41:15,456 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:41:15,457 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:41:15,457 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:41:15,457 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:41:05" (3/4) ... [2019-01-01 21:41:15,463 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:41:15,463 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:41:15,464 INFO L168 Benchmark]: Toolchain (without parser) took 11632.25 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 311.4 MB). Free memory was 950.0 MB in the beginning and 1.0 GB in the end (delta: -99.0 MB). Peak memory consumption was 212.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:41:15,465 INFO L168 Benchmark]: CDTParser took 0.16 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:41:15,467 INFO L168 Benchmark]: CACSL2BoogieTranslator took 683.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -158.9 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. [2019-01-01 21:41:15,468 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.29 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:41:15,469 INFO L168 Benchmark]: Boogie Preprocessor took 62.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:41:15,470 INFO L168 Benchmark]: RCFGBuilder took 514.62 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: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-01-01 21:41:15,471 INFO L168 Benchmark]: BuchiAutomizer took 10279.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 183.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 34.0 MB). Peak memory consumption was 217.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:41:15,473 INFO L168 Benchmark]: Witness Printer took 6.99 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:41:15,478 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.16 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 683.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -158.9 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.29 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 62.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. * RCFGBuilder took 514.62 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: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10279.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 183.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 34.0 MB). Peak memory consumption was 217.5 MB. Max. memory is 11.5 GB. * Witness Printer took 6.99 ms. Allocated memory is still 1.3 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[t] + -1 * t and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 9.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 15 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 50 SDtfs, 57 SDslu, 15 SDs, 0 SdLazy, 13 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital235 mio100 ax100 hnf99 lsp95 ukn83 mio100 lsp46 div100 bol100 ite100 ukn100 eq191 hnf88 smp100 dnf212 smp98 tf100 neg97 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 173ms VariablesStem: 12 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...