./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 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_608901c2-8ede-4f74-9115-e462a866068f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_608901c2-8ede-4f74-9115-e462a866068f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_608901c2-8ede-4f74-9115-e462a866068f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_608901c2-8ede-4f74-9115-e462a866068f/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_608901c2-8ede-4f74-9115-e462a866068f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_608901c2-8ede-4f74-9115-e462a866068f/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_608901c2-8ede-4f74-9115-e462a866068f/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-0cd3be1 [2018-11-28 13:26:01,250 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:26:01,252 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:26:01,260 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:26:01,260 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:26:01,261 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:26:01,262 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:26:01,263 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:26:01,265 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:26:01,266 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:26:01,266 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:26:01,267 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:26:01,267 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:26:01,268 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:26:01,269 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:26:01,270 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:26:01,271 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:26:01,272 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:26:01,273 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:26:01,275 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:26:01,276 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:26:01,277 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:26:01,278 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:26:01,279 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:26:01,279 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:26:01,280 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:26:01,280 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:26:01,281 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:26:01,282 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:26:01,283 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:26:01,283 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:26:01,284 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:26:01,284 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:26:01,284 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:26:01,285 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:26:01,285 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:26:01,286 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_608901c2-8ede-4f74-9115-e462a866068f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 13:26:01,297 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:26:01,298 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:26:01,299 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:26:01,299 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:26:01,299 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:26:01,299 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 13:26:01,299 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 13:26:01,299 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 13:26:01,300 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 13:26:01,300 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 13:26:01,300 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 13:26:01,300 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:26:01,300 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 13:26:01,300 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:26:01,301 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:26:01,301 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 13:26:01,301 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 13:26:01,301 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 13:26:01,301 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:26:01,301 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 13:26:01,302 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:26:01,302 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 13:26:01,302 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:26:01,302 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:26:01,302 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 13:26:01,302 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:26:01,303 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:26:01,303 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 13:26:01,304 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 13:26:01,304 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_608901c2-8ede-4f74-9115-e462a866068f/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-11-28 13:26:01,331 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:26:01,341 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:26:01,344 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:26:01,345 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:26:01,345 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:26:01,346 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_608901c2-8ede-4f74-9115-e462a866068f/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strcat_true-termination.c.i [2018-11-28 13:26:01,390 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_608901c2-8ede-4f74-9115-e462a866068f/bin-2019/uautomizer/data/5c1aeec14/01041661e0b74afdbc525c39f361996f/FLAG192102274 [2018-11-28 13:26:01,778 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:26:01,778 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_608901c2-8ede-4f74-9115-e462a866068f/sv-benchmarks/c/termination-libowfat/strcat_true-termination.c.i [2018-11-28 13:26:01,787 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_608901c2-8ede-4f74-9115-e462a866068f/bin-2019/uautomizer/data/5c1aeec14/01041661e0b74afdbc525c39f361996f/FLAG192102274 [2018-11-28 13:26:01,798 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_608901c2-8ede-4f74-9115-e462a866068f/bin-2019/uautomizer/data/5c1aeec14/01041661e0b74afdbc525c39f361996f [2018-11-28 13:26:01,800 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:26:01,801 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:26:01,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:26:01,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:26:01,805 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:26:01,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:26:01" (1/1) ... [2018-11-28 13:26:01,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39239a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:01, skipping insertion in model container [2018-11-28 13:26:01,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:26:01" (1/1) ... [2018-11-28 13:26:01,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:26:01,841 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:26:02,073 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:26:02,135 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:26:02,171 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:26:02,203 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:26:02,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:02 WrapperNode [2018-11-28 13:26:02,204 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:26:02,205 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:26:02,205 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:26:02,205 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:26:02,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:02" (1/1) ... [2018-11-28 13:26:02,222 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:02" (1/1) ... [2018-11-28 13:26:02,240 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:26:02,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:26:02,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:26:02,241 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:26:02,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:02" (1/1) ... [2018-11-28 13:26:02,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:02" (1/1) ... [2018-11-28 13:26:02,253 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:02" (1/1) ... [2018-11-28 13:26:02,253 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:02" (1/1) ... [2018-11-28 13:26:02,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:02" (1/1) ... [2018-11-28 13:26:02,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:02" (1/1) ... [2018-11-28 13:26:02,265 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:02" (1/1) ... [2018-11-28 13:26:02,266 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:26:02,266 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:26:02,267 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:26:02,267 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:26:02,267 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_608901c2-8ede-4f74-9115-e462a866068f/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-11-28 13:26:02,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:26:02,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 13:26:02,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 13:26:02,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:26:02,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:26:02,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:26:02,523 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:26:02,523 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2018-11-28 13:26:02,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:26:02 BoogieIcfgContainer [2018-11-28 13:26:02,524 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:26:02,525 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 13:26:02,525 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 13:26:02,528 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 13:26:02,529 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:26:02,529 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 01:26:01" (1/3) ... [2018-11-28 13:26:02,530 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12dfdf15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:26:02, skipping insertion in model container [2018-11-28 13:26:02,530 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:26:02,530 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:02" (2/3) ... [2018-11-28 13:26:02,530 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12dfdf15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:26:02, skipping insertion in model container [2018-11-28 13:26:02,530 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:26:02,530 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:26:02" (3/3) ... [2018-11-28 13:26:02,532 INFO L375 chiAutomizerObserver]: Analyzing ICFG strcat_true-termination.c.i [2018-11-28 13:26:02,571 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:26:02,571 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 13:26:02,572 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 13:26:02,572 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 13:26:02,572 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:26:02,572 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:26:02,572 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 13:26:02,572 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:26:02,572 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 13:26:02,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-28 13:26:02,598 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-28 13:26:02,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:26:02,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:26:02,604 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 13:26:02,604 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 13:26:02,604 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 13:26:02,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-28 13:26:02,605 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-28 13:26:02,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:26:02,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:26:02,606 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 13:26:02,606 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 13:26:02,612 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-11-28 13:26:02,612 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-11-28 13:26:02,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:26:02,617 INFO L82 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2018-11-28 13:26:02,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:26:02,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:26:02,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:26:02,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:26:02,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:26:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:26:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:26:02,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:26:02,730 INFO L82 PathProgramCache]: Analyzing trace with hash 55771, now seen corresponding path program 1 times [2018-11-28 13:26:02,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:26:02,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:26:02,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:26:02,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:26:02,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:26:02,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:26:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:26:02,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:26:02,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1271629391, now seen corresponding path program 1 times [2018-11-28 13:26:02,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:26:02,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:26:02,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:26:02,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:26:02,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:26:02,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:26:02,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:26:03,171 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2018-11-28 13:26:03,286 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-11-28 13:26:03,296 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:26:03,297 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:26:03,298 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:26:03,298 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:26:03,298 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:26:03,298 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:26:03,298 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:26:03,299 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:26:03,299 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcat_true-termination.c.i_Iteration1_Lasso [2018-11-28 13:26:03,299 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:26:03,299 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:26:03,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,581 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2018-11-28 13:26:03,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:03,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:04,048 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:26:04,052 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:26:04,054 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-11-28 13:26:04,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:26:04,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:26:04,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:26:04,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:26:04,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:26:04,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:26:04,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:26:04,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:26:04,062 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-11-28 13:26:04,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:26:04,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:26:04,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:26:04,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:26:04,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:26:04,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:26:04,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:26:04,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:26:04,065 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-11-28 13:26:04,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:26:04,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:26:04,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:26:04,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:26:04,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:26:04,069 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:26:04,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:26:04,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:26:04,070 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-11-28 13:26:04,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:26:04,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:26:04,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:26:04,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:26:04,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:26:04,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:26:04,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:26:04,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:26:04,073 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-11-28 13:26:04,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:26:04,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:26:04,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:26:04,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:26:04,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:26:04,075 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:26:04,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:26:04,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:26:04,076 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-11-28 13:26:04,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:26:04,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:26:04,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:26:04,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:26:04,079 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:26:04,079 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:26:04,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:26:04,093 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-11-28 13:26:04,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:26:04,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:26:04,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:26:04,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:26:04,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:26:04,095 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:26:04,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:26:04,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:26:04,096 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-11-28 13:26:04,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:26:04,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:26:04,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:26:04,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:26:04,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:26:04,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:26:04,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:26:04,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:26:04,099 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-11-28 13:26:04,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:26:04,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:26:04,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:26:04,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:26:04,101 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:26:04,101 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:26:04,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:26:04,105 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-11-28 13:26:04,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:26:04,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:26:04,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:26:04,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:26:04,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:26:04,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:26:04,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:26:04,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:26:04,107 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-11-28 13:26:04,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:26:04,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:26:04,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:26:04,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:26:04,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:26:04,109 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:26:04,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:26:04,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:26:04,110 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-11-28 13:26:04,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:26:04,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:26:04,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:26:04,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:26:04,112 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:26:04,112 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:26:04,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:26:04,117 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-11-28 13:26:04,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:26:04,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:26:04,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:26:04,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:26:04,120 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:26:04,120 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:26:04,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:26:04,123 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-11-28 13:26:04,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:26:04,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:26:04,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:26:04,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:26:04,129 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:26:04,130 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:26:04,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:26:04,143 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-11-28 13:26:04,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:26:04,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:26:04,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:26:04,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:26:04,145 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:26:04,145 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:26:04,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:26:04,150 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-11-28 13:26:04,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:26:04,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:26:04,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:26:04,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:26:04,152 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:26:04,152 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:26:04,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:26:04,158 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-11-28 13:26:04,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:26:04,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:26:04,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:26:04,159 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:26:04,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:26:04,159 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:26:04,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:26:04,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:26:04,166 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-11-28 13:26:04,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:26:04,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:26:04,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:26:04,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:26:04,174 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:26:04,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:26:04,216 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:26:04,251 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-28 13:26:04,251 INFO L444 ModelExtractionUtils]: 49 out of 55 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 13:26:04,253 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:26:04,255 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:26:04,255 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:26:04,256 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-11-28 13:26:04,307 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-28 13:26:04,313 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 13:26:04,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:26:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:26:04,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:26:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:26:04,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:26:04,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:26:04,414 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-11-28 13:26:04,415 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 5 states. [2018-11-28 13:26:04,507 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-11-28 13:26:04,508 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-11-28 13:26:04,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 13:26:04,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2018-11-28 13:26:04,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 62 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-28 13:26:04,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:26:04,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 62 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-28 13:26:04,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:26:04,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 62 transitions. Stem has 6 letters. Loop has 6 letters. [2018-11-28 13:26:04,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:26:04,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 84 transitions. [2018-11-28 13:26:04,516 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-28 13:26:04,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 24 states and 27 transitions. [2018-11-28 13:26:04,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-28 13:26:04,520 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-28 13:26:04,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2018-11-28 13:26:04,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:26:04,521 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-28 13:26:04,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2018-11-28 13:26:04,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2018-11-28 13:26:04,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-28 13:26:04,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-11-28 13:26:04,542 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-28 13:26:04,542 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-28 13:26:04,542 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 13:26:04,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2018-11-28 13:26:04,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 13:26:04,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:26:04,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:26:04,543 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:26:04,543 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 13:26:04,543 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-11-28 13:26:04,544 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-11-28 13:26:04,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:26:04,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907772, now seen corresponding path program 1 times [2018-11-28 13:26:04,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:26:04,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:26:04,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:26:04,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:26:04,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:26:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:26:04,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:26:04,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:26:04,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:26:04,618 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:26:04,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:26:04,619 INFO L82 PathProgramCache]: Analyzing trace with hash 73640536, now seen corresponding path program 1 times [2018-11-28 13:26:04,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:26:04,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:26:04,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:26:04,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:26:04,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:26:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:26:04,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:26:05,094 WARN L180 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 104 [2018-11-28 13:26:05,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:26:05,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:26:05,155 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-28 13:26:05,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:26:05,173 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-11-28 13:26:05,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:26:05,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2018-11-28 13:26:05,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 13:26:05,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 20 transitions. [2018-11-28 13:26:05,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-28 13:26:05,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-28 13:26:05,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2018-11-28 13:26:05,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:26:05,176 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-28 13:26:05,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2018-11-28 13:26:05,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-28 13:26:05,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-28 13:26:05,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-11-28 13:26:05,178 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-28 13:26:05,178 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-28 13:26:05,178 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 13:26:05,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2018-11-28 13:26:05,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 13:26:05,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:26:05,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:26:05,179 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:26:05,179 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 13:26:05,180 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-11-28 13:26:05,180 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-11-28 13:26:05,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:26:05,180 INFO L82 PathProgramCache]: Analyzing trace with hash 765803698, now seen corresponding path program 1 times [2018-11-28 13:26:05,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:26:05,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:26:05,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:26:05,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:26:05,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:26:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:26:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:26:05,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:26:05,206 INFO L82 PathProgramCache]: Analyzing trace with hash 73640536, now seen corresponding path program 2 times [2018-11-28 13:26:05,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:26:05,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:26:05,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:26:05,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:26:05,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:26:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:26:05,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:26:05,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:26:05,235 INFO L82 PathProgramCache]: Analyzing trace with hash 648918087, now seen corresponding path program 1 times [2018-11-28 13:26:05,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:26:05,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:26:05,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:26:05,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:26:05,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:26:05,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:26:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:26:05,756 WARN L180 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 104 [2018-11-28 13:26:06,058 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 119 [2018-11-28 13:26:06,145 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:26:06,145 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:26:06,145 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:26:06,145 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:26:06,145 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:26:06,145 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:26:06,145 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:26:06,146 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:26:06,146 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcat_true-termination.c.i_Iteration3_Lasso [2018-11-28 13:26:06,146 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:26:06,146 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:26:06,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:06,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:06,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:06,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:26:06,583 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 91 [2018-11-28 13:26:06,604 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-11-28 13:26:06,606 INFO L168 Benchmark]: Toolchain (without parser) took 4805.50 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 293.6 MB). Free memory was 956.0 MB in the beginning and 1.2 GB in the end (delta: -269.6 MB). Peak memory consumption was 351.6 MB. Max. memory is 11.5 GB. [2018-11-28 13:26:06,607 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:26:06,607 INFO L168 Benchmark]: CACSL2BoogieTranslator took 402.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-11-28 13:26:06,607 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:26:06,608 INFO L168 Benchmark]: Boogie Preprocessor took 25.90 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-28 13:26:06,608 INFO L168 Benchmark]: RCFGBuilder took 257.65 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: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2018-11-28 13:26:06,608 INFO L168 Benchmark]: BuchiAutomizer took 4080.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 136.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -114.5 MB). Peak memory consumption was 349.9 MB. Max. memory is 11.5 GB. [2018-11-28 13:26:06,611 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 402.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.90 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 257.65 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: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4080.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 136.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -114.5 MB). Peak memory consumption was 349.9 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...