./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strcat_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_365b0da9-f18e-4cd4-8679-50ca3e019e36/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_365b0da9-f18e-4cd4-8679-50ca3e019e36/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_365b0da9-f18e-4cd4-8679-50ca3e019e36/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_365b0da9-f18e-4cd4-8679-50ca3e019e36/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strcat_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_365b0da9-f18e-4cd4-8679-50ca3e019e36/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_365b0da9-f18e-4cd4-8679-50ca3e019e36/bin-2019/uautomizer --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 /tmp/vcloud-vcloud-master/worker/working_dir_365b0da9-f18e-4cd4-8679-50ca3e019e36/bin-2019/uautomizer/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.23-635dfa2 [2018-12-09 08:31:18,080 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 08:31:18,081 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 08:31:18,087 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 08:31:18,087 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 08:31:18,088 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 08:31:18,088 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 08:31:18,089 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 08:31:18,090 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 08:31:18,090 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 08:31:18,091 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 08:31:18,091 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 08:31:18,091 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 08:31:18,092 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 08:31:18,092 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 08:31:18,093 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 08:31:18,093 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 08:31:18,094 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 08:31:18,095 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 08:31:18,096 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 08:31:18,096 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 08:31:18,097 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 08:31:18,098 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 08:31:18,098 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 08:31:18,098 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 08:31:18,099 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 08:31:18,099 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 08:31:18,100 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 08:31:18,100 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 08:31:18,101 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 08:31:18,101 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 08:31:18,101 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 08:31:18,101 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 08:31:18,102 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 08:31:18,102 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 08:31:18,102 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 08:31:18,103 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_365b0da9-f18e-4cd4-8679-50ca3e019e36/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-09 08:31:18,110 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 08:31:18,111 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 08:31:18,111 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 08:31:18,111 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 08:31:18,112 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 08:31:18,112 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 08:31:18,112 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 08:31:18,112 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 08:31:18,112 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 08:31:18,112 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 08:31:18,112 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 08:31:18,112 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 08:31:18,113 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 08:31:18,113 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 08:31:18,113 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 08:31:18,113 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 08:31:18,113 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 08:31:18,113 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 08:31:18,113 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 08:31:18,113 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 08:31:18,114 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 08:31:18,114 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 08:31:18,114 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 08:31:18,114 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 08:31:18,114 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 08:31:18,114 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 08:31:18,114 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 08:31:18,115 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 08:31:18,115 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 08:31:18,115 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_365b0da9-f18e-4cd4-8679-50ca3e019e36/bin-2019/uautomizer 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 [2018-12-09 08:31:18,132 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 08:31:18,139 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 08:31:18,141 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 08:31:18,142 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 08:31:18,142 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 08:31:18,142 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_365b0da9-f18e-4cd4-8679-50ca3e019e36/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strcat_true-termination.c.i [2018-12-09 08:31:18,174 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_365b0da9-f18e-4cd4-8679-50ca3e019e36/bin-2019/uautomizer/data/492bcb939/f9bad92c09584adab803a4a3cc2032ed/FLAGf9bcb4879 [2018-12-09 08:31:18,609 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 08:31:18,609 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_365b0da9-f18e-4cd4-8679-50ca3e019e36/sv-benchmarks/c/termination-libowfat/strcat_true-termination.c.i [2018-12-09 08:31:18,615 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_365b0da9-f18e-4cd4-8679-50ca3e019e36/bin-2019/uautomizer/data/492bcb939/f9bad92c09584adab803a4a3cc2032ed/FLAGf9bcb4879 [2018-12-09 08:31:18,624 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_365b0da9-f18e-4cd4-8679-50ca3e019e36/bin-2019/uautomizer/data/492bcb939/f9bad92c09584adab803a4a3cc2032ed [2018-12-09 08:31:18,626 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 08:31:18,627 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 08:31:18,627 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 08:31:18,627 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 08:31:18,629 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 08:31:18,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:31:18" (1/1) ... [2018-12-09 08:31:18,631 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e809d1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:31:18, skipping insertion in model container [2018-12-09 08:31:18,632 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:31:18" (1/1) ... [2018-12-09 08:31:18,636 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 08:31:18,653 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 08:31:18,795 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 08:31:18,801 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 08:31:18,862 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 08:31:18,886 INFO L195 MainTranslator]: Completed translation [2018-12-09 08:31:18,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:31:18 WrapperNode [2018-12-09 08:31:18,886 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 08:31:18,886 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 08:31:18,886 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 08:31:18,886 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 08:31:18,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:31:18" (1/1) ... [2018-12-09 08:31:18,899 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:31:18" (1/1) ... [2018-12-09 08:31:18,913 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 08:31:18,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 08:31:18,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 08:31:18,913 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 08:31:18,918 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:31:18" (1/1) ... [2018-12-09 08:31:18,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:31:18" (1/1) ... [2018-12-09 08:31:18,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:31:18" (1/1) ... [2018-12-09 08:31:18,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:31:18" (1/1) ... [2018-12-09 08:31:18,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:31:18" (1/1) ... [2018-12-09 08:31:18,927 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:31:18" (1/1) ... [2018-12-09 08:31:18,928 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:31:18" (1/1) ... [2018-12-09 08:31:18,929 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 08:31:18,929 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 08:31:18,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 08:31:18,929 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 08:31:18,930 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:31:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_365b0da9-f18e-4cd4-8679-50ca3e019e36/bin-2019/uautomizer/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 [2018-12-09 08:31:18,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 08:31:18,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 08:31:18,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 08:31:18,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 08:31:18,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 08:31:18,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 08:31:19,109 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 08:31:19,109 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2018-12-09 08:31:19,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:31:19 BoogieIcfgContainer [2018-12-09 08:31:19,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 08:31:19,110 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 08:31:19,110 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 08:31:19,112 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 08:31:19,113 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 08:31:19,113 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 08:31:18" (1/3) ... [2018-12-09 08:31:19,113 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2079927b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 08:31:19, skipping insertion in model container [2018-12-09 08:31:19,113 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 08:31:19,113 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:31:18" (2/3) ... [2018-12-09 08:31:19,114 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2079927b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 08:31:19, skipping insertion in model container [2018-12-09 08:31:19,114 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 08:31:19,114 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:31:19" (3/3) ... [2018-12-09 08:31:19,115 INFO L375 chiAutomizerObserver]: Analyzing ICFG strcat_true-termination.c.i [2018-12-09 08:31:19,146 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 08:31:19,147 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 08:31:19,147 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 08:31:19,147 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 08:31:19,147 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 08:31:19,147 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 08:31:19,147 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 08:31:19,147 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 08:31:19,147 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 08:31:19,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-12-09 08:31:19,167 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-09 08:31:19,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 08:31:19,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 08:31:19,172 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-09 08:31:19,172 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 08:31:19,172 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 08:31:19,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-12-09 08:31:19,173 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-09 08:31:19,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 08:31:19,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 08:31:19,173 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-09 08:31:19,173 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 08:31:19,178 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.alloc(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.alloc(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 [2018-12-09 08:31:19,178 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 [2018-12-09 08:31:19,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:31:19,181 INFO L82 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2018-12-09 08:31:19,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:31:19,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:31:19,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:31:19,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:31:19,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:31:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:31:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:31:19,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:31:19,267 INFO L82 PathProgramCache]: Analyzing trace with hash 55771, now seen corresponding path program 1 times [2018-12-09 08:31:19,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:31:19,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:31:19,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:31:19,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:31:19,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:31:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:31:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:31:19,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:31:19,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1271629391, now seen corresponding path program 1 times [2018-12-09 08:31:19,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:31:19,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:31:19,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:31:19,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:31:19,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:31:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:31:19,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:31:19,585 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2018-12-09 08:31:19,668 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 08:31:19,669 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 08:31:19,669 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 08:31:19,669 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 08:31:19,669 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 08:31:19,669 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 08:31:19,670 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 08:31:19,670 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 08:31:19,670 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcat_true-termination.c.i_Iteration1_Lasso [2018-12-09 08:31:19,670 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 08:31:19,670 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 08:31:19,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,868 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2018-12-09 08:31:19,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:19,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:20,245 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 08:31:20,248 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 08:31:20,250 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 [2018-12-09 08:31:20,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:31:20,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:31:20,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:31:20,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:31:20,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:31:20,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:31:20,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:31:20,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:31:20,254 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 [2018-12-09 08:31:20,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:31:20,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:31:20,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:31:20,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:31:20,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:31:20,255 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:31:20,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:31:20,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:31:20,256 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 [2018-12-09 08:31:20,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:31:20,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:31:20,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:31:20,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:31:20,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:31:20,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:31:20,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:31:20,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:31:20,257 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 [2018-12-09 08:31:20,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:31:20,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:31:20,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:31:20,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:31:20,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:31:20,258 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:31:20,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:31:20,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:31:20,258 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 [2018-12-09 08:31:20,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:31:20,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:31:20,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:31:20,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:31:20,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:31:20,259 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:31:20,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:31:20,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:31:20,260 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 [2018-12-09 08:31:20,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:31:20,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:31:20,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:31:20,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:31:20,261 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:31:20,262 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:31:20,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:31:20,270 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 [2018-12-09 08:31:20,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:31:20,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:31:20,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:31:20,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:31:20,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:31:20,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:31:20,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:31:20,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:31:20,272 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 [2018-12-09 08:31:20,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:31:20,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:31:20,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:31:20,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:31:20,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:31:20,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:31:20,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:31:20,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:31:20,273 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 [2018-12-09 08:31:20,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:31:20,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:31:20,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:31:20,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:31:20,274 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:31:20,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:31:20,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:31:20,277 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 [2018-12-09 08:31:20,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:31:20,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:31:20,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:31:20,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:31:20,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:31:20,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:31:20,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:31:20,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:31:20,278 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 [2018-12-09 08:31:20,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:31:20,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:31:20,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:31:20,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:31:20,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:31:20,279 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 08:31:20,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:31:20,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:31:20,280 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 [2018-12-09 08:31:20,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:31:20,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:31:20,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:31:20,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:31:20,281 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:31:20,281 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:31:20,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:31:20,284 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 [2018-12-09 08:31:20,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:31:20,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:31:20,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:31:20,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:31:20,285 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:31:20,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:31:20,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:31:20,287 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 [2018-12-09 08:31:20,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:31:20,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:31:20,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:31:20,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:31:20,288 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:31:20,289 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:31:20,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:31:20,295 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 [2018-12-09 08:31:20,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:31:20,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:31:20,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:31:20,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:31:20,296 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:31:20,296 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:31:20,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:31:20,298 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 [2018-12-09 08:31:20,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:31:20,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:31:20,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:31:20,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:31:20,299 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:31:20,299 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:31:20,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:31:20,301 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 [2018-12-09 08:31:20,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:31:20,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 08:31:20,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:31:20,302 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 08:31:20,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:31:20,302 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 08:31:20,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 08:31:20,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 08:31:20,304 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 [2018-12-09 08:31:20,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 08:31:20,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 08:31:20,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 08:31:20,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 08:31:20,307 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 08:31:20,307 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 08:31:20,329 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 08:31:20,348 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-12-09 08:31:20,348 INFO L444 ModelExtractionUtils]: 49 out of 55 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-09 08:31:20,350 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 08:31:20,351 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 08:31:20,351 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 08:31:20,351 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlen_~s.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc19.base)_1) = -1*ULTIMATE.start_strlen_~s.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc19.base)_1 Supporting invariants [] [2018-12-09 08:31:20,372 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-12-09 08:31:20,377 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 08:31:20,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:31:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:31:20,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:31:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:31:20,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:31:20,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:31:20,455 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 [2018-12-09 08:31:20,456 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 5 states. [2018-12-09 08:31:20,525 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. [2018-12-09 08:31:20,525 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 [2018-12-09 08:31:20,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 08:31:20,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2018-12-09 08:31:20,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 62 transitions. Stem has 6 letters. Loop has 3 letters. [2018-12-09 08:31:20,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 08:31:20,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 62 transitions. Stem has 9 letters. Loop has 3 letters. [2018-12-09 08:31:20,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 08:31:20,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 62 transitions. Stem has 6 letters. Loop has 6 letters. [2018-12-09 08:31:20,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 08:31:20,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 84 transitions. [2018-12-09 08:31:20,531 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-09 08:31:20,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 24 states and 27 transitions. [2018-12-09 08:31:20,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-09 08:31:20,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-12-09 08:31:20,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2018-12-09 08:31:20,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 08:31:20,534 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-12-09 08:31:20,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2018-12-09 08:31:20,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2018-12-09 08:31:20,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-09 08:31:20,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-12-09 08:31:20,550 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-12-09 08:31:20,550 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-12-09 08:31:20,550 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 08:31:20,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2018-12-09 08:31:20,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 08:31:20,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 08:31:20,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 08:31:20,551 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:31:20,551 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 08:31:20,551 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.alloc(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.alloc(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 [2018-12-09 08:31:20,551 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 [2018-12-09 08:31:20,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:31:20,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907772, now seen corresponding path program 1 times [2018-12-09 08:31:20,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:31:20,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:31:20,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:31:20,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:31:20,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:31:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:31:20,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:31:20,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:31:20,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 08:31:20,582 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 08:31:20,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:31:20,583 INFO L82 PathProgramCache]: Analyzing trace with hash 73640536, now seen corresponding path program 1 times [2018-12-09 08:31:20,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:31:20,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:31:20,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:31:20,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:31:20,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:31:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:31:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:31:20,896 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 104 [2018-12-09 08:31:20,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 08:31:20,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 08:31:20,942 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-12-09 08:31:20,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:31:20,954 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-12-09 08:31:20,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 08:31:20,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2018-12-09 08:31:20,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 08:31:20,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 20 transitions. [2018-12-09 08:31:20,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-12-09 08:31:20,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-12-09 08:31:20,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2018-12-09 08:31:20,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 08:31:20,956 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-12-09 08:31:20,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2018-12-09 08:31:20,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-09 08:31:20,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-09 08:31:20,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-12-09 08:31:20,957 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-12-09 08:31:20,958 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-12-09 08:31:20,958 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 08:31:20,958 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2018-12-09 08:31:20,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 08:31:20,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 08:31:20,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 08:31:20,958 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:31:20,958 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 08:31:20,959 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.alloc(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.alloc(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 [2018-12-09 08:31:20,959 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 [2018-12-09 08:31:20,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:31:20,959 INFO L82 PathProgramCache]: Analyzing trace with hash 765803698, now seen corresponding path program 1 times [2018-12-09 08:31:20,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:31:20,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:31:20,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:31:20,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:31:20,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:31:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:31:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:31:20,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:31:20,981 INFO L82 PathProgramCache]: Analyzing trace with hash 73640536, now seen corresponding path program 2 times [2018-12-09 08:31:20,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:31:20,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:31:20,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:31:20,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:31:20,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:31:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:31:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:31:21,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:31:21,005 INFO L82 PathProgramCache]: Analyzing trace with hash 648918087, now seen corresponding path program 1 times [2018-12-09 08:31:21,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:31:21,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:31:21,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:31:21,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:31:21,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:31:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:31:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:31:21,365 WARN L180 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 104 [2018-12-09 08:31:21,642 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 119 [2018-12-09 08:31:21,722 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 08:31:21,722 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 08:31:21,722 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 08:31:21,722 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 08:31:21,722 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 08:31:21,722 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 08:31:21,722 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 08:31:21,722 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 08:31:21,722 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcat_true-termination.c.i_Iteration3_Lasso [2018-12-09 08:31:21,722 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 08:31:21,722 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 08:31:21,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:21,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:21,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:21,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 08:31:22,203 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 91 [2018-12-09 08:31:22,224 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) [2018-12-09 08:31:22,226 INFO L168 Benchmark]: Toolchain (without parser) took 3599.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.9 MB). Free memory was 951.7 MB in the beginning and 934.7 MB in the end (delta: 17.0 MB). Peak memory consumption was 222.3 MB. Max. memory is 11.5 GB. [2018-12-09 08:31:22,227 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 08:31:22,227 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -164.9 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2018-12-09 08:31:22,228 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.41 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 08:31:22,228 INFO L168 Benchmark]: Boogie Preprocessor took 16.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 08:31:22,228 INFO L168 Benchmark]: RCFGBuilder took 180.38 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-12-09 08:31:22,229 INFO L168 Benchmark]: BuchiAutomizer took 3115.70 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 934.7 MB in the end (delta: 154.1 MB). Peak memory consumption was 232.1 MB. Max. memory is 11.5 GB. [2018-12-09 08:31:22,231 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 258.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -164.9 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.41 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 180.38 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3115.70 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 934.7 MB in the end (delta: 154.1 MB). Peak memory consumption was 232.1 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...