./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4f65d2c3-56c2-45ee-a150-6c0e2b81a99d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4f65d2c3-56c2-45ee-a150-6c0e2b81a99d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4f65d2c3-56c2-45ee-a150-6c0e2b81a99d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4f65d2c3-56c2-45ee-a150-6c0e2b81a99d/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4f65d2c3-56c2-45ee-a150-6c0e2b81a99d/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4f65d2c3-56c2-45ee-a150-6c0e2b81a99d/bin/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 f9e8d57988f982ece26fd7a4aa6d80b7a8ef76d2 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:54:11,318 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:54:11,320 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:54:11,330 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:54:11,331 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:54:11,332 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:54:11,334 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:54:11,335 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:54:11,338 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:54:11,340 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:54:11,342 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:54:11,343 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:54:11,348 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:54:11,351 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:54:11,352 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:54:11,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:54:11,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:54:11,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:54:11,355 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:54:11,359 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:54:11,360 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:54:11,360 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:54:11,361 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:54:11,362 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:54:11,365 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:54:11,366 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:54:11,366 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:54:11,366 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:54:11,367 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:54:11,368 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:54:11,369 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:54:11,370 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:54:11,370 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:54:11,371 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:54:11,372 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:54:11,373 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:54:11,374 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:54:11,374 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:54:11,374 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:54:11,375 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:54:11,375 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:54:11,376 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4f65d2c3-56c2-45ee-a150-6c0e2b81a99d/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:54:11,391 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:54:11,403 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:54:11,404 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:54:11,404 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:54:11,405 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:54:11,405 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:54:11,405 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:54:11,405 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:54:11,405 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:54:11,406 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:54:11,406 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:54:11,406 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:54:11,406 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:54:11,406 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:54:11,406 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:54:11,407 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:54:11,407 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:54:11,407 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:54:11,407 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:54:11,407 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:54:11,407 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:54:11,407 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:54:11,408 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:54:11,408 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:54:11,408 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:54:11,408 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:54:11,408 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:54:11,409 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:54:11,409 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:54:11,409 INFO L138 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_4f65d2c3-56c2-45ee-a150-6c0e2b81a99d/bin/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 -> f9e8d57988f982ece26fd7a4aa6d80b7a8ef76d2 [2019-10-22 08:54:11,444 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:54:11,455 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:54:11,458 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:54:11,460 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:54:11,460 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:54:11,461 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4f65d2c3-56c2-45ee-a150-6c0e2b81a99d/bin/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc2.i [2019-10-22 08:54:11,511 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4f65d2c3-56c2-45ee-a150-6c0e2b81a99d/bin/uautomizer/data/deb3112f3/1d2ab5100d7e4de29cb5ec5c843755bf/FLAG97bbbe30b [2019-10-22 08:54:11,904 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:54:11,905 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4f65d2c3-56c2-45ee-a150-6c0e2b81a99d/sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc2.i [2019-10-22 08:54:11,910 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4f65d2c3-56c2-45ee-a150-6c0e2b81a99d/bin/uautomizer/data/deb3112f3/1d2ab5100d7e4de29cb5ec5c843755bf/FLAG97bbbe30b [2019-10-22 08:54:11,920 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4f65d2c3-56c2-45ee-a150-6c0e2b81a99d/bin/uautomizer/data/deb3112f3/1d2ab5100d7e4de29cb5ec5c843755bf [2019-10-22 08:54:11,922 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:54:11,923 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:54:11,924 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:11,924 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:54:11,927 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:54:11,928 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:11" (1/1) ... [2019-10-22 08:54:11,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@595094b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:11, skipping insertion in model container [2019-10-22 08:54:11,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:11" (1/1) ... [2019-10-22 08:54:11,936 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:54:11,951 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:54:12,203 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:12,215 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:54:12,231 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:12,244 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:54:12,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12 WrapperNode [2019-10-22 08:54:12,245 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:12,246 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:12,246 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:54:12,246 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:54:12,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,261 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,278 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:12,279 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:54:12,279 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:54:12,279 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:54:12,287 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,289 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,289 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,297 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:54:12,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:54:12,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:54:12,299 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:54:12,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f65d2c3-56c2-45ee-a150-6c0e2b81a99d/bin/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 [2019-10-22 08:54:12,355 INFO L130 BoogieDeclarations]: Found specification of procedure rec_strcopy_helper [2019-10-22 08:54:12,355 INFO L138 BoogieDeclarations]: Found implementation of procedure rec_strcopy_helper [2019-10-22 08:54:12,356 INFO L130 BoogieDeclarations]: Found specification of procedure rec_cstrlen [2019-10-22 08:54:12,356 INFO L138 BoogieDeclarations]: Found implementation of procedure rec_cstrlen [2019-10-22 08:54:12,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:54:12,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 08:54:12,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:54:12,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:54:12,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:54:12,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:54:12,548 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:54:12,548 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:54:12,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:12 BoogieIcfgContainer [2019-10-22 08:54:12,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:54:12,550 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:54:12,550 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:54:12,563 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:54:12,564 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:12,564 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:54:11" (1/3) ... [2019-10-22 08:54:12,565 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29086de8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:12, skipping insertion in model container [2019-10-22 08:54:12,565 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:12,565 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (2/3) ... [2019-10-22 08:54:12,566 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29086de8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:12, skipping insertion in model container [2019-10-22 08:54:12,566 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:12,566 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:12" (3/3) ... [2019-10-22 08:54:12,567 INFO L371 chiAutomizerObserver]: Analyzing ICFG rec_strcopy_malloc2.i [2019-10-22 08:54:12,631 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:54:12,631 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:54:12,631 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:54:12,631 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:54:12,632 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:54:12,632 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:54:12,632 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:54:12,632 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:54:12,646 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-10-22 08:54:12,670 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:54:12,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:12,670 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:12,677 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:54:12,678 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:54:12,678 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:54:12,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-10-22 08:54:12,680 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:54:12,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:12,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:12,681 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:54:12,681 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:54:12,688 INFO L791 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length~1, main_~original~0.base, main_~original~0.offset, main_~res~0.base, main_~res~0.offset;main_~length~1 := main_#t~nondet8;havoc main_#t~nondet8; 16#L43true assume main_~length~1 < 1;main_~length~1 := 1; 11#L43-2true build_nondet_String_#in~length := main_~length~1;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length := build_nondet_String_#in~length;call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 20#L12true main_#t~ret9.base, main_#t~ret9.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;main_~original~0.base, main_~original~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset := main_~original~0.base, main_~original~0.offset;havoc rec_strcopy_#res.base, rec_strcopy_#res.offset;havoc rec_strcopy_#t~ret6, rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset, rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~length~0, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset;rec_strcopy_~source.base, rec_strcopy_~source.offset := rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset; 22#L34true call rec_strcopy_#t~ret6 := rec_cstrlen(rec_strcopy_~source.base, rec_strcopy_~source.offset);< 6#rec_cstrlenENTRYtrue [2019-10-22 08:54:12,688 INFO L793 eck$LassoCheckResult]: Loop: 6#rec_cstrlenENTRYtrue ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); 8#L17true assume !(0 == #t~mem2);havoc #t~mem2; 14#L20true call #t~ret3 := rec_cstrlen(~s.base, 1 + ~s.offset);< 6#rec_cstrlenENTRYtrue [2019-10-22 08:54:12,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:12,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1155759803, now seen corresponding path program 1 times [2019-10-22 08:54:12,701 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:12,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135414343] [2019-10-22 08:54:12,701 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:12,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:12,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:12,834 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:12,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:12,835 INFO L82 PathProgramCache]: Analyzing trace with hash 59719, now seen corresponding path program 1 times [2019-10-22 08:54:12,835 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:12,836 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396231486] [2019-10-22 08:54:12,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:12,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:12,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:12,860 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:12,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:12,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1512490931, now seen corresponding path program 1 times [2019-10-22 08:54:12,864 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:12,864 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053276283] [2019-10-22 08:54:12,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:12,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:12,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:13,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:13,046 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053276283] [2019-10-22 08:54:13,046 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:13,047 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 08:54:13,047 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317539729] [2019-10-22 08:54:13,143 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:13,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:54:13,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:54:13,162 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 7 states. [2019-10-22 08:54:13,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:13,297 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-10-22 08:54:13,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:54:13,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 42 transitions. [2019-10-22 08:54:13,302 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:54:13,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 26 states and 29 transitions. [2019-10-22 08:54:13,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-10-22 08:54:13,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-10-22 08:54:13,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 29 transitions. [2019-10-22 08:54:13,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:13,311 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-10-22 08:54:13,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 29 transitions. [2019-10-22 08:54:13,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-10-22 08:54:13,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-22 08:54:13,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-10-22 08:54:13,342 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-10-22 08:54:13,342 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-10-22 08:54:13,342 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:54:13,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2019-10-22 08:54:13,343 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:54:13,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:13,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:13,344 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:54:13,344 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:54:13,344 INFO L791 eck$LassoCheckResult]: Stem: 101#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 98#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length~1, main_~original~0.base, main_~original~0.offset, main_~res~0.base, main_~res~0.offset;main_~length~1 := main_#t~nondet8;havoc main_#t~nondet8; 99#L43 assume !(main_~length~1 < 1); 102#L43-2 build_nondet_String_#in~length := main_~length~1;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length := build_nondet_String_#in~length;call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 106#L12 main_#t~ret9.base, main_#t~ret9.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;main_~original~0.base, main_~original~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset := main_~original~0.base, main_~original~0.offset;havoc rec_strcopy_#res.base, rec_strcopy_#res.offset;havoc rec_strcopy_#t~ret6, rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset, rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~length~0, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset;rec_strcopy_~source.base, rec_strcopy_~source.offset := rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset; 93#L34 call rec_strcopy_#t~ret6 := rec_cstrlen(rec_strcopy_~source.base, rec_strcopy_~source.offset);< 100#rec_cstrlenENTRY [2019-10-22 08:54:13,345 INFO L793 eck$LassoCheckResult]: Loop: 100#rec_cstrlenENTRY ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); 104#L17 assume !(0 == #t~mem2);havoc #t~mem2; 94#L20 call #t~ret3 := rec_cstrlen(~s.base, 1 + ~s.offset);< 100#rec_cstrlenENTRY [2019-10-22 08:54:13,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:13,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1155819385, now seen corresponding path program 1 times [2019-10-22 08:54:13,345 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:13,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502653212] [2019-10-22 08:54:13,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,346 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,367 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:13,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:13,368 INFO L82 PathProgramCache]: Analyzing trace with hash 59719, now seen corresponding path program 2 times [2019-10-22 08:54:13,368 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:13,368 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123198685] [2019-10-22 08:54:13,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,377 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:13,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:13,377 INFO L82 PathProgramCache]: Analyzing trace with hash 262516431, now seen corresponding path program 1 times [2019-10-22 08:54:13,378 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:13,378 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771284031] [2019-10-22 08:54:13,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,423 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:13,659 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-10-22 08:54:13,846 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:13,847 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:13,847 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:13,848 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:13,848 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:13,848 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:13,848 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:13,848 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:13,848 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_strcopy_malloc2.i_Iteration2_Lasso [2019-10-22 08:54:13,848 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:13,849 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:13,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:13,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:13,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:13,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:13,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:13,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:13,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:13,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:13,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:13,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:13,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:13,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:13,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:13,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:13,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:13,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:13,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:13,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:13,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:13,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:13,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:13,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:13,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:13,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:13,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:13,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:14,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:14,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:14,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:14,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:14,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:14,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:14,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:14,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:14,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:14,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:14,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:14,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:14,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:14,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:14,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:14,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:14,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:14,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:14,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:14,282 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:14,290 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:14,292 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:14,294 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:14,295 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:14,297 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:14,297 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:14,297 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:14,299 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:14,299 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:14,301 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:14,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:14,303 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:14,304 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:14,304 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:14,304 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:14,304 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:14,305 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:14,305 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:14,306 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:14,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:14,311 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:14,311 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:14,311 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:14,311 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:14,311 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:14,312 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:14,312 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:14,313 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:14,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:14,314 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:14,314 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:14,314 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:14,314 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:14,314 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:14,315 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:14,315 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:14,316 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:14,317 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:14,318 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:14,319 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:14,319 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:14,319 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:14,319 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:14,320 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:14,320 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:14,321 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:14,323 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:14,324 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:14,325 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:14,325 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:14,325 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:14,325 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:14,326 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:14,328 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:14,329 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:14,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:14,330 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:14,330 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:14,331 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:14,331 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:14,336 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:14,336 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:14,339 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:14,348 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:14,349 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:14,349 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:14,350 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:14,350 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:14,350 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:14,350 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:14,350 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:14,351 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:14,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:14,352 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:14,353 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:14,353 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:14,353 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:14,353 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:14,354 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:14,354 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:14,354 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:14,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:14,363 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:14,363 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:14,363 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:14,363 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:14,363 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:14,364 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:14,364 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:14,365 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:14,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:14,366 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:14,366 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:14,366 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:14,366 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:14,366 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:14,367 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:14,367 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:14,369 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:14,370 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:14,370 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:14,370 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:14,371 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:14,371 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:14,371 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:14,372 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:14,377 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:14,380 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:14,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:14,381 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:14,382 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:14,382 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:14,382 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:14,387 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:14,387 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:14,396 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:14,396 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:14,397 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:14,397 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:14,397 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:14,397 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:14,402 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:14,403 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:14,433 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:14,456 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:54:14,456 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:54:14,458 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:14,464 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:54:14,465 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:14,466 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec_cstrlen_#in~s.offset, v_rep(select #length rec_cstrlen_#in~s.base)_1) = -1*rec_cstrlen_#in~s.offset + 1*v_rep(select #length rec_cstrlen_#in~s.base)_1 Supporting invariants [] [2019-10-22 08:54:14,471 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-10-22 08:54:14,478 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:54:14,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:14,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:54:14,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:14,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 08:54:14,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:14,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:14,554 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:54:14,554 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-10-22 08:54:14,614 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 42 states and 48 transitions. Complement of second has 8 states. [2019-10-22 08:54:14,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:54:14,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:14,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-10-22 08:54:14,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 6 letters. Loop has 3 letters. [2019-10-22 08:54:14,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:14,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2019-10-22 08:54:14,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:14,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 6 letters. Loop has 6 letters. [2019-10-22 08:54:14,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:14,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 48 transitions. [2019-10-22 08:54:14,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:54:14,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 33 states and 39 transitions. [2019-10-22 08:54:14,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-10-22 08:54:14,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-10-22 08:54:14,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2019-10-22 08:54:14,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:14,627 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-10-22 08:54:14,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2019-10-22 08:54:14,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-10-22 08:54:14,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-22 08:54:14,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-10-22 08:54:14,631 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-10-22 08:54:14,631 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-10-22 08:54:14,631 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:54:14,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2019-10-22 08:54:14,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:54:14,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:14,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:14,633 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:14,633 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:54:14,633 INFO L791 eck$LassoCheckResult]: Stem: 224#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 222#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length~1, main_~original~0.base, main_~original~0.offset, main_~res~0.base, main_~res~0.offset;main_~length~1 := main_#t~nondet8;havoc main_#t~nondet8; 223#L43 assume !(main_~length~1 < 1); 225#L43-2 build_nondet_String_#in~length := main_~length~1;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length := build_nondet_String_#in~length;call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 231#L12 main_#t~ret9.base, main_#t~ret9.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;main_~original~0.base, main_~original~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset := main_~original~0.base, main_~original~0.offset;havoc rec_strcopy_#res.base, rec_strcopy_#res.offset;havoc rec_strcopy_#t~ret6, rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset, rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~length~0, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset;rec_strcopy_~source.base, rec_strcopy_~source.offset := rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset; 210#L34 call rec_strcopy_#t~ret6 := rec_cstrlen(rec_strcopy_~source.base, rec_strcopy_~source.offset);< 212#rec_cstrlenENTRY ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); 214#L17 assume 0 == #t~mem2;havoc #t~mem2;#res := 0; 209#rec_cstrlenFINAL assume true; 211#rec_cstrlenEXIT >#41#return; 226#L34-1 rec_strcopy_~length~0 := rec_strcopy_#t~ret6;havoc rec_strcopy_#t~ret6;call rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset := #Ultimate.allocOnHeap(1 + rec_strcopy_~length~0);rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset := rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset; 206#L36 call rec_strcopy_helper(rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset);< 207#rec_strcopy_helperENTRY [2019-10-22 08:54:14,634 INFO L793 eck$LassoCheckResult]: Loop: 207#rec_strcopy_helperENTRY ~source.base, ~source.offset := #in~source.base, #in~source.offset;~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;call #t~mem4 := read~int(~source.base, ~source.offset, 1);call write~int(#t~mem4, ~dest.base, ~dest.offset, 1);havoc #t~mem4;call #t~mem5 := read~int(~source.base, ~source.offset, 1); 208#L28 assume 0 != #t~mem5;havoc #t~mem5; 205#L29 call rec_strcopy_helper(~source.base, 1 + ~source.offset, ~dest.base, 1 + ~dest.offset);< 207#rec_strcopy_helperENTRY [2019-10-22 08:54:14,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:14,634 INFO L82 PathProgramCache]: Analyzing trace with hash -509542028, now seen corresponding path program 1 times [2019-10-22 08:54:14,634 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:14,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998810476] [2019-10-22 08:54:14,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:14,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:14,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:14,664 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:14,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:14,665 INFO L82 PathProgramCache]: Analyzing trace with hash 29922, now seen corresponding path program 1 times [2019-10-22 08:54:14,665 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:14,665 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985150580] [2019-10-22 08:54:14,665 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:14,665 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:14,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:14,679 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:14,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:14,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1352131953, now seen corresponding path program 1 times [2019-10-22 08:54:14,680 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:14,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820942358] [2019-10-22 08:54:14,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:14,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:14,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:14,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:14,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820942358] [2019-10-22 08:54:14,799 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:14,799 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-22 08:54:14,799 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258771289] [2019-10-22 08:54:15,005 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:15,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 08:54:15,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:54:15,005 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. cyclomatic complexity: 6 Second operand 10 states. [2019-10-22 08:54:15,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:15,132 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-10-22 08:54:15,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 08:54:15,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 38 transitions. [2019-10-22 08:54:15,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:54:15,135 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 21 states and 23 transitions. [2019-10-22 08:54:15,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-10-22 08:54:15,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-10-22 08:54:15,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2019-10-22 08:54:15,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:15,136 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-10-22 08:54:15,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2019-10-22 08:54:15,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-22 08:54:15,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-22 08:54:15,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-10-22 08:54:15,138 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-10-22 08:54:15,138 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-10-22 08:54:15,138 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:54:15,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2019-10-22 08:54:15,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:54:15,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:15,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:15,140 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:15,140 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:54:15,140 INFO L791 eck$LassoCheckResult]: Stem: 316#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 314#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length~1, main_~original~0.base, main_~original~0.offset, main_~res~0.base, main_~res~0.offset;main_~length~1 := main_#t~nondet8;havoc main_#t~nondet8; 315#L43 assume !(main_~length~1 < 1); 312#L43-2 build_nondet_String_#in~length := main_~length~1;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length := build_nondet_String_#in~length;call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 313#L12 main_#t~ret9.base, main_#t~ret9.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;main_~original~0.base, main_~original~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset := main_~original~0.base, main_~original~0.offset;havoc rec_strcopy_#res.base, rec_strcopy_#res.offset;havoc rec_strcopy_#t~ret6, rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset, rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~length~0, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset;rec_strcopy_~source.base, rec_strcopy_~source.offset := rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset; 306#L34 call rec_strcopy_#t~ret6 := rec_cstrlen(rec_strcopy_~source.base, rec_strcopy_~source.offset);< 305#rec_cstrlenENTRY ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); 307#L17 assume !(0 == #t~mem2);havoc #t~mem2; 303#L20 call #t~ret3 := rec_cstrlen(~s.base, 1 + ~s.offset);< 308#rec_cstrlenENTRY ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); 309#L17 assume 0 == #t~mem2;havoc #t~mem2;#res := 0; 302#rec_cstrlenFINAL assume true; 304#rec_cstrlenEXIT >#45#return; 310#L20-1 #res := 1 + #t~ret3;havoc #t~ret3; 311#rec_cstrlenFINAL assume true; 318#rec_cstrlenEXIT >#41#return; 317#L34-1 rec_strcopy_~length~0 := rec_strcopy_#t~ret6;havoc rec_strcopy_#t~ret6;call rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset := #Ultimate.allocOnHeap(1 + rec_strcopy_~length~0);rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset := rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset; 299#L36 call rec_strcopy_helper(rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset);< 300#rec_strcopy_helperENTRY [2019-10-22 08:54:15,141 INFO L793 eck$LassoCheckResult]: Loop: 300#rec_strcopy_helperENTRY ~source.base, ~source.offset := #in~source.base, #in~source.offset;~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;call #t~mem4 := read~int(~source.base, ~source.offset, 1);call write~int(#t~mem4, ~dest.base, ~dest.offset, 1);havoc #t~mem4;call #t~mem5 := read~int(~source.base, ~source.offset, 1); 301#L28 assume 0 != #t~mem5;havoc #t~mem5; 298#L29 call rec_strcopy_helper(~source.base, 1 + ~source.offset, ~dest.base, 1 + ~dest.offset);< 300#rec_strcopy_helperENTRY [2019-10-22 08:54:15,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:15,141 INFO L82 PathProgramCache]: Analyzing trace with hash -462834206, now seen corresponding path program 1 times [2019-10-22 08:54:15,141 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:15,141 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368567913] [2019-10-22 08:54:15,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:15,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:15,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:15,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:15,169 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:15,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:15,169 INFO L82 PathProgramCache]: Analyzing trace with hash 29922, now seen corresponding path program 2 times [2019-10-22 08:54:15,170 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:15,170 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585974930] [2019-10-22 08:54:15,170 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:15,170 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:15,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:15,179 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:15,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:15,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1448810655, now seen corresponding path program 1 times [2019-10-22 08:54:15,180 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:15,180 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862744782] [2019-10-22 08:54:15,180 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:15,180 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:15,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:15,221 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:15,903 WARN L191 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 117 [2019-10-22 08:54:16,011 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-10-22 08:54:16,122 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-10-22 08:54:16,188 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:16,188 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:16,188 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:16,188 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:16,188 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:16,188 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:16,189 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:16,189 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:16,189 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_strcopy_malloc2.i_Iteration4_Lasso [2019-10-22 08:54:16,189 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:16,189 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:16,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:16,704 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:16,704 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:16,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,705 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,705 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:16,705 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,706 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,706 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,706 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:16,706 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:16,707 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,707 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,708 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,708 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:16,708 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,709 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,709 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,709 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:16,709 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:16,710 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,710 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,711 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,711 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:16,711 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,712 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,712 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,712 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:16,712 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:16,713 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,713 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,714 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,714 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:16,714 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,715 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,715 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,715 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:16,715 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:16,716 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,716 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,717 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,717 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:16,717 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,717 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,718 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,718 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:16,718 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:16,719 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,719 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,720 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,720 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:16,720 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,721 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,721 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,721 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:16,721 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:16,722 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,723 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,723 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:16,724 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,724 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,724 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,724 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:16,725 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:16,725 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,726 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,727 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,727 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:16,727 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,727 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,727 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,728 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:16,728 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:16,729 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,730 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,730 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:16,730 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,730 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,730 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,731 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:16,731 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:16,732 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,732 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,733 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,733 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:16,733 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,733 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,733 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,734 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:16,734 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:16,734 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,736 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,736 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:16,736 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,736 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,736 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,737 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:16,737 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:16,737 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,738 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,738 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:16,739 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,739 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,739 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,740 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:16,740 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:16,741 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,741 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,741 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,742 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:16,742 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,742 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,742 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,742 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:16,743 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:16,743 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,744 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,745 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,745 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,745 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,746 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:16,746 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:16,748 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,749 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,750 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:16,750 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,750 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,750 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,750 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:16,750 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:16,751 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,752 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,752 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,753 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:16,753 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,753 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,753 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,753 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:16,754 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:16,754 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,755 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,755 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:16,756 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,756 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,756 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,756 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:16,756 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:16,757 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,758 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,758 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:16,758 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,758 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,759 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,759 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:16,759 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:16,760 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,761 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,761 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:16,761 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,762 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,762 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,762 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:16,762 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:16,763 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,764 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,764 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:16,764 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,764 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,764 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,765 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:16,765 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:16,766 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,766 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,766 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,767 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:16,767 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,767 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,767 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,768 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:16,768 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:16,768 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,769 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,770 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:16,770 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,770 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,770 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,770 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:16,770 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:16,771 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,772 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,772 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,773 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:16,773 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,773 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,773 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,773 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:16,773 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:16,774 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,774 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,775 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,775 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:16,775 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,776 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,776 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,776 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:16,776 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:16,777 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,778 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,778 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:16,778 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,778 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,778 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,778 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:16,779 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:16,780 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,780 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,781 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,781 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:54:16,781 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,781 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,783 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:54:16,783 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:16,793 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,794 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,794 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,794 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:16,794 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,798 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-10-22 08:54:16,798 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-10-22 08:54:16,812 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:16,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:16,813 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:16,813 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:16,813 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:16,813 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:16,816 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:16,816 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:16,831 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:16,873 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:54:16,873 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:54:16,874 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:16,875 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:54:16,875 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:16,875 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length rec_strcopy_helper_#in~source.base)_1, rec_strcopy_helper_#in~dest.offset) = 1*v_rep(select #length rec_strcopy_helper_#in~source.base)_1 - 1*rec_strcopy_helper_#in~dest.offset Supporting invariants [] [2019-10-22 08:54:16,890 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2019-10-22 08:54:16,892 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:54:16,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:16,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-22 08:54:16,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:16,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:54:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:17,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-22 08:54:17,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:17,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:17,066 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2019-10-22 08:54:17,066 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 4 Second operand 7 states. [2019-10-22 08:54:17,211 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 4. Second operand 7 states. Result 33 states and 36 transitions. Complement of second has 12 states. [2019-10-22 08:54:17,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 5 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:54:17,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 08:54:17,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2019-10-22 08:54:17,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 18 letters. Loop has 3 letters. [2019-10-22 08:54:17,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:17,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 21 letters. Loop has 3 letters. [2019-10-22 08:54:17,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:17,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 18 letters. Loop has 6 letters. [2019-10-22 08:54:17,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:17,214 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. [2019-10-22 08:54:17,215 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:54:17,215 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 0 states and 0 transitions. [2019-10-22 08:54:17,215 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:54:17,215 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:54:17,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:54:17,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:17,216 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:17,216 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:17,216 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:17,216 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:54:17,218 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:54:17,218 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:54:17,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:54:17,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:54:17 BoogieIcfgContainer [2019-10-22 08:54:17,224 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:54:17,224 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:54:17,224 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:54:17,225 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:54:17,225 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:12" (3/4) ... [2019-10-22 08:54:17,229 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:54:17,229 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:54:17,230 INFO L168 Benchmark]: Toolchain (without parser) took 5307.26 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 305.7 MB). Free memory was 951.2 MB in the beginning and 1.2 GB in the end (delta: -280.3 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:17,231 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:17,232 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 951.2 MB in the beginning and 1.2 GB in the end (delta: -210.9 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:17,232 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:17,232 INFO L168 Benchmark]: Boogie Preprocessor took 20.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:17,233 INFO L168 Benchmark]: RCFGBuilder took 250.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 29.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:17,233 INFO L168 Benchmark]: BuchiAutomizer took 4673.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 135.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -98.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:17,234 INFO L168 Benchmark]: Witness Printer took 4.83 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:17,236 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 321.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 951.2 MB in the beginning and 1.2 GB in the end (delta: -210.9 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 250.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 29.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4673.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 135.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -98.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.83 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[source] + -1 * dest and consists of 7 locations. 2 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.6s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 3.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 75 SDtfs, 42 SDslu, 237 SDs, 0 SdLazy, 151 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital149 mio100 ax100 hnf100 lsp95 ukn58 mio100 lsp49 div100 bol100 ite100 ukn100 eq181 hnf79 smp100 dnf101 smp98 tf100 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...