./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strcat_short.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_1807d737-6549-49cb-991b-1b1b536e14ef/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1807d737-6549-49cb-991b-1b1b536e14ef/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1807d737-6549-49cb-991b-1b1b536e14ef/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1807d737-6549-49cb-991b-1b1b536e14ef/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strcat_short.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1807d737-6549-49cb-991b-1b1b536e14ef/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1807d737-6549-49cb-991b-1b1b536e14ef/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 2cfe214f4978682dac68f5565e20ebc7c152d196 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:59:32,956 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:59:32,957 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:59:32,970 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:59:32,970 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:59:32,971 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:59:32,972 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:59:32,973 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:59:32,975 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:59:32,975 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:59:32,978 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:59:32,978 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:59:32,979 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:59:32,979 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:59:32,980 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:59:32,981 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:59:32,981 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:59:32,982 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:59:32,983 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:59:32,991 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:59:32,992 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:59:32,993 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:59:32,994 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:59:32,994 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:59:33,000 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:59:33,000 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:59:33,000 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:59:33,001 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:59:33,001 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:59:33,002 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:59:33,002 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:59:33,003 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:59:33,003 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:59:33,005 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:59:33,006 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:59:33,006 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:59:33,006 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:59:33,007 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:59:33,007 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:59:33,007 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:59:33,008 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:59:33,008 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1807d737-6549-49cb-991b-1b1b536e14ef/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:59:33,031 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:59:33,032 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:59:33,033 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:59:33,033 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:59:33,033 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:59:33,033 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:59:33,033 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:59:33,034 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:59:33,034 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:59:33,034 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:59:33,034 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:59:33,034 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:59:33,034 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:59:33,035 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:59:33,035 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:59:33,035 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:59:33,035 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:59:33,035 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:59:33,035 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:59:33,037 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:59:33,037 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:59:33,037 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:59:33,038 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:59:33,038 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:59:33,038 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:59:33,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:59:33,038 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:59:33,039 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:59:33,039 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:59:33,040 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_1807d737-6549-49cb-991b-1b1b536e14ef/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 -> 2cfe214f4978682dac68f5565e20ebc7c152d196 [2019-10-22 08:59:33,070 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:59:33,079 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:59:33,082 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:59:33,083 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:59:33,084 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:59:33,085 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1807d737-6549-49cb-991b-1b1b536e14ef/bin/uautomizer/../../sv-benchmarks/c/termination-libowfat/strcat_short.i [2019-10-22 08:59:33,132 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1807d737-6549-49cb-991b-1b1b536e14ef/bin/uautomizer/data/7d1f02cec/0e1e7a1fe22a4a38a42744c6bb64af02/FLAG664b9bba3 [2019-10-22 08:59:33,555 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:59:33,556 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1807d737-6549-49cb-991b-1b1b536e14ef/sv-benchmarks/c/termination-libowfat/strcat_short.i [2019-10-22 08:59:33,564 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1807d737-6549-49cb-991b-1b1b536e14ef/bin/uautomizer/data/7d1f02cec/0e1e7a1fe22a4a38a42744c6bb64af02/FLAG664b9bba3 [2019-10-22 08:59:33,914 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1807d737-6549-49cb-991b-1b1b536e14ef/bin/uautomizer/data/7d1f02cec/0e1e7a1fe22a4a38a42744c6bb64af02 [2019-10-22 08:59:33,916 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:59:33,917 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:59:33,918 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:33,918 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:59:33,920 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:59:33,921 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:33" (1/1) ... [2019-10-22 08:59:33,923 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d11e977 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:33, skipping insertion in model container [2019-10-22 08:59:33,923 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:33" (1/1) ... [2019-10-22 08:59:33,930 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:59:33,961 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:59:34,303 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:34,312 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:59:34,350 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:34,401 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:59:34,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:34 WrapperNode [2019-10-22 08:59:34,401 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:34,402 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:34,402 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:59:34,402 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:59:34,409 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:59:34" (1/1) ... [2019-10-22 08:59:34,421 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:59:34" (1/1) ... [2019-10-22 08:59:34,441 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:34,442 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:59:34,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:59:34,442 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:59:34,450 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:34" (1/1) ... [2019-10-22 08:59:34,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:34" (1/1) ... [2019-10-22 08:59:34,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:34" (1/1) ... [2019-10-22 08:59:34,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:34" (1/1) ... [2019-10-22 08:59:34,463 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:34" (1/1) ... [2019-10-22 08:59:34,467 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:34" (1/1) ... [2019-10-22 08:59:34,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:34" (1/1) ... [2019-10-22 08:59:34,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:59:34,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:59:34,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:59:34,471 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:59:34,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1807d737-6549-49cb-991b-1b1b536e14ef/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:59:34,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:59:34,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:59:34,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:59:34,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:59:34,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:59:34,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:59:34,867 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:59:34,867 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-22 08:59:34,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:34 BoogieIcfgContainer [2019-10-22 08:59:34,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:59:34,869 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:59:34,869 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:59:34,873 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:59:34,873 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:34,874 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:59:33" (1/3) ... [2019-10-22 08:59:34,874 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5abe43ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:34, skipping insertion in model container [2019-10-22 08:59:34,875 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:34,875 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:34" (2/3) ... [2019-10-22 08:59:34,875 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5abe43ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:34, skipping insertion in model container [2019-10-22 08:59:34,875 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:34,875 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:34" (3/3) ... [2019-10-22 08:59:34,878 INFO L371 chiAutomizerObserver]: Analyzing ICFG strcat_short.i [2019-10-22 08:59:34,929 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:59:34,929 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:59:34,930 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:59:34,930 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:59:34,930 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:59:34,930 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:59:34,930 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:59:34,930 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:59:34,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 08:59:34,968 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-10-22 08:59:34,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:34,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:34,976 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:59:34,976 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:59:34,976 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:59:34,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 08:59:34,977 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-10-22 08:59:34,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:34,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:34,978 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:59:34,978 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:59:34,985 INFO L791 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out_end~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 7#L523true assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 20#L527true assume !(main_~out_len~0 < 1);main_~out_end~0 := main_#t~nondet12;havoc main_#t~nondet12; 16#L529true assume !(main_~out_len~0 < main_~out_end~0 + main_~in_len~0);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + main_~out_end~0, 1);strcat_#in~s.base, strcat_#in~s.offset, strcat_#in~t.base, strcat_#in~t.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcat_#res.base, strcat_#res.offset;havoc strcat_#t~ret5, strcat_#t~mem6, strcat_#t~pre7.base, strcat_#t~pre7.offset, strcat_#t~pre8.base, strcat_#t~pre8.offset, strcat_~s.base, strcat_~s.offset, strcat_~t.base, strcat_~t.offset, strcat_~dest~0.base, strcat_~dest~0.offset;strcat_~s.base, strcat_~s.offset := strcat_#in~s.base, strcat_#in~s.offset;strcat_~t.base, strcat_~t.offset := strcat_#in~t.base, strcat_#in~t.offset;strcat_~dest~0.base, strcat_~dest~0.offset := strcat_~s.base, strcat_~s.offset;strlen_#in~s.base, strlen_#in~s.offset := strcat_~s.base, strcat_~s.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 14#L508true assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 3#L509-4true [2019-10-22 08:59:34,985 INFO L793 eck$LassoCheckResult]: Loop: 3#L509-4true call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 15#L509-1true assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 19#L509-3true strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 3#L509-4true [2019-10-22 08:59:34,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:34,991 INFO L82 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2019-10-22 08:59:34,998 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:34,999 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509479917] [2019-10-22 08:59:34,999 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:34,999 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:34,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:35,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:35,142 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:35,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:35,143 INFO L82 PathProgramCache]: Analyzing trace with hash 55771, now seen corresponding path program 1 times [2019-10-22 08:59:35,143 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:35,143 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324995069] [2019-10-22 08:59:35,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:35,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:35,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:35,155 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:35,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:35,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1271629391, now seen corresponding path program 1 times [2019-10-22 08:59:35,157 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:35,157 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384043486] [2019-10-22 08:59:35,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:35,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:35,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:35,213 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:35,678 WARN L191 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 108 [2019-10-22 08:59:35,814 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-10-22 08:59:35,824 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:35,825 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:35,825 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:35,825 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:35,825 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:35,826 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:35,826 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:35,826 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:35,826 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcat_short.i_Iteration1_Lasso [2019-10-22 08:59:35,826 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:35,826 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:35,849 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:59:35,854 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:59:35,856 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:59:35,860 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:59:35,862 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:59:35,864 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:59:35,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:59:36,163 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-10-22 08:59:36,234 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:59:36,241 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:59:36,244 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:59:36,246 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:59:36,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:59:36,253 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:59:36,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:59:36,262 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:59:36,265 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:59:36,267 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:59:36,270 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:59:36,272 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:59:36,274 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:59:36,276 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:59:36,278 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:59:36,280 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:59:36,962 WARN L191 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-10-22 08:59:37,105 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:37,109 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:37,111 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:59:37,113 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:37,113 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:37,114 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:37,114 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:37,114 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:37,116 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:37,116 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:37,118 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:37,118 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:59:37,119 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:37,119 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:37,119 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:37,119 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:37,119 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:37,120 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:37,120 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:37,120 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:37,121 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:59:37,121 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:37,121 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:37,122 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:37,122 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:37,128 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:37,128 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:37,131 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:37,131 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:59:37,136 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:37,136 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:37,137 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:37,137 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:37,137 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:37,137 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:37,137 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:37,138 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:37,138 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:59:37,139 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:37,139 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:37,139 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:37,139 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:37,139 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:37,140 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:37,140 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:37,141 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:37,141 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:59:37,142 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:37,142 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:37,142 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:37,142 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:37,142 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:37,143 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:37,143 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:37,143 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:37,152 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:59:37,153 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:37,153 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:37,153 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:37,153 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:37,154 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:37,154 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:37,160 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:37,160 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:59:37,161 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:37,161 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:59:37,161 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:37,161 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:37,181 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:59:37,182 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:37,255 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:37,256 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:59:37,261 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:37,261 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:37,262 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:37,262 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:37,263 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:37,263 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:37,266 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:37,274 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:59:37,275 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:37,275 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:37,276 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:37,276 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:37,277 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:37,277 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:37,279 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:37,279 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:59:37,282 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:37,282 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:37,283 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:37,283 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:37,284 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:37,284 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:37,286 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:37,287 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:59:37,287 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:37,287 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:37,300 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:37,300 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:59:37,300 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:37,301 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:59:37,301 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:37,303 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:37,304 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:59:37,305 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:37,305 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:37,305 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:37,305 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:37,317 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:37,317 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:37,385 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:37,443 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 08:59:37,443 INFO L444 ModelExtractionUtils]: 50 out of 55 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:59:37,445 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:37,447 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:37,448 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:37,449 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlen_~s.offset, v_rep(select #length ULTIMATE.start_strlen_~s.base)_1) = -1*ULTIMATE.start_strlen_~s.offset + 1*v_rep(select #length ULTIMATE.start_strlen_~s.base)_1 Supporting invariants [] [2019-10-22 08:59:37,477 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-10-22 08:59:37,486 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:59:37,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:37,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:37,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:37,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:37,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:59:37,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:37,566 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:59:37,581 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:59:37,582 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2019-10-22 08:59:37,627 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 48 states and 63 transitions. Complement of second has 5 states. [2019-10-22 08:59:37,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:37,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:59:37,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2019-10-22 08:59:37,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 6 letters. Loop has 3 letters. [2019-10-22 08:59:37,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:37,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 9 letters. Loop has 3 letters. [2019-10-22 08:59:37,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:37,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 6 letters. Loop has 6 letters. [2019-10-22 08:59:37,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:37,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 63 transitions. [2019-10-22 08:59:37,641 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 08:59:37,646 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 18 states and 21 transitions. [2019-10-22 08:59:37,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-10-22 08:59:37,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-10-22 08:59:37,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-10-22 08:59:37,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:37,650 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-10-22 08:59:37,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-10-22 08:59:37,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2019-10-22 08:59:37,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-22 08:59:37,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-10-22 08:59:37,676 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-10-22 08:59:37,676 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-10-22 08:59:37,676 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:59:37,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2019-10-22 08:59:37,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:59:37,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:37,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:37,679 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:37,679 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:59:37,679 INFO L791 eck$LassoCheckResult]: Stem: 164#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 163#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out_end~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 161#L523 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 162#L527 assume !(main_~out_len~0 < 1);main_~out_end~0 := main_#t~nondet12;havoc main_#t~nondet12; 167#L529 assume !(main_~out_len~0 < main_~out_end~0 + main_~in_len~0);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + main_~out_end~0, 1);strcat_#in~s.base, strcat_#in~s.offset, strcat_#in~t.base, strcat_#in~t.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcat_#res.base, strcat_#res.offset;havoc strcat_#t~ret5, strcat_#t~mem6, strcat_#t~pre7.base, strcat_#t~pre7.offset, strcat_#t~pre8.base, strcat_#t~pre8.offset, strcat_~s.base, strcat_~s.offset, strcat_~t.base, strcat_~t.offset, strcat_~dest~0.base, strcat_~dest~0.offset;strcat_~s.base, strcat_~s.offset := strcat_#in~s.base, strcat_#in~s.offset;strcat_~t.base, strcat_~t.offset := strcat_#in~t.base, strcat_#in~t.offset;strcat_~dest~0.base, strcat_~dest~0.offset := strcat_~s.base, strcat_~s.offset;strlen_#in~s.base, strlen_#in~s.offset := strcat_~s.base, strcat_~s.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 165#L508 assume strlen_~s.base == 0 && strlen_~s.offset == 0;strlen_#res := 0; 158#L510 strcat_#t~ret5 := strlen_#res;strcat_~s.base, strcat_~s.offset := strcat_~s.base, strcat_~s.offset + strcat_#t~ret5 % 4294967296;havoc strcat_#t~ret5; 159#L516-2 [2019-10-22 08:59:37,679 INFO L793 eck$LassoCheckResult]: Loop: 159#L516-2 assume !false;call strcat_#t~mem6 := read~int(strcat_~t.base, strcat_~t.offset, 1);call write~int(strcat_#t~mem6, strcat_~s.base, strcat_~s.offset, 1); 160#L517 assume !(0 == strcat_#t~mem6);havoc strcat_#t~mem6;strcat_#t~pre7.base, strcat_#t~pre7.offset := strcat_~s.base, 1 + strcat_~s.offset;strcat_~s.base, strcat_~s.offset := strcat_~s.base, 1 + strcat_~s.offset;havoc strcat_#t~pre7.base, strcat_#t~pre7.offset;strcat_#t~pre8.base, strcat_#t~pre8.offset := strcat_~t.base, 1 + strcat_~t.offset;strcat_~t.base, strcat_~t.offset := strcat_~t.base, 1 + strcat_~t.offset;havoc strcat_#t~pre8.base, strcat_#t~pre8.offset; 159#L516-2 [2019-10-22 08:59:37,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:37,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907772, now seen corresponding path program 1 times [2019-10-22 08:59:37,680 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:37,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922911097] [2019-10-22 08:59:37,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:37,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:37,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:37,742 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:59:37,742 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922911097] [2019-10-22 08:59:37,743 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:37,743 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:59:37,743 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976011307] [2019-10-22 08:59:37,745 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:59:37,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:37,746 INFO L82 PathProgramCache]: Analyzing trace with hash 2470, now seen corresponding path program 1 times [2019-10-22 08:59:37,746 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:37,746 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677809574] [2019-10-22 08:59:37,746 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:37,746 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:37,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:37,761 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:37,826 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:37,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:59:37,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:59:37,830 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-10-22 08:59:37,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:37,850 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-10-22 08:59:37,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:59:37,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2019-10-22 08:59:37,852 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:59:37,852 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 17 transitions. [2019-10-22 08:59:37,852 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 08:59:37,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 08:59:37,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2019-10-22 08:59:37,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:37,853 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-10-22 08:59:37,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2019-10-22 08:59:37,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-10-22 08:59:37,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-22 08:59:37,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-10-22 08:59:37,854 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-10-22 08:59:37,854 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-10-22 08:59:37,854 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:59:37,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2019-10-22 08:59:37,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:59:37,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:37,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:37,855 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:37,856 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:59:37,856 INFO L791 eck$LassoCheckResult]: Stem: 203#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 202#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out_end~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 200#L523 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 201#L527 assume !(main_~out_len~0 < 1);main_~out_end~0 := main_#t~nondet12;havoc main_#t~nondet12; 206#L529 assume !(main_~out_len~0 < main_~out_end~0 + main_~in_len~0);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + main_~out_end~0, 1);strcat_#in~s.base, strcat_#in~s.offset, strcat_#in~t.base, strcat_#in~t.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcat_#res.base, strcat_#res.offset;havoc strcat_#t~ret5, strcat_#t~mem6, strcat_#t~pre7.base, strcat_#t~pre7.offset, strcat_#t~pre8.base, strcat_#t~pre8.offset, strcat_~s.base, strcat_~s.offset, strcat_~t.base, strcat_~t.offset, strcat_~dest~0.base, strcat_~dest~0.offset;strcat_~s.base, strcat_~s.offset := strcat_#in~s.base, strcat_#in~s.offset;strcat_~t.base, strcat_~t.offset := strcat_#in~t.base, strcat_#in~t.offset;strcat_~dest~0.base, strcat_~dest~0.offset := strcat_~s.base, strcat_~s.offset;strlen_#in~s.base, strlen_#in~s.offset := strcat_~s.base, strcat_~s.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 204#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 192#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 194#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 196#L509-5 strlen_#res := strlen_~i~0; 197#L510 strcat_#t~ret5 := strlen_#res;strcat_~s.base, strcat_~s.offset := strcat_~s.base, strcat_~s.offset + strcat_#t~ret5 % 4294967296;havoc strcat_#t~ret5; 198#L516-2 [2019-10-22 08:59:37,856 INFO L793 eck$LassoCheckResult]: Loop: 198#L516-2 assume !false;call strcat_#t~mem6 := read~int(strcat_~t.base, strcat_~t.offset, 1);call write~int(strcat_#t~mem6, strcat_~s.base, strcat_~s.offset, 1); 199#L517 assume !(0 == strcat_#t~mem6);havoc strcat_#t~mem6;strcat_#t~pre7.base, strcat_#t~pre7.offset := strcat_~s.base, 1 + strcat_~s.offset;strcat_~s.base, strcat_~s.offset := strcat_~s.base, 1 + strcat_~s.offset;havoc strcat_#t~pre7.base, strcat_#t~pre7.offset;strcat_#t~pre8.base, strcat_#t~pre8.offset := strcat_~t.base, 1 + strcat_~t.offset;strcat_~t.base, strcat_~t.offset := strcat_~t.base, 1 + strcat_~t.offset;havoc strcat_#t~pre8.base, strcat_#t~pre8.offset; 198#L516-2 [2019-10-22 08:59:37,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:37,857 INFO L82 PathProgramCache]: Analyzing trace with hash 765803698, now seen corresponding path program 1 times [2019-10-22 08:59:37,857 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:37,857 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969531497] [2019-10-22 08:59:37,857 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:37,857 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:37,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:37,902 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:37,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:37,906 INFO L82 PathProgramCache]: Analyzing trace with hash 2470, now seen corresponding path program 2 times [2019-10-22 08:59:37,906 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:37,906 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698163703] [2019-10-22 08:59:37,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:37,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:37,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:37,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:37,918 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:37,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:37,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1497947671, now seen corresponding path program 1 times [2019-10-22 08:59:37,920 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:37,920 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185717414] [2019-10-22 08:59:37,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:37,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:37,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:37,954 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:38,383 WARN L191 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 122 [2019-10-22 08:59:38,485 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:38,485 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:38,485 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:38,485 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:38,486 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:38,486 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:38,486 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:38,486 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:38,486 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcat_short.i_Iteration3_Lasso [2019-10-22 08:59:38,486 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:38,486 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:38,492 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:59:38,497 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:59:38,498 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:59:38,500 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:59:38,502 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:59:38,503 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:59:38,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:38,506 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:59:38,517 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:59:38,519 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:59:38,520 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:59:38,522 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:59:38,524 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:59:38,526 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:59:38,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:38,529 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:59:38,531 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:59:38,532 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:59:38,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:38,535 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:59:38,869 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2019-10-22 08:59:39,009 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-10-22 08:59:39,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:59:39,648 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-10-22 08:59:39,700 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:39,701 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:39,701 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:59:39,701 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,702 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,702 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,702 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,702 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,702 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,702 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,703 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,703 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:59:39,704 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,704 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,704 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,704 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,704 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,705 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,705 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,705 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,706 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:59:39,706 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,706 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,706 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,706 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,706 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,707 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,707 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,707 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,708 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:59:39,708 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,708 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,709 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,709 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,709 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,709 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,709 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,710 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,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:59:39,710 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,710 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,711 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,711 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,711 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,711 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,711 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,712 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,712 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:59:39,713 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,713 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,713 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,713 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,714 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:39,714 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:39,715 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,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:59:39,716 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,716 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,717 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,717 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,717 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,717 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,717 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,718 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,718 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:59:39,718 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,718 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,719 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,719 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,719 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,719 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,719 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,720 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,720 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:59:39,721 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,721 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,721 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,721 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,721 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,722 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,722 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,722 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,723 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:59:39,723 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,723 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,723 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,723 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,723 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,724 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,724 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,725 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,725 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:59:39,725 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,725 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,726 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,726 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,726 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,726 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,726 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,726 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,727 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:59:39,727 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,727 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,727 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,727 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,729 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:39,729 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:39,730 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,730 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:59:39,731 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,731 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,731 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,731 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,731 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,731 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,732 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,732 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,733 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:59:39,733 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,733 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,733 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,733 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,733 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,734 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,734 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,734 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,734 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:59:39,735 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,735 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,735 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,735 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,736 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,736 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,736 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,736 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,737 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:59:39,737 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,737 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,737 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,737 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,737 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,738 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,738 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,738 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,739 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:59:39,739 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,739 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,739 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,739 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,739 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,740 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,740 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,741 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,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:59:39,741 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,741 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,742 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,742 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,742 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,742 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,742 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,743 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,743 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:59:39,743 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,743 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,744 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,744 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,744 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,744 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,744 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,745 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,745 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:59:39,746 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,746 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,746 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,746 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,747 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:39,747 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:39,753 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,753 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:59:39,753 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,754 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,754 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,754 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,755 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:39,755 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:39,760 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,760 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:59:39,761 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,761 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,761 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,761 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,765 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:39,765 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:39,822 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:39,901 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:59:39,901 INFO L444 ModelExtractionUtils]: 48 out of 55 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:59:39,901 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:39,902 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:39,902 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:39,902 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcat_~t.offset, v_rep(select #length ULTIMATE.start_strcat_~t.base)_1) = -1*ULTIMATE.start_strcat_~t.offset + 1*v_rep(select #length ULTIMATE.start_strcat_~t.base)_1 Supporting invariants [] [2019-10-22 08:59:39,958 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2019-10-22 08:59:39,959 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:59:39,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:39,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:39,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:39,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:59:39,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:40,014 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:59:40,014 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:59:40,014 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-10-22 08:59:40,022 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 17 states and 20 transitions. Complement of second has 4 states. [2019-10-22 08:59:40,023 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:59:40,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:59:40,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-10-22 08:59:40,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2019-10-22 08:59:40,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:40,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2019-10-22 08:59:40,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:40,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2019-10-22 08:59:40,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:40,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2019-10-22 08:59:40,024 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:59:40,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 0 states and 0 transitions. [2019-10-22 08:59:40,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:59:40,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:59:40,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:59:40,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:40,025 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:40,025 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:40,025 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:40,025 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:59:40,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:59:40,025 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:59:40,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:59:40,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:59:40 BoogieIcfgContainer [2019-10-22 08:59:40,038 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:59:40,039 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:59:40,039 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:59:40,039 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:59:40,039 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:34" (3/4) ... [2019-10-22 08:59:40,042 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:59:40,043 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:59:40,044 INFO L168 Benchmark]: Toolchain (without parser) took 6126.53 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 338.2 MB). Free memory was 944.7 MB in the beginning and 1.0 GB in the end (delta: -82.1 MB). Peak memory consumption was 256.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:40,044 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:40,045 INFO L168 Benchmark]: CACSL2BoogieTranslator took 483.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -192.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:40,045 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:40,045 INFO L168 Benchmark]: Boogie Preprocessor took 28.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:40,046 INFO L168 Benchmark]: RCFGBuilder took 397.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:40,046 INFO L168 Benchmark]: BuchiAutomizer took 5169.58 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 73.6 MB). Peak memory consumption was 258.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:40,046 INFO L168 Benchmark]: Witness Printer took 3.95 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:40,050 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 483.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -192.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 397.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5169.58 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 73.6 MB). Peak memory consumption was 258.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.95 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 4 locations. One deterministic module has affine ranking function -1 * t + unknown-#length-unknown[t] and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 15 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 50 SDtfs, 57 SDslu, 15 SDs, 0 SdLazy, 13 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital235 mio100 ax100 hnf99 lsp95 ukn83 mio100 lsp46 div100 bol100 ite100 ukn100 eq191 hnf88 smp100 dnf212 smp98 tf100 neg97 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 94ms VariablesStem: 12 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...