./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-libowfat/strcat_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f 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_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 169307d87ddc37871e07877236048b02359797e9 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:24:24,748 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:24:24,750 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:24:24,770 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:24:24,770 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:24:24,771 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:24:24,773 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:24:24,775 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:24:24,777 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:24:24,778 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:24:24,779 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:24:24,779 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:24:24,780 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:24:24,781 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:24:24,782 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:24:24,783 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:24:24,784 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:24:24,786 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:24:24,788 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:24:24,789 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:24:24,790 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:24:24,791 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:24:24,794 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:24:24,794 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:24:24,795 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:24:24,796 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:24:24,797 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:24:24,797 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:24:24,798 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:24:24,800 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:24:24,800 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:24:24,801 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:24:24,801 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:24:24,801 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:24:24,804 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:24:24,805 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:24:24,805 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:24:24,838 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:24:24,839 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:24:24,841 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:24:24,841 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:24:24,841 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:24:24,841 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:24:24,841 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:24:24,841 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:24:24,842 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:24:24,843 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:24:24,844 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:24:24,844 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:24:24,844 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:24:24,844 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:24:24,844 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:24:24,845 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:24:24,847 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:24:24,847 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:24:24,847 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:24:24,847 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:24:24,848 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:24:24,849 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:24:24,849 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:24:24,850 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:24:24,850 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:24:24,850 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:24:24,851 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:24:24,851 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:24:24,852 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:24:24,852 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 -> 169307d87ddc37871e07877236048b02359797e9 [2019-01-14 02:24:24,922 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:24:24,938 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:24:24,943 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:24:24,945 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:24:24,945 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:24:24,946 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-libowfat/strcat_true-termination.c.i [2019-01-14 02:24:25,001 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea13c2607/61f6d93ba8354b998900b2d5ac320c45/FLAG497cacb57 [2019-01-14 02:24:25,494 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:24:25,495 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-libowfat/strcat_true-termination.c.i [2019-01-14 02:24:25,509 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea13c2607/61f6d93ba8354b998900b2d5ac320c45/FLAG497cacb57 [2019-01-14 02:24:25,790 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea13c2607/61f6d93ba8354b998900b2d5ac320c45 [2019-01-14 02:24:25,793 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:24:25,794 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:24:25,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:24:25,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:24:25,799 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:24:25,800 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:24:25" (1/1) ... [2019-01-14 02:24:25,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c9faf0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:24:25, skipping insertion in model container [2019-01-14 02:24:25,803 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:24:25" (1/1) ... [2019-01-14 02:24:25,810 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:24:25,850 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:24:26,277 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:24:26,288 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:24:26,419 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:24:26,470 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:24:26,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:24:26 WrapperNode [2019-01-14 02:24:26,470 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:24:26,471 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:24:26,471 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:24:26,472 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:24:26,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:24:26" (1/1) ... [2019-01-14 02:24:26,498 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:24:26" (1/1) ... [2019-01-14 02:24:26,527 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:24:26,527 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:24:26,527 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:24:26,528 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:24:26,540 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:24:26" (1/1) ... [2019-01-14 02:24:26,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:24:26" (1/1) ... [2019-01-14 02:24:26,545 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:24:26" (1/1) ... [2019-01-14 02:24:26,545 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:24:26" (1/1) ... [2019-01-14 02:24:26,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:24:26" (1/1) ... [2019-01-14 02:24:26,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:24:26" (1/1) ... [2019-01-14 02:24:26,567 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:24:26" (1/1) ... [2019-01-14 02:24:26,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:24:26,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:24:26,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:24:26,571 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:24:26,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:24:26" (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-14 02:24:26,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:24:26,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:24:26,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:24:26,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:24:26,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:24:26,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:24:27,329 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:24:27,329 INFO L286 CfgBuilder]: Removed 10 assue(true) statements. [2019-01-14 02:24:27,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:24:27 BoogieIcfgContainer [2019-01-14 02:24:27,331 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:24:27,332 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:24:27,332 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:24:27,335 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:24:27,336 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:24:27,336 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:24:25" (1/3) ... [2019-01-14 02:24:27,337 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6cd2668a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:24:27, skipping insertion in model container [2019-01-14 02:24:27,337 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:24:27,337 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:24:26" (2/3) ... [2019-01-14 02:24:27,337 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6cd2668a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:24:27, skipping insertion in model container [2019-01-14 02:24:27,338 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:24:27,339 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:24:27" (3/3) ... [2019-01-14 02:24:27,341 INFO L375 chiAutomizerObserver]: Analyzing ICFG strcat_true-termination.c.i [2019-01-14 02:24:27,397 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:24:27,398 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:24:27,398 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:24:27,398 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:24:27,398 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:24:27,398 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:24:27,398 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:24:27,399 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:24:27,399 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:24:27,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-01-14 02:24:27,436 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-14 02:24:27,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:24:27,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:24:27,445 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:24:27,445 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:24:27,445 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:24:27,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-01-14 02:24:27,448 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-14 02:24:27,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:24:27,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:24:27,449 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:24:27,449 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:24:27,458 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.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~nondet18;havoc main_#t~nondet18; 4#L526true assume !(main_~in_len~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc19.base, main_#t~malloc19.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~nondet20;havoc main_#t~nondet20; 15#L530true assume !(main_~out_len~0 < 1);main_~out_end~0 := main_#t~nondet21;havoc main_#t~nondet21; 11#L532true assume !(main_~out_len~0 < main_~out_end~0 + main_~in_len~0);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc22.base, main_#t~malloc22.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_#t~mem9, strcat_#t~pre10.base, strcat_#t~pre10.offset, strcat_#t~pre11.base, strcat_#t~pre11.offset, strcat_#t~mem12, strcat_#t~pre13.base, strcat_#t~pre13.offset, strcat_#t~pre14.base, strcat_#t~pre14.offset, strcat_#t~mem15, strcat_#t~pre16.base, strcat_#t~pre16.offset, strcat_#t~pre17.base, strcat_#t~pre17.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; 18#L508true assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 3#L509-4true [2019-01-14 02:24:27,459 INFO L796 eck$LassoCheckResult]: Loop: 3#L509-4true call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 19#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; 23#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-14 02:24:27,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:24:27,466 INFO L82 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2019-01-14 02:24:27,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:24:27,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:24:27,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:27,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:24:27,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:27,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:24:27,658 INFO L82 PathProgramCache]: Analyzing trace with hash 55771, now seen corresponding path program 1 times [2019-01-14 02:24:27,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:24:27,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:24:27,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:27,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:24:27,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:27,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:24:27,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1271629391, now seen corresponding path program 1 times [2019-01-14 02:24:27,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:24:27,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:24:27,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:27,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:24:27,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:27,899 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-14 02:24:29,149 WARN L181 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 126 DAG size of output: 108 [2019-01-14 02:24:29,421 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-14 02:24:29,435 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:24:29,437 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:24:29,437 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:24:29,437 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:24:29,437 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:24:29,437 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:24:29,438 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:24:29,438 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:24:29,438 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcat_true-termination.c.i_Iteration1_Lasso [2019-01-14 02:24:29,438 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:24:29,439 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:24:29,483 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-14 02:24:29,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:29,505 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-14 02:24:29,514 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-14 02:24:29,528 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-14 02:24:29,534 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-14 02:24:29,541 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-14 02:24:29,546 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-14 02:24:29,551 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-14 02:24:29,559 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-14 02:24:29,564 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-14 02:24:29,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:29,572 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-14 02:24:29,575 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-14 02:24:29,585 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-14 02:24:29,587 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-14 02:24:29,590 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-14 02:24:29,597 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-14 02:24:29,604 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-14 02:24:29,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:29,609 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-14 02:24:29,613 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-14 02:24:29,617 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-14 02:24:29,623 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-14 02:24:29,627 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-14 02:24:29,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:29,634 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-14 02:24:29,641 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-14 02:24:30,175 WARN L181 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-01-14 02:24:30,285 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-14 02:24:30,288 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-14 02:24:30,291 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-14 02:24:30,294 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-14 02:24:30,297 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-14 02:24:30,301 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-14 02:24:30,306 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-14 02:24:30,308 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-14 02:24:30,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-14 02:24:30,316 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-14 02:24:30,642 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-14 02:24:31,454 WARN L181 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-01-14 02:24:31,655 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:24:31,663 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:24:31,666 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-14 02:24:31,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:31,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:31,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:31,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:31,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:31,673 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:31,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:31,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:31,677 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-14 02:24:31,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:31,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:31,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:31,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:31,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:31,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:31,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:31,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:31,682 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-14 02:24:31,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:31,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:31,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:31,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:31,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:31,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:31,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:31,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:31,688 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-14 02:24:31,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:31,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:31,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:31,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:31,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:31,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:31,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:31,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:31,694 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-14 02:24:31,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:31,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:31,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:31,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:31,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:31,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:31,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:31,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:31,699 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-14 02:24:31,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:31,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:31,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:31,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:31,705 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:24:31,705 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:24:31,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:31,721 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-14 02:24:31,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:31,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:31,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:31,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:31,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:31,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:31,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:31,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:31,727 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-14 02:24:31,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:31,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:31,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:31,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:31,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:31,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:31,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:31,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:31,733 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-14 02:24:31,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:31,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:31,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:31,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:31,737 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:24:31,738 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:24:31,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:31,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-14 02:24:31,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:31,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:31,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:31,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:31,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:31,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:31,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:31,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:31,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-14 02:24:31,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:31,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:31,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:31,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:31,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:31,749 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:31,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:31,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:31,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-14 02:24:31,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:31,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:31,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:31,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:31,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:31,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:31,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:31,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:31,758 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-14 02:24:31,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:31,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:31,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:31,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:31,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:31,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:31,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:31,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:31,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-14 02:24:31,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:31,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:31,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:31,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:31,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:31,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:31,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:31,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:31,770 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-14 02:24:31,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:31,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:31,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:31,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:31,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:31,772 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:31,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:31,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:31,776 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-14 02:24:31,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:31,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:31,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:31,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:31,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:31,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:31,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:31,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:31,781 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-14 02:24:31,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:31,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:31,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:31,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:31,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:31,785 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:31,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:31,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:31,787 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-14 02:24:31,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:31,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:31,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:31,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:31,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:31,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:31,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:31,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:31,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-14 02:24:31,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:31,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:31,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:31,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:31,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:31,797 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:31,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:31,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:31,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:24:31,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:31,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:31,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:31,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:31,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:31,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:31,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:31,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:31,805 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-14 02:24:31,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:31,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:31,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:31,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:31,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:31,809 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:31,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:31,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:31,811 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-14 02:24:31,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:31,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:31,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:31,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:31,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:31,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:31,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:31,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:31,817 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-14 02:24:31,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:31,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:31,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:31,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:31,821 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:24:31,821 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:24:31,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:31,826 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-14 02:24:31,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:31,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:31,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:31,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:31,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:31,830 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:31,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:31,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:31,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:24:31,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:31,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:31,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:31,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:31,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:31,834 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:31,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:31,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:31,838 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-14 02:24:31,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:31,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:31,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:31,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:31,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:31,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:31,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:31,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:31,844 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-14 02:24:31,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:31,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:31,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:31,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:31,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:31,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:31,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:31,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:31,850 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-14 02:24:31,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:31,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:31,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:31,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:31,854 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:24:31,854 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:24:31,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:31,859 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-14 02:24:31,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:31,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:31,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:31,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:31,861 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:24:31,861 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:24:31,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:31,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:24:31,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:31,868 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 02:24:31,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:31,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:31,877 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:24:31,877 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:24:31,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:31,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:24:31,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:31,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:31,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:31,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:31,935 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:24:31,936 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:24:31,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:31,946 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-14 02:24:31,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:31,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:31,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:31,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:31,948 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:24:31,949 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:24:31,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:31,954 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-14 02:24:31,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:31,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:31,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:31,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:31,958 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:24:31,958 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:24:31,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:31,961 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-14 02:24:31,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:31,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:31,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:31,962 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:24:31,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:31,965 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:24:31,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:31,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:31,969 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-14 02:24:31,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:31,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:31,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:31,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:31,978 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:24:31,978 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:24:32,014 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:24:32,060 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 02:24:32,060 INFO L444 ModelExtractionUtils]: 49 out of 55 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-14 02:24:32,063 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:24:32,065 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:24:32,066 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:24:32,066 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc19.base)_1, ULTIMATE.start_strlen_~s.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc19.base)_1 - 1*ULTIMATE.start_strlen_~s.offset Supporting invariants [] [2019-01-14 02:24:32,195 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2019-01-14 02:24:32,204 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:24:32,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:24:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:24:32,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:24:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:24:32,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:24:32,509 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-14 02:24:32,523 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2019-01-14 02:24:32,525 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 5 states. [2019-01-14 02:24:32,690 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 5 states. Result 57 states and 84 transitions. Complement of second has 8 states. [2019-01-14 02:24:32,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:24:32,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:24:32,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2019-01-14 02:24:32,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 62 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-14 02:24:32,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:24:32,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 62 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-14 02:24:32,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:24:32,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 62 transitions. Stem has 6 letters. Loop has 6 letters. [2019-01-14 02:24:32,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:24:32,699 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 84 transitions. [2019-01-14 02:24:32,703 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 02:24:32,707 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 24 states and 27 transitions. [2019-01-14 02:24:32,708 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-14 02:24:32,708 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-01-14 02:24:32,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2019-01-14 02:24:32,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:24:32,709 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-01-14 02:24:32,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2019-01-14 02:24:32,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2019-01-14 02:24:32,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-14 02:24:32,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-01-14 02:24:32,732 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-01-14 02:24:32,732 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-01-14 02:24:32,732 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:24:32,733 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2019-01-14 02:24:32,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:24:32,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:24:32,734 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:24:32,734 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:24:32,734 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:24:32,735 INFO L794 eck$LassoCheckResult]: Stem: 190#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 187#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.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~nondet18;havoc main_#t~nondet18; 181#L526 assume !(main_~in_len~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc19.base, main_#t~malloc19.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~nondet20;havoc main_#t~nondet20; 182#L530 assume !(main_~out_len~0 < 1);main_~out_end~0 := main_#t~nondet21;havoc main_#t~nondet21; 188#L532 assume !(main_~out_len~0 < main_~out_end~0 + main_~in_len~0);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc22.base, main_#t~malloc22.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_#t~mem9, strcat_#t~pre10.base, strcat_#t~pre10.offset, strcat_#t~pre11.base, strcat_#t~pre11.offset, strcat_#t~mem12, strcat_#t~pre13.base, strcat_#t~pre13.offset, strcat_#t~pre14.base, strcat_#t~pre14.offset, strcat_#t~mem15, strcat_#t~pre16.base, strcat_#t~pre16.offset, strcat_#t~pre17.base, strcat_#t~pre17.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; 189#L508 assume strlen_~s.base == 0 && strlen_~s.offset == 0;strlen_#res := 0; 184#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; 185#L516-2 [2019-01-14 02:24:32,735 INFO L796 eck$LassoCheckResult]: Loop: 185#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); 186#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;call strcat_#t~mem9 := read~int(strcat_~t.base, strcat_~t.offset, 1);call write~int(strcat_#t~mem9, strcat_~s.base, strcat_~s.offset, 1); 194#L518 assume !(0 == strcat_#t~mem9);havoc strcat_#t~mem9;strcat_#t~pre10.base, strcat_#t~pre10.offset := strcat_~s.base, 1 + strcat_~s.offset;strcat_~s.base, strcat_~s.offset := strcat_~s.base, 1 + strcat_~s.offset;havoc strcat_#t~pre10.base, strcat_#t~pre10.offset;strcat_#t~pre11.base, strcat_#t~pre11.offset := strcat_~t.base, 1 + strcat_~t.offset;strcat_~t.base, strcat_~t.offset := strcat_~t.base, 1 + strcat_~t.offset;havoc strcat_#t~pre11.base, strcat_#t~pre11.offset;call strcat_#t~mem12 := read~int(strcat_~t.base, strcat_~t.offset, 1);call write~int(strcat_#t~mem12, strcat_~s.base, strcat_~s.offset, 1); 192#L519 assume !(0 == strcat_#t~mem12);havoc strcat_#t~mem12;strcat_#t~pre13.base, strcat_#t~pre13.offset := strcat_~s.base, 1 + strcat_~s.offset;strcat_~s.base, strcat_~s.offset := strcat_~s.base, 1 + strcat_~s.offset;havoc strcat_#t~pre13.base, strcat_#t~pre13.offset;strcat_#t~pre14.base, strcat_#t~pre14.offset := strcat_~t.base, 1 + strcat_~t.offset;strcat_~t.base, strcat_~t.offset := strcat_~t.base, 1 + strcat_~t.offset;havoc strcat_#t~pre14.base, strcat_#t~pre14.offset;call strcat_#t~mem15 := read~int(strcat_~t.base, strcat_~t.offset, 1);call write~int(strcat_#t~mem15, strcat_~s.base, strcat_~s.offset, 1); 191#L520 assume !(0 == strcat_#t~mem15);havoc strcat_#t~mem15;strcat_#t~pre16.base, strcat_#t~pre16.offset := strcat_~s.base, 1 + strcat_~s.offset;strcat_~s.base, strcat_~s.offset := strcat_~s.base, 1 + strcat_~s.offset;havoc strcat_#t~pre16.base, strcat_#t~pre16.offset;strcat_#t~pre17.base, strcat_#t~pre17.offset := strcat_~t.base, 1 + strcat_~t.offset;strcat_~t.base, strcat_~t.offset := strcat_~t.base, 1 + strcat_~t.offset;havoc strcat_#t~pre17.base, strcat_#t~pre17.offset; 185#L516-2 [2019-01-14 02:24:32,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:24:32,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907772, now seen corresponding path program 1 times [2019-01-14 02:24:32,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:24:32,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:24:32,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:32,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:24:32,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:24:32,817 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-14 02:24:32,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:24:32,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:24:32,820 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:24:32,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:24:32,821 INFO L82 PathProgramCache]: Analyzing trace with hash 73640536, now seen corresponding path program 1 times [2019-01-14 02:24:32,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:24:32,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:24:32,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:32,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:24:32,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:33,673 WARN L181 SmtUtils]: Spent 811.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 104 [2019-01-14 02:24:33,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:24:33,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:24:33,794 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-01-14 02:24:33,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:24:33,878 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-01-14 02:24:33,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:24:33,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2019-01-14 02:24:33,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:24:33,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 20 transitions. [2019-01-14 02:24:33,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-14 02:24:33,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-14 02:24:33,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2019-01-14 02:24:33,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:24:33,882 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-01-14 02:24:33,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2019-01-14 02:24:33,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-14 02:24:33,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-14 02:24:33,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-01-14 02:24:33,885 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-01-14 02:24:33,885 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-01-14 02:24:33,885 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:24:33,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2019-01-14 02:24:33,886 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:24:33,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:24:33,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:24:33,887 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:24:33,887 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:24:33,887 INFO L794 eck$LassoCheckResult]: Stem: 235#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 232#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.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~nondet18;havoc main_#t~nondet18; 226#L526 assume !(main_~in_len~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc19.base, main_#t~malloc19.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~nondet20;havoc main_#t~nondet20; 227#L530 assume !(main_~out_len~0 < 1);main_~out_end~0 := main_#t~nondet21;havoc main_#t~nondet21; 233#L532 assume !(main_~out_len~0 < main_~out_end~0 + main_~in_len~0);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc22.base, main_#t~malloc22.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_#t~mem9, strcat_#t~pre10.base, strcat_#t~pre10.offset, strcat_#t~pre11.base, strcat_#t~pre11.offset, strcat_#t~mem12, strcat_#t~pre13.base, strcat_#t~pre13.offset, strcat_#t~pre14.base, strcat_#t~pre14.offset, strcat_#t~mem15, strcat_#t~pre16.base, strcat_#t~pre16.offset, strcat_#t~pre17.base, strcat_#t~pre17.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; 234#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 222#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 224#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 228#L509-5 strlen_#res := strlen_~i~0; 229#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; 230#L516-2 [2019-01-14 02:24:33,887 INFO L796 eck$LassoCheckResult]: Loop: 230#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); 231#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;call strcat_#t~mem9 := read~int(strcat_~t.base, strcat_~t.offset, 1);call write~int(strcat_#t~mem9, strcat_~s.base, strcat_~s.offset, 1); 239#L518 assume !(0 == strcat_#t~mem9);havoc strcat_#t~mem9;strcat_#t~pre10.base, strcat_#t~pre10.offset := strcat_~s.base, 1 + strcat_~s.offset;strcat_~s.base, strcat_~s.offset := strcat_~s.base, 1 + strcat_~s.offset;havoc strcat_#t~pre10.base, strcat_#t~pre10.offset;strcat_#t~pre11.base, strcat_#t~pre11.offset := strcat_~t.base, 1 + strcat_~t.offset;strcat_~t.base, strcat_~t.offset := strcat_~t.base, 1 + strcat_~t.offset;havoc strcat_#t~pre11.base, strcat_#t~pre11.offset;call strcat_#t~mem12 := read~int(strcat_~t.base, strcat_~t.offset, 1);call write~int(strcat_#t~mem12, strcat_~s.base, strcat_~s.offset, 1); 237#L519 assume !(0 == strcat_#t~mem12);havoc strcat_#t~mem12;strcat_#t~pre13.base, strcat_#t~pre13.offset := strcat_~s.base, 1 + strcat_~s.offset;strcat_~s.base, strcat_~s.offset := strcat_~s.base, 1 + strcat_~s.offset;havoc strcat_#t~pre13.base, strcat_#t~pre13.offset;strcat_#t~pre14.base, strcat_#t~pre14.offset := strcat_~t.base, 1 + strcat_~t.offset;strcat_~t.base, strcat_~t.offset := strcat_~t.base, 1 + strcat_~t.offset;havoc strcat_#t~pre14.base, strcat_#t~pre14.offset;call strcat_#t~mem15 := read~int(strcat_~t.base, strcat_~t.offset, 1);call write~int(strcat_#t~mem15, strcat_~s.base, strcat_~s.offset, 1); 236#L520 assume !(0 == strcat_#t~mem15);havoc strcat_#t~mem15;strcat_#t~pre16.base, strcat_#t~pre16.offset := strcat_~s.base, 1 + strcat_~s.offset;strcat_~s.base, strcat_~s.offset := strcat_~s.base, 1 + strcat_~s.offset;havoc strcat_#t~pre16.base, strcat_#t~pre16.offset;strcat_#t~pre17.base, strcat_#t~pre17.offset := strcat_~t.base, 1 + strcat_~t.offset;strcat_~t.base, strcat_~t.offset := strcat_~t.base, 1 + strcat_~t.offset;havoc strcat_#t~pre17.base, strcat_#t~pre17.offset; 230#L516-2 [2019-01-14 02:24:33,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:24:33,887 INFO L82 PathProgramCache]: Analyzing trace with hash 765803698, now seen corresponding path program 1 times [2019-01-14 02:24:33,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:24:33,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:24:33,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:33,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:24:33,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:33,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:24:33,927 INFO L82 PathProgramCache]: Analyzing trace with hash 73640536, now seen corresponding path program 2 times [2019-01-14 02:24:33,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:24:33,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:24:33,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:33,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:24:33,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:33,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:33,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:24:33,991 INFO L82 PathProgramCache]: Analyzing trace with hash 648918087, now seen corresponding path program 1 times [2019-01-14 02:24:33,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:24:33,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:24:33,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:33,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:24:33,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:34,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:34,888 WARN L181 SmtUtils]: Spent 794.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 104 [2019-01-14 02:24:34,995 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-01-14 02:24:35,540 WARN L181 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 122 [2019-01-14 02:24:35,695 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-01-14 02:24:35,698 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:24:35,699 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:24:35,699 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:24:35,699 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:24:35,699 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:24:35,699 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:24:35,700 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:24:35,700 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:24:35,700 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcat_true-termination.c.i_Iteration3_Lasso [2019-01-14 02:24:35,700 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:24:35,700 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:24:35,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:35,723 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-14 02:24:35,724 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-14 02:24:35,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:35,728 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-14 02:24:35,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:36,849 WARN L181 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 94 [2019-01-14 02:24:36,927 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:111) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:286) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:958) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:476) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-01-14 02:24:36,930 INFO L168 Benchmark]: Toolchain (without parser) took 11136.23 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 297.8 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -180.7 MB). Peak memory consumption was 358.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:24:36,931 INFO L168 Benchmark]: CDTParser took 0.15 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-14 02:24:36,932 INFO L168 Benchmark]: CACSL2BoogieTranslator took 675.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:24:36,936 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.85 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-14 02:24:36,936 INFO L168 Benchmark]: Boogie Preprocessor took 42.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:24:36,937 INFO L168 Benchmark]: RCFGBuilder took 760.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:24:36,938 INFO L168 Benchmark]: BuchiAutomizer took 9597.55 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 159.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -39.6 MB). Peak memory consumption was 361.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:24:36,946 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.15 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 675.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.85 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 42.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 760.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9597.55 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 159.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -39.6 MB). Peak memory consumption was 361.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...