./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/cstrcmp-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/run_dir_eca28801-489d-492e-9482-64ed792c4a92/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_eca28801-489d-492e-9482-64ed792c4a92/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_eca28801-489d-492e-9482-64ed792c4a92/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_eca28801-489d-492e-9482-64ed792c4a92/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrcmp-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_eca28801-489d-492e-9482-64ed792c4a92/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_eca28801-489d-492e-9482-64ed792c4a92/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 32bit --witnessprinter.graph.data.programhash df3db790fa8159689a8da2e25598b93c123cddf7 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:24:51,380 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:24:51,381 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:24:51,394 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:24:51,394 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:24:51,395 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:24:51,397 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:24:51,399 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:24:51,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:24:51,403 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:24:51,404 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:24:51,405 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:24:51,405 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:24:51,407 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:24:51,408 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:24:51,409 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:24:51,410 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:24:51,411 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:24:51,413 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:24:51,415 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:24:51,417 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:24:51,418 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:24:51,419 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:24:51,420 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:24:51,422 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:24:51,423 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:24:51,423 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:24:51,424 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:24:51,424 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:24:51,425 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:24:51,426 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:24:51,426 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:24:51,427 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:24:51,428 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:24:51,429 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:24:51,429 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:24:51,430 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:24:51,430 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:24:51,431 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:24:51,432 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:24:51,432 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:24:51,433 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_eca28801-489d-492e-9482-64ed792c4a92/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 23:24:51,452 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:24:51,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:24:51,454 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:24:51,454 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:24:51,454 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:24:51,455 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:24:51,455 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:24:51,455 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:24:51,455 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:24:51,456 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:24:51,456 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:24:51,456 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:24:51,456 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:24:51,457 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:24:51,457 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:24:51,457 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:24:51,458 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:24:51,458 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:24:51,458 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:24:51,458 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:24:51,459 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:24:51,459 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:24:51,459 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:24:51,459 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:24:51,460 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:24:51,460 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:24:51,460 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:24:51,460 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:24:51,461 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:24:51,461 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:24:51,461 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:24:51,462 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:24:51,463 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/run_dir_eca28801-489d-492e-9482-64ed792c4a92/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> df3db790fa8159689a8da2e25598b93c123cddf7 [2019-11-15 23:24:51,493 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:24:51,504 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:24:51,508 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:24:51,510 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:24:51,510 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:24:51,511 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_eca28801-489d-492e-9482-64ed792c4a92/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrcmp-alloca-2.i [2019-11-15 23:24:51,574 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_eca28801-489d-492e-9482-64ed792c4a92/bin/uautomizer/data/4a720d11a/ef6561de5d454f51821edcc2c81c1808/FLAGba0e85d4e [2019-11-15 23:24:52,117 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:24:52,118 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_eca28801-489d-492e-9482-64ed792c4a92/sv-benchmarks/c/array-memsafety/cstrcmp-alloca-2.i [2019-11-15 23:24:52,162 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_eca28801-489d-492e-9482-64ed792c4a92/bin/uautomizer/data/4a720d11a/ef6561de5d454f51821edcc2c81c1808/FLAGba0e85d4e [2019-11-15 23:24:52,446 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_eca28801-489d-492e-9482-64ed792c4a92/bin/uautomizer/data/4a720d11a/ef6561de5d454f51821edcc2c81c1808 [2019-11-15 23:24:52,449 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:24:52,450 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:24:52,452 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:24:52,452 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:24:52,457 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:24:52,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:24:52" (1/1) ... [2019-11-15 23:24:52,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b053f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:52, skipping insertion in model container [2019-11-15 23:24:52,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:24:52" (1/1) ... [2019-11-15 23:24:52,472 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:24:52,525 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:24:52,972 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:24:52,989 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:24:53,066 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:24:53,124 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:24:53,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:53 WrapperNode [2019-11-15 23:24:53,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:24:53,126 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:24:53,126 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:24:53,126 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:24:53,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:53" (1/1) ... [2019-11-15 23:24:53,153 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:53" (1/1) ... [2019-11-15 23:24:53,181 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:24:53,181 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:24:53,182 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:24:53,182 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:24:53,192 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:53" (1/1) ... [2019-11-15 23:24:53,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:53" (1/1) ... [2019-11-15 23:24:53,197 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:53" (1/1) ... [2019-11-15 23:24:53,197 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:53" (1/1) ... [2019-11-15 23:24:53,205 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:53" (1/1) ... [2019-11-15 23:24:53,211 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:53" (1/1) ... [2019-11-15 23:24:53,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:53" (1/1) ... [2019-11-15 23:24:53,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:24:53,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:24:53,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:24:53,217 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:24:53,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eca28801-489d-492e-9482-64ed792c4a92/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-11-15 23:24:53,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:24:53,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:24:53,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:24:53,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:24:53,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:24:53,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:24:53,754 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:24:53,754 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 23:24:53,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:24:53 BoogieIcfgContainer [2019-11-15 23:24:53,756 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:24:53,756 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:24:53,756 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:24:53,761 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:24:53,762 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:24:53,762 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:24:52" (1/3) ... [2019-11-15 23:24:53,763 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d9cee79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:24:53, skipping insertion in model container [2019-11-15 23:24:53,764 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:24:53,764 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:53" (2/3) ... [2019-11-15 23:24:53,764 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d9cee79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:24:53, skipping insertion in model container [2019-11-15 23:24:53,764 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:24:53,765 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:24:53" (3/3) ... [2019-11-15 23:24:53,771 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrcmp-alloca-2.i [2019-11-15 23:24:53,831 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:24:53,832 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:24:53,832 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:24:53,833 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:24:53,833 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:24:53,833 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:24:53,834 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:24:53,834 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:24:53,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-15 23:24:53,877 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-11-15 23:24:53,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:24:53,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:24:53,886 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:24:53,886 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:24:53,887 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:24:53,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-15 23:24:53,889 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-11-15 23:24:53,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:24:53,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:24:53,890 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:24:53,890 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:24:53,899 INFO L791 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 20#L528true assume !(main_~length1~0 < 1); 4#L528-2true assume !(main_~length2~0 < 1); 16#L531-1true call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 7#L537-3true [2019-11-15 23:24:53,899 INFO L793 eck$LassoCheckResult]: Loop: 7#L537-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 6#L537-2true main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 7#L537-3true [2019-11-15 23:24:53,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:53,904 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-15 23:24:53,911 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:53,911 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004312162] [2019-11-15 23:24:53,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:53,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:53,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:54,062 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:54,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:54,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2019-11-15 23:24:54,064 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:54,065 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598417258] [2019-11-15 23:24:54,065 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:54,065 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:54,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:54,086 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:54,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:54,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2019-11-15 23:24:54,089 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:54,089 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693900101] [2019-11-15 23:24:54,090 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:54,090 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:54,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:54,147 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:54,445 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-15 23:24:54,584 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-15 23:24:54,596 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:24:54,596 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:24:54,597 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:24:54,597 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:24:54,597 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:24:54,597 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:24:54,597 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:24:54,597 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:24:54,598 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcmp-alloca-2.i_Iteration1_Lasso [2019-11-15 23:24:54,598 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:24:54,598 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:24:54,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:54,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:54,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:54,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:54,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:54,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:54,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:54,889 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-11-15 23:24:54,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:54,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:54,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:54,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:54,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:54,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:54,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:54,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:55,467 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 23:24:55,628 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:24:55,634 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:24:55,638 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-11-15 23:24:55,641 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:55,641 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:55,642 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:55,642 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:55,642 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:55,645 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:55,646 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:55,655 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:55,658 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-11-15 23:24:55,660 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:55,660 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:55,660 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:55,661 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:55,661 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:55,666 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:55,667 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:55,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:55,670 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-11-15 23:24:55,677 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:55,678 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:55,678 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:55,678 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:55,678 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:55,679 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:55,679 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:55,680 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:55,681 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-11-15 23:24:55,681 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:55,682 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:55,682 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:55,682 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:55,682 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:55,683 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:55,683 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:55,684 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:55,685 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-11-15 23:24:55,686 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:55,686 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:55,686 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:55,686 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:55,693 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:55,694 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:55,720 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:55,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-11-15 23:24:55,721 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:55,721 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:55,722 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:55,722 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:55,724 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:55,725 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:55,729 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:55,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-11-15 23:24:55,731 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:55,731 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:55,731 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:55,731 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:55,742 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:55,742 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:55,756 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:55,756 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-11-15 23:24:55,757 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:55,757 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:55,758 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:55,758 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:55,764 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:55,767 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:55,801 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:55,803 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-11-15 23:24:55,806 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:55,808 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 23:24:55,808 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:55,808 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:55,815 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 23:24:55,824 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:55,888 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:55,895 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-11-15 23:24:55,897 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:55,899 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:55,899 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:55,899 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:55,900 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:55,901 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:55,902 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:55,903 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:55,905 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-11-15 23:24:55,906 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:55,906 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:55,906 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:55,906 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:55,912 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:55,912 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:55,920 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:55,921 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-11-15 23:24:55,922 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:55,922 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:55,922 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:55,923 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:55,925 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:55,925 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:55,931 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:55,932 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-11-15 23:24:55,933 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:55,933 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:55,934 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:55,934 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:55,935 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:55,935 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:55,935 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:55,945 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:55,946 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-11-15 23:24:55,949 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:55,950 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:55,950 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:55,951 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:55,962 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:55,962 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:56,023 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:24:56,078 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 23:24:56,078 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 23:24:56,081 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:24:56,083 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:24:56,083 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:24:56,084 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~length1~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-15 23:24:56,110 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 23:24:56,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:56,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:24:56,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:24:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:56,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:24:56,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:24:56,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:24:56,230 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-11-15 23:24:56,231 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 3 states. [2019-11-15 23:24:56,315 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 3 states. Result 51 states and 73 transitions. Complement of second has 7 states. [2019-11-15 23:24:56,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:24:56,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:24:56,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2019-11-15 23:24:56,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 49 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-15 23:24:56,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:24:56,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 49 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 23:24:56,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:24:56,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 49 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-15 23:24:56,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:24:56,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 73 transitions. [2019-11-15 23:24:56,348 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 23:24:56,357 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 15 states and 21 transitions. [2019-11-15 23:24:56,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-15 23:24:56,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 23:24:56,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2019-11-15 23:24:56,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:24:56,361 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-11-15 23:24:56,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2019-11-15 23:24:56,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-15 23:24:56,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-15 23:24:56,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2019-11-15 23:24:56,405 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-11-15 23:24:56,406 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-11-15 23:24:56,406 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:24:56,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2019-11-15 23:24:56,408 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 23:24:56,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:24:56,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:24:56,409 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:56,409 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:24:56,410 INFO L791 eck$LassoCheckResult]: Stem: 156#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 154#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 155#L528 assume !(main_~length1~0 < 1); 146#L528-2 assume !(main_~length2~0 < 1); 147#L531-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 151#L537-3 assume !(main_~i~0 < main_~length1~0 - 1); 152#L537-4 main_~i~1 := 0; 153#L542-3 [2019-11-15 23:24:56,410 INFO L793 eck$LassoCheckResult]: Loop: 153#L542-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 157#L542-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 153#L542-3 [2019-11-15 23:24:56,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:56,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2019-11-15 23:24:56,411 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:56,411 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738031946] [2019-11-15 23:24:56,412 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:56,412 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:56,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:56,471 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:56,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:56,478 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2019-11-15 23:24:56,478 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:56,478 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567258533] [2019-11-15 23:24:56,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:56,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:56,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:56,502 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:56,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:56,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2019-11-15 23:24:56,507 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:56,507 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544751539] [2019-11-15 23:24:56,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:56,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:56,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:56,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:56,552 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:56,696 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-15 23:24:56,790 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:24:56,790 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:24:56,791 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:24:56,791 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:24:56,791 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:24:56,791 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:24:56,791 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:24:56,791 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:24:56,792 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcmp-alloca-2.i_Iteration2_Lasso [2019-11-15 23:24:56,792 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:24:56,792 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:24:56,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:56,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:56,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:56,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:56,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-11-15 23:24:56,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:56,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-11-15 23:24:56,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:56,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-11-15 23:24:56,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:56,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:56,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:57,061 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-11-15 23:24:57,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:57,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:57,591 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 23:24:57,692 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:24:57,692 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:24:57,692 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-11-15 23:24:57,693 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:57,693 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:57,694 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:57,694 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:57,694 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:57,695 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:57,695 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:57,696 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:57,696 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-11-15 23:24:57,697 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:57,697 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:57,697 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:57,698 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:57,698 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:57,698 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:57,698 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:57,699 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:57,700 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-11-15 23:24:57,700 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:57,700 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:57,701 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:57,701 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:57,702 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:57,702 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:57,705 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:57,705 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-11-15 23:24:57,706 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:57,706 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:57,707 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:57,707 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:57,707 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:57,707 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:57,708 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:57,708 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:57,709 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-11-15 23:24:57,709 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:57,710 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:57,710 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:57,710 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:57,711 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:57,711 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:57,713 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:57,714 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-11-15 23:24:57,715 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:57,715 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:57,715 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:57,715 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:57,715 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:57,716 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:57,716 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:57,717 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:57,717 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-11-15 23:24:57,718 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:57,718 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:57,718 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:57,719 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:57,719 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:57,719 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:57,719 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:57,720 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:57,721 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-11-15 23:24:57,721 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:57,722 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:57,722 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:57,722 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:57,723 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:57,723 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:57,725 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:57,726 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:24:57,727 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:57,727 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:57,727 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:57,727 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:57,728 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:57,729 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:57,732 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:57,732 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:24:57,733 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:57,733 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:57,733 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:57,734 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:57,734 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:57,734 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:57,734 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:57,735 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:57,736 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-11-15 23:24:57,736 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:57,737 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:57,737 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:57,737 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:57,738 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:57,738 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:57,741 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:57,742 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-11-15 23:24:57,743 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:57,743 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:57,743 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:57,743 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:57,744 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:57,744 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:57,747 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:57,748 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-11-15 23:24:57,748 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:57,749 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 23:24:57,749 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:57,749 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:57,752 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 23:24:57,752 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:57,767 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:57,768 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-11-15 23:24:57,769 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:57,769 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:57,769 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:57,769 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:57,771 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:57,771 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:57,777 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:57,778 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-11-15 23:24:57,779 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:57,779 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:57,779 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:57,779 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:57,779 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:57,780 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:57,780 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:57,781 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:57,782 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-11-15 23:24:57,782 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:57,782 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:57,783 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:57,783 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:57,784 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:57,784 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:57,786 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:57,786 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-11-15 23:24:57,787 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:57,787 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:57,787 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:57,787 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:57,788 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:57,788 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:57,788 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:57,789 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:57,789 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-11-15 23:24:57,790 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:57,790 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:57,790 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:57,791 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:57,793 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:57,793 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:57,818 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:24:57,852 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 23:24:57,853 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 23:24:57,853 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:24:57,854 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:24:57,855 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:24:57,855 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~length2~0) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~length2~0 Supporting invariants [] [2019-11-15 23:24:57,876 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 23:24:57,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:57,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:24:57,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:24:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:57,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:24:57,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:24:57,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:24:57,940 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-11-15 23:24:57,940 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-15 23:24:57,967 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 21 states and 32 transitions. Complement of second has 6 states. [2019-11-15 23:24:57,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:24:57,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:24:57,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-11-15 23:24:57,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 23:24:57,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:24:57,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-15 23:24:57,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:24:57,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-15 23:24:57,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:24:57,971 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 32 transitions. [2019-11-15 23:24:57,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:24:57,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 23 transitions. [2019-11-15 23:24:57,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 23:24:57,974 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 23:24:57,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 23 transitions. [2019-11-15 23:24:57,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:24:57,975 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2019-11-15 23:24:57,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 23 transitions. [2019-11-15 23:24:57,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-15 23:24:57,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-15 23:24:57,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2019-11-15 23:24:57,977 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2019-11-15 23:24:57,978 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2019-11-15 23:24:57,978 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:24:57,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. [2019-11-15 23:24:57,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:24:57,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:24:57,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:24:57,980 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:57,980 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:24:57,980 INFO L791 eck$LassoCheckResult]: Stem: 266#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 264#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 265#L528 assume !(main_~length1~0 < 1); 256#L528-2 assume !(main_~length2~0 < 1); 257#L531-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 261#L537-3 assume !(main_~i~0 < main_~length1~0 - 1); 262#L537-4 main_~i~1 := 0; 263#L542-3 assume !(main_~i~1 < main_~length2~0 - 1); 269#L542-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset, cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset, cstrcmp_#t~mem2, cstrcmp_#t~mem3, cstrcmp_#t~mem4, cstrcmp_#t~short5, cstrcmp_#t~mem8, cstrcmp_#t~mem9, cstrcmp_#t~ite10, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; 258#L517-5 [2019-11-15 23:24:57,981 INFO L793 eck$LassoCheckResult]: Loop: 258#L517-5 call cstrcmp_#t~mem2 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short5 := 0 != cstrcmp_#t~mem2; 254#L517-1 assume cstrcmp_#t~short5;call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);call cstrcmp_#t~mem4 := read~int(cstrcmp_~s2.base, cstrcmp_~s2.offset, 1);cstrcmp_#t~short5 := cstrcmp_#t~mem3 == cstrcmp_#t~mem4; 255#L517-3 assume !!cstrcmp_#t~short5;havoc cstrcmp_#t~mem4;havoc cstrcmp_#t~short5;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~mem2;cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post6.base, 1 + cstrcmp_#t~post6.offset;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset;cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post7.base, 1 + cstrcmp_#t~post7.offset;havoc cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset; 258#L517-5 [2019-11-15 23:24:57,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:57,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2019-11-15 23:24:57,981 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:57,982 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026811610] [2019-11-15 23:24:57,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:57,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:57,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:58,029 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:58,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:58,034 INFO L82 PathProgramCache]: Analyzing trace with hash 77559, now seen corresponding path program 1 times [2019-11-15 23:24:58,034 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:58,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330126240] [2019-11-15 23:24:58,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:58,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:58,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:58,059 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:58,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:58,060 INFO L82 PathProgramCache]: Analyzing trace with hash -296047742, now seen corresponding path program 1 times [2019-11-15 23:24:58,060 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:58,060 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944535510] [2019-11-15 23:24:58,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:58,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:58,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:58,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:24:58,338 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944535510] [2019-11-15 23:24:58,339 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:58,339 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:24:58,339 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451360222] [2019-11-15 23:24:58,491 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-11-15 23:24:58,544 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:58,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:24:58,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:24:58,548 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. cyclomatic complexity: 10 Second operand 7 states. [2019-11-15 23:24:58,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:58,683 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2019-11-15 23:24:58,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:24:58,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2019-11-15 23:24:58,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:24:58,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 17 states and 22 transitions. [2019-11-15 23:24:58,686 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-15 23:24:58,686 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 23:24:58,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2019-11-15 23:24:58,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:24:58,686 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-11-15 23:24:58,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2019-11-15 23:24:58,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-15 23:24:58,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-15 23:24:58,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2019-11-15 23:24:58,688 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-15 23:24:58,688 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-15 23:24:58,689 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:24:58,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2019-11-15 23:24:58,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:24:58,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:24:58,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:24:58,692 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:58,692 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:24:58,692 INFO L791 eck$LassoCheckResult]: Stem: 326#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 324#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 325#L528 assume !(main_~length1~0 < 1); 316#L528-2 assume !(main_~length2~0 < 1); 317#L531-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 321#L537-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 319#L537-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 320#L537-3 assume !(main_~i~0 < main_~length1~0 - 1); 322#L537-4 main_~i~1 := 0; 323#L542-3 assume !(main_~i~1 < main_~length2~0 - 1); 329#L542-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset, cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset, cstrcmp_#t~mem2, cstrcmp_#t~mem3, cstrcmp_#t~mem4, cstrcmp_#t~short5, cstrcmp_#t~mem8, cstrcmp_#t~mem9, cstrcmp_#t~ite10, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; 318#L517-5 [2019-11-15 23:24:58,693 INFO L793 eck$LassoCheckResult]: Loop: 318#L517-5 call cstrcmp_#t~mem2 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short5 := 0 != cstrcmp_#t~mem2; 314#L517-1 assume cstrcmp_#t~short5;call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);call cstrcmp_#t~mem4 := read~int(cstrcmp_~s2.base, cstrcmp_~s2.offset, 1);cstrcmp_#t~short5 := cstrcmp_#t~mem3 == cstrcmp_#t~mem4; 315#L517-3 assume !!cstrcmp_#t~short5;havoc cstrcmp_#t~mem4;havoc cstrcmp_#t~short5;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~mem2;cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post6.base, 1 + cstrcmp_#t~post6.offset;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset;cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post7.base, 1 + cstrcmp_#t~post7.offset;havoc cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset; 318#L517-5 [2019-11-15 23:24:58,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:58,693 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2019-11-15 23:24:58,693 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:58,694 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427866938] [2019-11-15 23:24:58,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:58,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:58,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:58,721 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:58,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:58,722 INFO L82 PathProgramCache]: Analyzing trace with hash 77559, now seen corresponding path program 2 times [2019-11-15 23:24:58,722 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:58,722 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029356357] [2019-11-15 23:24:58,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:58,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:58,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:58,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:58,745 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:58,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:58,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1311502304, now seen corresponding path program 1 times [2019-11-15 23:24:58,746 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:58,747 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458402774] [2019-11-15 23:24:58,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:58,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:58,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:58,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:24:58,942 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458402774] [2019-11-15 23:24:58,942 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:58,943 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:24:58,943 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411207516] [2019-11-15 23:24:59,121 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-11-15 23:24:59,178 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:59,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:24:59,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:24:59,179 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand 9 states. [2019-11-15 23:24:59,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:59,366 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2019-11-15 23:24:59,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:24:59,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 25 transitions. [2019-11-15 23:24:59,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:24:59,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 21 transitions. [2019-11-15 23:24:59,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-15 23:24:59,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 23:24:59,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2019-11-15 23:24:59,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:24:59,369 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-15 23:24:59,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2019-11-15 23:24:59,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-15 23:24:59,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-15 23:24:59,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-11-15 23:24:59,371 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-11-15 23:24:59,371 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-11-15 23:24:59,371 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 23:24:59,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2019-11-15 23:24:59,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:24:59,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:24:59,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:24:59,373 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:59,373 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:24:59,373 INFO L791 eck$LassoCheckResult]: Stem: 383#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 381#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 382#L528 assume !(main_~length1~0 < 1); 373#L528-2 assume !(main_~length2~0 < 1); 374#L531-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 378#L537-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 376#L537-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 377#L537-3 assume !(main_~i~0 < main_~length1~0 - 1); 379#L537-4 main_~i~1 := 0; 380#L542-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 384#L542-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 385#L542-3 assume !(main_~i~1 < main_~length2~0 - 1); 386#L542-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset, cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset, cstrcmp_#t~mem2, cstrcmp_#t~mem3, cstrcmp_#t~mem4, cstrcmp_#t~short5, cstrcmp_#t~mem8, cstrcmp_#t~mem9, cstrcmp_#t~ite10, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; 375#L517-5 [2019-11-15 23:24:59,373 INFO L793 eck$LassoCheckResult]: Loop: 375#L517-5 call cstrcmp_#t~mem2 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short5 := 0 != cstrcmp_#t~mem2; 371#L517-1 assume cstrcmp_#t~short5;call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);call cstrcmp_#t~mem4 := read~int(cstrcmp_~s2.base, cstrcmp_~s2.offset, 1);cstrcmp_#t~short5 := cstrcmp_#t~mem3 == cstrcmp_#t~mem4; 372#L517-3 assume !!cstrcmp_#t~short5;havoc cstrcmp_#t~mem4;havoc cstrcmp_#t~short5;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~mem2;cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post6.base, 1 + cstrcmp_#t~post6.offset;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset;cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post7.base, 1 + cstrcmp_#t~post7.offset;havoc cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset; 375#L517-5 [2019-11-15 23:24:59,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:59,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2019-11-15 23:24:59,374 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:59,374 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757601325] [2019-11-15 23:24:59,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:59,375 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:59,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:59,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:59,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:59,419 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:59,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:59,421 INFO L82 PathProgramCache]: Analyzing trace with hash 77559, now seen corresponding path program 3 times [2019-11-15 23:24:59,421 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:59,421 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738184726] [2019-11-15 23:24:59,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:59,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:59,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:59,436 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:59,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:59,436 INFO L82 PathProgramCache]: Analyzing trace with hash -718433154, now seen corresponding path program 1 times [2019-11-15 23:24:59,437 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:59,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504682831] [2019-11-15 23:24:59,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:59,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:59,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:59,478 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:59,628 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-11-15 23:25:00,370 WARN L191 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 111 [2019-11-15 23:25:00,557 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-11-15 23:25:00,560 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:25:00,560 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:25:00,561 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:25:00,561 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:25:00,561 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:25:00,561 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:25:00,561 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:25:00,561 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:25:00,561 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcmp-alloca-2.i_Iteration5_Lasso [2019-11-15 23:25:00,561 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:25:00,561 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:25:00,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:25:00,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:25:00,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:25:00,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:25:01,180 WARN L191 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 86 [2019-11-15 23:25:01,369 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-11-15 23:25:01,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:25:01,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:25:01,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:25:01,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:25:01,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:25:01,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:25:01,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:25:01,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:25:01,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:25:01,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:25:01,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:25:01,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:25:01,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:25:01,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:25:01,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:25:01,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:25:01,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:25:01,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:25:01,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:25:01,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:25:01,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:25:01,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:25:01,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:25:01,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:25:02,489 WARN L191 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-11-15 23:25:02,564 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:25:02,564 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:25:02,564 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-11-15 23:25:02,565 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:02,565 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:25:02,565 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:02,566 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:02,566 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:02,566 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:25:02,566 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:25:02,567 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:02,567 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-11-15 23:25:02,568 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:02,568 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:25:02,568 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:02,568 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:02,568 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:02,569 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:25:02,569 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:25:02,569 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:02,570 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-11-15 23:25:02,570 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:02,570 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:02,570 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:02,570 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:02,571 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:25:02,572 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:25:02,573 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:02,589 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-11-15 23:25:02,590 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:02,591 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:02,591 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:02,591 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:02,592 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:25:02,592 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:25:02,593 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:02,594 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-11-15 23:25:02,594 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:02,595 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:02,595 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:02,595 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:02,596 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:25:02,597 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:25:02,602 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:02,602 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-11-15 23:25:02,606 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:02,606 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:02,606 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:02,606 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:02,608 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:25:02,608 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:25:02,613 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:02,613 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-11-15 23:25:02,614 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:02,614 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:02,614 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:25:02,614 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:02,618 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-15 23:25:02,618 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 23:25:02,646 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:25:02,647 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-11-15 23:25:02,647 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:25:02,648 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:25:02,648 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:25:02,648 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:25:02,656 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:25:02,656 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:25:02,709 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:25:02,765 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 23:25:02,765 INFO L444 ModelExtractionUtils]: 40 out of 46 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 23:25:02,766 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:25:02,767 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:25:02,767 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:25:02,767 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcmp_~s1.offset, v_rep(select #length ULTIMATE.start_cstrcmp_~s1.base)_1) = -1*ULTIMATE.start_cstrcmp_~s1.offset + 1*v_rep(select #length ULTIMATE.start_cstrcmp_~s1.base)_1 Supporting invariants [] [2019-11-15 23:25:02,878 INFO L297 tatePredicateManager]: 22 out of 22 supporting invariants were superfluous and have been removed [2019-11-15 23:25:02,880 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 23:25:02,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:25:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:02,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:25:02,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:25:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:02,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:25:02,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:25:02,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:25:02,962 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-11-15 23:25:02,962 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-15 23:25:02,976 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 19 states and 24 transitions. Complement of second has 4 states. [2019-11-15 23:25:02,977 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-11-15 23:25:02,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:25:02,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-11-15 23:25:02,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 13 letters. Loop has 3 letters. [2019-11-15 23:25:02,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:25:02,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 16 letters. Loop has 3 letters. [2019-11-15 23:25:02,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:25:02,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 13 letters. Loop has 6 letters. [2019-11-15 23:25:02,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:25:02,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2019-11-15 23:25:02,980 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:25:02,980 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2019-11-15 23:25:02,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:25:02,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:25:02,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:25:02,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:25:02,981 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:25:02,981 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:25:02,981 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:25:02,981 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 23:25:02,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:25:02,981 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:25:02,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:25:02,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:25:02 BoogieIcfgContainer [2019-11-15 23:25:02,989 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:25:02,989 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:25:02,990 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:25:02,990 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:25:02,991 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:24:53" (3/4) ... [2019-11-15 23:25:02,994 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:25:02,995 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:25:02,996 INFO L168 Benchmark]: Toolchain (without parser) took 10545.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.1 MB). Free memory was 934.4 MB in the beginning and 1.0 GB in the end (delta: -87.8 MB). Peak memory consumption was 108.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:25:02,997 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:25:02,998 INFO L168 Benchmark]: CACSL2BoogieTranslator took 673.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -191.9 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:25:02,999 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.34 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:25:02,999 INFO L168 Benchmark]: Boogie Preprocessor took 34.75 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-11-15 23:25:03,000 INFO L168 Benchmark]: RCFGBuilder took 539.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:25:03,001 INFO L168 Benchmark]: BuchiAutomizer took 9232.75 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 52.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 76.3 MB). Peak memory consumption was 128.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:25:03,001 INFO L168 Benchmark]: Witness Printer took 5.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:25:03,005 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 673.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -191.9 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.34 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.75 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 539.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9232.75 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 52.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 76.3 MB). Peak memory consumption was 128.8 MB. Max. memory is 11.5 GB. * Witness Printer took 5.35 ms. Allocated memory is still 1.2 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function length1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * i + length2 and consists of 4 locations. One deterministic module has affine ranking function -1 * s1 + unknown-#length-unknown[s1] and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.1s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 8.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 16 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 75 SDtfs, 132 SDslu, 97 SDs, 0 SdLazy, 94 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital203 mio100 ax110 hnf98 lsp84 ukn74 mio100 lsp47 div100 bol100 ite100 ukn100 eq178 hnf89 smp100 dnf157 smp95 tf100 neg94 sie122 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 32ms VariablesStem: 6 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...