./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrspn-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_2b0cf942-4df7-451d-ab2f-a206eb6ab795/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2b0cf942-4df7-451d-ab2f-a206eb6ab795/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2b0cf942-4df7-451d-ab2f-a206eb6ab795/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2b0cf942-4df7-451d-ab2f-a206eb6ab795/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_2b0cf942-4df7-451d-ab2f-a206eb6ab795/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2b0cf942-4df7-451d-ab2f-a206eb6ab795/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 46421108dc6473f7bf7bcbb7826a3247c1ccc8d1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 21:19:14,078 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:19:14,079 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:19:14,090 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:19:14,090 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:19:14,091 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:19:14,092 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:19:14,095 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:19:14,097 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:19:14,098 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:19:14,099 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:19:14,100 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:19:14,100 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:19:14,101 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:19:14,102 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:19:14,103 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:19:14,104 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:19:14,105 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:19:14,107 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:19:14,109 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:19:14,111 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:19:14,112 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:19:14,113 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:19:14,113 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:19:14,117 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:19:14,117 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:19:14,117 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:19:14,118 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:19:14,119 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:19:14,120 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:19:14,120 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:19:14,121 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:19:14,122 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:19:14,122 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:19:14,123 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:19:14,124 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:19:14,124 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:19:14,125 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:19:14,125 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:19:14,126 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:19:14,127 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:19:14,127 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2b0cf942-4df7-451d-ab2f-a206eb6ab795/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 21:19:14,148 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:19:14,152 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:19:14,154 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:19:14,154 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:19:14,154 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:19:14,155 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 21:19:14,155 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 21:19:14,155 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 21:19:14,155 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 21:19:14,155 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 21:19:14,157 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 21:19:14,157 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:19:14,157 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:19:14,157 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:19:14,158 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:19:14,158 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:19:14,158 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:19:14,158 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 21:19:14,159 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 21:19:14,159 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 21:19:14,159 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:19:14,159 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:19:14,160 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 21:19:14,160 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:19:14,160 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 21:19:14,161 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:19:14,161 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:19:14,161 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 21:19:14,161 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:19:14,162 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:19:14,162 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 21:19:14,163 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 21:19:14,163 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_2b0cf942-4df7-451d-ab2f-a206eb6ab795/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 -> 46421108dc6473f7bf7bcbb7826a3247c1ccc8d1 [2019-11-15 21:19:14,203 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:19:14,217 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:19:14,221 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:19:14,222 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:19:14,223 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:19:14,223 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2b0cf942-4df7-451d-ab2f-a206eb6ab795/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca-2.i [2019-11-15 21:19:14,276 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2b0cf942-4df7-451d-ab2f-a206eb6ab795/bin/uautomizer/data/ed2f593ec/362b6817eae04e3789254185bec1b08f/FLAGa8ee211b4 [2019-11-15 21:19:14,726 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:19:14,727 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2b0cf942-4df7-451d-ab2f-a206eb6ab795/sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca-2.i [2019-11-15 21:19:14,738 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2b0cf942-4df7-451d-ab2f-a206eb6ab795/bin/uautomizer/data/ed2f593ec/362b6817eae04e3789254185bec1b08f/FLAGa8ee211b4 [2019-11-15 21:19:15,053 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2b0cf942-4df7-451d-ab2f-a206eb6ab795/bin/uautomizer/data/ed2f593ec/362b6817eae04e3789254185bec1b08f [2019-11-15 21:19:15,055 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:19:15,056 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:19:15,057 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:19:15,057 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:19:15,060 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:19:15,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:19:15" (1/1) ... [2019-11-15 21:19:15,063 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54f33ddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:15, skipping insertion in model container [2019-11-15 21:19:15,063 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:19:15" (1/1) ... [2019-11-15 21:19:15,070 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:19:15,104 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:19:15,566 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:19:15,575 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:19:15,609 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:19:15,675 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:19:15,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:15 WrapperNode [2019-11-15 21:19:15,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:19:15,678 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:19:15,678 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:19:15,678 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:19:15,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:15" (1/1) ... [2019-11-15 21:19:15,710 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:15" (1/1) ... [2019-11-15 21:19:15,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:19:15,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:19:15,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:19:15,744 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:19:15,753 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:15" (1/1) ... [2019-11-15 21:19:15,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:15" (1/1) ... [2019-11-15 21:19:15,766 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:15" (1/1) ... [2019-11-15 21:19:15,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:15" (1/1) ... [2019-11-15 21:19:15,777 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:15" (1/1) ... [2019-11-15 21:19:15,786 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:15" (1/1) ... [2019-11-15 21:19:15,792 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:15" (1/1) ... [2019-11-15 21:19:15,799 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:19:15,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:19:15,802 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:19:15,802 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:19:15,803 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2b0cf942-4df7-451d-ab2f-a206eb6ab795/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 21:19:15,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:19:15,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:19:15,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:19:15,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:19:15,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:19:15,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:19:16,203 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:19:16,203 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 21:19:16,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:19:16 BoogieIcfgContainer [2019-11-15 21:19:16,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:19:16,205 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 21:19:16,205 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 21:19:16,208 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 21:19:16,209 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:19:16,209 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 09:19:15" (1/3) ... [2019-11-15 21:19:16,210 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@228f81c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:19:16, skipping insertion in model container [2019-11-15 21:19:16,211 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:19:16,211 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:19:15" (2/3) ... [2019-11-15 21:19:16,211 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@228f81c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:19:16, skipping insertion in model container [2019-11-15 21:19:16,211 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:19:16,212 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:19:16" (3/3) ... [2019-11-15 21:19:16,213 INFO L371 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrspn-alloca-2.i [2019-11-15 21:19:16,255 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 21:19:16,255 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 21:19:16,255 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 21:19:16,255 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:19:16,256 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:19:16,256 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 21:19:16,256 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:19:16,256 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 21:19:16,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-11-15 21:19:16,289 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-11-15 21:19:16,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:19:16,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:19:16,296 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:19:16,296 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:19:16,296 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 21:19:16,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-11-15 21:19:16,298 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-11-15 21:19:16,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:19:16,299 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:19:16,299 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:19:16,299 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:19:16,306 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~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 19#L528true assume !(main_~length1~0 < 1); 5#L528-2true assume !(main_~length2~0 < 1); 15#L531-1true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 8#L537-3true [2019-11-15 21:19:16,306 INFO L793 eck$LassoCheckResult]: Loop: 8#L537-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 7#L537-2true main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 8#L537-3true [2019-11-15 21:19:16,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:16,312 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-15 21:19:16,318 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:16,318 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76735676] [2019-11-15 21:19:16,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:16,319 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:16,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:16,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:16,443 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:19:16,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:16,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2019-11-15 21:19:16,445 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:16,445 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322700374] [2019-11-15 21:19:16,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:16,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:16,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:16,462 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:19:16,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:16,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2019-11-15 21:19:16,464 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:16,464 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875634819] [2019-11-15 21:19:16,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:16,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:16,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:16,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:16,508 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:19:16,704 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-15 21:19:16,810 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:19:16,810 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:19:16,810 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:19:16,810 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:19:16,811 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:19:16,811 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:19:16,811 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:19:16,811 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:19:16,811 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrspn-alloca-2.i_Iteration1_Lasso [2019-11-15 21:19:16,811 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:19:16,811 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:19:16,834 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 21:19:16,847 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 21:19:16,850 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 21:19:16,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:19:16,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 21:19:16,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 21:19:16,870 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 21:19:16,874 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 21:19:16,877 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 21:19:16,888 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 21:19:17,058 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-11-15 21:19:17,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 21:19:17,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 21:19:17,103 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 21:19:17,107 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 21:19:17,110 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 21:19:17,514 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 21:19:17,638 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:19:17,643 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:19:17,645 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 21:19:17,646 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:17,647 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:17,647 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:17,647 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:17,652 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:19:17,652 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:19:17,659 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:17,660 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 21:19:17,661 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:17,661 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:19:17,661 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:17,662 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:17,662 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:17,662 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:19:17,663 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:19:17,664 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:17,664 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 21:19:17,665 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:17,665 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:19:17,665 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:17,665 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:17,666 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:17,666 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:19:17,666 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:19:17,667 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:17,667 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 21:19:17,668 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:17,668 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:19:17,669 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:17,669 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:17,669 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:17,669 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:19:17,670 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:19:17,670 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:17,671 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 21:19:17,672 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:17,672 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:19:17,672 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:17,672 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:17,672 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:17,673 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:19:17,673 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:19:17,674 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:17,675 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 21:19:17,675 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:17,676 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:17,676 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:17,676 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:17,678 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:19:17,678 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:19:17,682 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:17,683 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 21:19:17,683 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:17,684 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:17,684 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:17,684 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:17,686 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:19:17,686 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:19:17,690 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:17,695 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 21:19:17,696 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:17,697 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:19:17,697 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:17,697 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:17,697 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:17,698 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:19:17,698 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:19:17,700 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:17,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:19:17,709 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:17,709 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:17,709 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:17,710 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:17,711 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:19:17,712 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:19:17,717 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:17,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:19:17,723 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:17,726 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:19:17,727 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:17,727 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:17,727 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:17,727 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:19:17,728 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:19:17,729 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:17,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:19:17,730 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:17,730 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 21:19:17,731 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:17,731 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:17,736 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 21:19:17,736 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:19:17,781 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:17,790 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 21:19:17,791 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:17,791 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:19:17,791 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:17,791 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:17,793 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:17,794 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:19:17,794 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:19:17,795 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:17,796 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 21:19:17,797 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:17,797 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:17,798 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:17,798 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:17,800 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:19:17,802 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:19:17,808 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:17,808 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 21:19:17,809 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:17,809 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:17,809 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:17,810 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:17,811 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:19:17,811 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:19:17,815 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:17,816 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 21:19:17,817 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:17,817 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:17,817 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:17,817 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:17,819 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:19:17,819 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:19:17,822 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:17,822 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 21:19:17,823 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:17,823 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:17,824 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:17,824 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:17,827 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:19:17,827 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:19:17,885 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:19:17,963 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 21:19:17,964 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 21:19:17,966 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:19:17,971 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:19:17,972 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:19:17,973 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nondetString1~0.offset, v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1, ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~nondetString1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-15 21:19:17,991 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 21:19:17,999 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 21:19:18,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:18,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:19:18,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:19:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:18,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:19:18,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:19:18,078 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 21:19:18,093 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 21:19:18,094 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states. Second operand 3 states. [2019-11-15 21:19:18,162 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states.. Second operand 3 states. Result 48 states and 67 transitions. Complement of second has 7 states. [2019-11-15 21:19:18,163 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 21:19:18,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:19:18,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2019-11-15 21:19:18,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-15 21:19:18,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:19:18,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 21:19:18,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:19:18,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-15 21:19:18,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:19:18,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 67 transitions. [2019-11-15 21:19:18,173 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 21:19:18,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 16 states and 22 transitions. [2019-11-15 21:19:18,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 21:19:18,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 21:19:18,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-11-15 21:19:18,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:19:18,180 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-15 21:19:18,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-11-15 21:19:18,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-15 21:19:18,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-15 21:19:18,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-11-15 21:19:18,206 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-15 21:19:18,206 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-15 21:19:18,206 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 21:19:18,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2019-11-15 21:19:18,207 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 21:19:18,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:19:18,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:19:18,208 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:19:18,208 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:19:18,208 INFO L791 eck$LassoCheckResult]: Stem: 153#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 150#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 151#L528 assume !(main_~length1~0 < 1); 142#L528-2 assume !(main_~length2~0 < 1); 143#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 146#L537-3 assume !(main_~i~0 < main_~length1~0 - 1); 147#L537-4 main_~i~1 := 0; 148#L541-3 [2019-11-15 21:19:18,209 INFO L793 eck$LassoCheckResult]: Loop: 148#L541-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 155#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 148#L541-3 [2019-11-15 21:19:18,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:18,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2019-11-15 21:19:18,209 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:18,209 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435982635] [2019-11-15 21:19:18,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:18,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:18,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:18,230 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:19:18,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:18,231 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2019-11-15 21:19:18,231 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:18,231 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197159430] [2019-11-15 21:19:18,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:18,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:18,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:18,241 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:19:18,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:18,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2019-11-15 21:19:18,242 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:18,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430656216] [2019-11-15 21:19:18,242 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:18,242 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:18,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:18,267 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:19:18,495 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:19:18,496 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:19:18,496 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:19:18,496 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:19:18,496 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:19:18,496 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:19:18,496 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:19:18,496 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:19:18,496 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrspn-alloca-2.i_Iteration2_Lasso [2019-11-15 21:19:18,496 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:19:18,496 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:19:18,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:19:18,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:19:18,648 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-11-15 21:19:18,671 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 21:19:18,675 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 21:19:18,677 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 21:19:18,681 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 21:19:18,683 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 21:19:18,686 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 21:19:18,692 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 21:19:18,694 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 21:19:18,696 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 21:19:18,698 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 21:19:18,701 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 21:19:18,703 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 21:19:19,043 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 21:19:19,163 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:19:19,163 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:19:19,163 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 21:19:19,164 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:19,164 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:19:19,164 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:19,164 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:19,165 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:19,165 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:19:19,165 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:19:19,166 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:19,166 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 21:19:19,166 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:19,167 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 21:19:19,167 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:19,167 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:19,169 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 21:19:19,170 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:19:19,184 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:19,184 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 21:19:19,185 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:19,185 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:19,185 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:19,185 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:19,186 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:19:19,186 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:19:19,190 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:19,190 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 21:19:19,190 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:19,191 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:19,191 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:19,191 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:19,192 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:19:19,192 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:19:19,194 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:19,194 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 21:19:19,195 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:19,195 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:19,195 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:19,195 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:19,197 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:19:19,198 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:19:19,242 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:19:19,287 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 21:19:19,287 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 21:19:19,287 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:19:19,288 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:19:19,289 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:19:19,289 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 21:19:19,311 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 21:19:19,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:19,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:19:19,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:19:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:19,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:19:19,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:19:19,363 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 21:19:19,364 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 21:19:19,364 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-15 21:19:19,385 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 23 states and 34 transitions. Complement of second has 6 states. [2019-11-15 21:19:19,388 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 21:19:19,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:19:19,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2019-11-15 21:19:19,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 21:19:19,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:19:19,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-15 21:19:19,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:19:19,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-15 21:19:19,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:19:19,390 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 34 transitions. [2019-11-15 21:19:19,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:19:19,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 17 states and 24 transitions. [2019-11-15 21:19:19,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-15 21:19:19,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 21:19:19,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2019-11-15 21:19:19,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:19:19,393 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-15 21:19:19,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2019-11-15 21:19:19,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-15 21:19:19,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 21:19:19,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2019-11-15 21:19:19,396 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-15 21:19:19,396 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-15 21:19:19,396 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 21:19:19,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2019-11-15 21:19:19,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:19:19,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:19:19,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:19:19,398 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:19:19,398 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:19:19,398 INFO L791 eck$LassoCheckResult]: Stem: 266#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 263#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 264#L528 assume !(main_~length1~0 < 1); 255#L528-2 assume !(main_~length2~0 < 1); 256#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 259#L537-3 assume !(main_~i~0 < main_~length1~0 - 1); 260#L537-4 main_~i~1 := 0; 261#L541-3 assume !(main_~i~1 < main_~length2~0 - 1); 253#L541-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);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_#t~post4.base, cstrspn_#t~post4.offset, cstrspn_#t~mem5, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~p~0.base, cstrspn_~p~0.offset, cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset, cstrspn_~c~0, cstrspn_~sc~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset;havoc cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;havoc cstrspn_~c~0;havoc cstrspn_~sc~0; 254#L522 [2019-11-15 21:19:19,398 INFO L793 eck$LassoCheckResult]: Loop: 254#L522 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;havoc cstrspn_#t~mem3;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 262#L520-3 cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; 267#L520-1 assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5; 265#L521 assume cstrspn_~sc~0 == cstrspn_~c~0; 254#L522 [2019-11-15 21:19:19,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:19,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2019-11-15 21:19:19,399 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:19,399 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166597641] [2019-11-15 21:19:19,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:19,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:19,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:19,448 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:19:19,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:19,448 INFO L82 PathProgramCache]: Analyzing trace with hash 2312936, now seen corresponding path program 1 times [2019-11-15 21:19:19,448 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:19,448 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988736250] [2019-11-15 21:19:19,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:19,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:19,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:19,472 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:19:19,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:19,473 INFO L82 PathProgramCache]: Analyzing trace with hash -587636803, now seen corresponding path program 1 times [2019-11-15 21:19:19,473 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:19,473 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170468333] [2019-11-15 21:19:19,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:19,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:19,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:19,701 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 21:19:19,701 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170468333] [2019-11-15 21:19:19,702 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:19,702 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 21:19:19,702 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000627032] [2019-11-15 21:19:19,815 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:19,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:19:19,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:19:19,818 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand 9 states. [2019-11-15 21:19:19,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:19,959 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2019-11-15 21:19:19,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:19:19,960 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. [2019-11-15 21:19:19,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:19:19,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 18 states and 24 transitions. [2019-11-15 21:19:19,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 21:19:19,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 21:19:19,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2019-11-15 21:19:19,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:19:19,962 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-11-15 21:19:19,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2019-11-15 21:19:19,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-15 21:19:19,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 21:19:19,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-11-15 21:19:19,964 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-15 21:19:19,964 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-15 21:19:19,964 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 21:19:19,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-11-15 21:19:19,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:19:19,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:19:19,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:19:19,969 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:19:19,969 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:19:19,969 INFO L791 eck$LassoCheckResult]: Stem: 325#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 322#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 323#L528 assume !(main_~length1~0 < 1); 314#L528-2 assume !(main_~length2~0 < 1); 315#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 318#L537-3 assume !(main_~i~0 < main_~length1~0 - 1); 319#L537-4 main_~i~1 := 0; 320#L541-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 327#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 328#L541-3 assume !(main_~i~1 < main_~length2~0 - 1); 312#L541-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);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_#t~post4.base, cstrspn_#t~post4.offset, cstrspn_#t~mem5, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~p~0.base, cstrspn_~p~0.offset, cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset, cstrspn_~c~0, cstrspn_~sc~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset;havoc cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;havoc cstrspn_~c~0;havoc cstrspn_~sc~0; 313#L522 [2019-11-15 21:19:19,969 INFO L793 eck$LassoCheckResult]: Loop: 313#L522 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;havoc cstrspn_#t~mem3;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 321#L520-3 cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; 326#L520-1 assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5; 324#L521 assume cstrspn_~sc~0 == cstrspn_~c~0; 313#L522 [2019-11-15 21:19:19,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:19,971 INFO L82 PathProgramCache]: Analyzing trace with hash -2087704584, now seen corresponding path program 1 times [2019-11-15 21:19:19,971 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:19,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074501755] [2019-11-15 21:19:19,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:19,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:19,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:20,002 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:19:20,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:20,002 INFO L82 PathProgramCache]: Analyzing trace with hash 2312936, now seen corresponding path program 2 times [2019-11-15 21:19:20,003 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:20,005 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285537319] [2019-11-15 21:19:20,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:20,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:20,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:20,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:20,021 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:19:20,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:20,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1860214623, now seen corresponding path program 1 times [2019-11-15 21:19:20,022 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:20,023 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722338319] [2019-11-15 21:19:20,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:20,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:20,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:20,193 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 21:19:20,193 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722338319] [2019-11-15 21:19:20,194 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:19:20,194 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:19:20,194 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341837151] [2019-11-15 21:19:20,299 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:20,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:19:20,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:19:20,299 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 9 Second operand 8 states. [2019-11-15 21:19:20,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:20,439 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2019-11-15 21:19:20,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:19:20,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2019-11-15 21:19:20,440 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-15 21:19:20,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 36 transitions. [2019-11-15 21:19:20,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-15 21:19:20,442 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-15 21:19:20,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 36 transitions. [2019-11-15 21:19:20,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:19:20,442 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-11-15 21:19:20,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 36 transitions. [2019-11-15 21:19:20,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2019-11-15 21:19:20,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-15 21:19:20,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-15 21:19:20,445 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-15 21:19:20,445 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-15 21:19:20,445 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 21:19:20,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2019-11-15 21:19:20,446 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 21:19:20,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:19:20,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:19:20,446 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:19:20,446 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:19:20,447 INFO L791 eck$LassoCheckResult]: Stem: 395#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 391#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 392#L528 assume !(main_~length1~0 < 1); 381#L528-2 assume !(main_~length2~0 < 1); 382#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 385#L537-3 assume !(main_~i~0 < main_~length1~0 - 1); 386#L537-4 main_~i~1 := 0; 388#L541-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 398#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 399#L541-3 assume !(main_~i~1 < main_~length2~0 - 1); 379#L541-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);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_#t~post4.base, cstrspn_#t~post4.offset, cstrspn_#t~mem5, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~p~0.base, cstrspn_~p~0.offset, cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset, cstrspn_~c~0, cstrspn_~sc~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset;havoc cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;havoc cstrspn_~c~0;havoc cstrspn_~sc~0; 380#L522 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;havoc cstrspn_#t~mem3;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 394#L520-3 [2019-11-15 21:19:20,447 INFO L793 eck$LassoCheckResult]: Loop: 394#L520-3 cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; 400#L520-1 assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5; 393#L521 assume !(cstrspn_~sc~0 == cstrspn_~c~0); 394#L520-3 [2019-11-15 21:19:20,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:20,447 INFO L82 PathProgramCache]: Analyzing trace with hash -294332619, now seen corresponding path program 1 times [2019-11-15 21:19:20,451 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:20,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553298065] [2019-11-15 21:19:20,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:20,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:20,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:20,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:20,484 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:19:20,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:20,485 INFO L82 PathProgramCache]: Analyzing trace with hash 78613, now seen corresponding path program 1 times [2019-11-15 21:19:20,485 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:20,485 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708799007] [2019-11-15 21:19:20,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:20,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:20,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:20,491 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:19:20,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:20,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1860214625, now seen corresponding path program 1 times [2019-11-15 21:19:20,492 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:20,492 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793130418] [2019-11-15 21:19:20,492 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:20,492 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:20,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:20,527 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:19:21,022 WARN L191 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 120 [2019-11-15 21:19:21,213 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-11-15 21:19:21,216 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:19:21,216 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:19:21,217 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:19:21,217 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:19:21,217 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:19:21,217 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:19:21,217 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:19:21,217 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:19:21,217 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrspn-alloca-2.i_Iteration5_Lasso [2019-11-15 21:19:21,217 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:19:21,217 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:19:21,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:19:21,227 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 21:19:21,231 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 21:19:21,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:19:21,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:19:21,236 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 21:19:21,240 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 21:19:21,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:19:21,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:19:21,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:19:21,635 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 89 [2019-11-15 21:19:21,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:19:21,733 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 21:19:21,738 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 21:19:21,739 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 21:19:21,741 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 21:19:21,743 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 21:19:21,744 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 21:19:21,746 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 21:19:21,747 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 21:19:21,750 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 21:19:21,752 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 21:19:21,756 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 21:19:21,890 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-11-15 21:19:22,606 WARN L191 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 21:19:22,666 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:19:22,666 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:19:22,666 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 21:19:22,667 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:22,667 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:19:22,667 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:22,667 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:22,667 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:22,668 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:19:22,668 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:19:22,668 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:22,668 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 21:19:22,669 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:22,669 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:22,669 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:22,669 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:22,670 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:19:22,670 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:19:22,674 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:22,674 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 21:19:22,674 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:22,674 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:19:22,675 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:22,675 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:22,675 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:22,675 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:19:22,675 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:19:22,675 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:22,676 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 21:19:22,676 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:22,676 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:19:22,676 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:22,676 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:22,676 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:22,677 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:19:22,677 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:19:22,677 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:22,677 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 21:19:22,678 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:22,678 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:19:22,678 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:22,678 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:22,678 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:22,678 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:19:22,678 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:19:22,679 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:22,679 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 21:19:22,679 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:22,679 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:19:22,680 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:22,680 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:22,680 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:22,680 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:19:22,680 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:19:22,681 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:22,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 21:19:22,681 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:22,681 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:22,681 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:22,682 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:22,682 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:19:22,682 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:19:22,684 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:22,684 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 21:19:22,685 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:22,685 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:19:22,685 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:22,685 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:22,685 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:22,686 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:19:22,686 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:19:22,686 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:22,686 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 21:19:22,687 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:22,687 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:22,687 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:22,687 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:22,688 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:19:22,688 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:19:22,689 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:22,689 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 21:19:22,690 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:22,690 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:22,690 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:22,690 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:22,691 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:19:22,691 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:19:22,692 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:22,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 21:19:22,693 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:22,693 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:22,693 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:22,693 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:22,697 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:19:22,698 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:19:22,720 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:19:22,758 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 21:19:22,759 INFO L444 ModelExtractionUtils]: 43 out of 49 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 21:19:22,759 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:19:22,760 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:19:22,760 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:19:22,760 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrspn_~spanp~0.base)_1, ULTIMATE.start_cstrspn_~spanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrspn_~spanp~0.base)_1 - 1*ULTIMATE.start_cstrspn_~spanp~0.offset Supporting invariants [] [2019-11-15 21:19:22,834 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2019-11-15 21:19:22,836 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 21:19:22,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:22,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:19:22,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:19:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:22,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 21:19:22,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:19:22,909 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 21:19:22,909 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 21:19:22,909 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 33 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-11-15 21:19:22,922 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 33 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 38 states and 46 transitions. Complement of second has 5 states. [2019-11-15 21:19:22,923 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 21:19:22,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:19:22,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2019-11-15 21:19:22,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 12 letters. Loop has 3 letters. [2019-11-15 21:19:22,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:19:22,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-15 21:19:22,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:19:22,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 12 letters. Loop has 6 letters. [2019-11-15 21:19:22,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:19:22,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 46 transitions. [2019-11-15 21:19:22,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:19:22,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 24 states and 30 transitions. [2019-11-15 21:19:22,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-15 21:19:22,927 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 21:19:22,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2019-11-15 21:19:22,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:19:22,927 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-11-15 21:19:22,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2019-11-15 21:19:22,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-11-15 21:19:22,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-15 21:19:22,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2019-11-15 21:19:22,930 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-15 21:19:22,930 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-15 21:19:22,930 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 21:19:22,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2019-11-15 21:19:22,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:19:22,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:19:22,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:19:22,937 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:19:22,937 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:19:22,937 INFO L791 eck$LassoCheckResult]: Stem: 605#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 599#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 600#L528 assume !(main_~length1~0 < 1); 591#L528-2 assume !(main_~length2~0 < 1); 592#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 595#L537-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 593#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 594#L537-3 assume !(main_~i~0 < main_~length1~0 - 1); 596#L537-4 main_~i~1 := 0; 597#L541-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 609#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 610#L541-3 assume !(main_~i~1 < main_~length2~0 - 1); 589#L541-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);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_#t~post4.base, cstrspn_#t~post4.offset, cstrspn_#t~mem5, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~p~0.base, cstrspn_~p~0.offset, cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset, cstrspn_~c~0, cstrspn_~sc~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset;havoc cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;havoc cstrspn_~c~0;havoc cstrspn_~sc~0; 590#L522 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;havoc cstrspn_#t~mem3;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 598#L520-3 cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; 608#L520-1 assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5; 601#L521 assume cstrspn_~sc~0 == cstrspn_~c~0; 602#L522 [2019-11-15 21:19:22,937 INFO L793 eck$LassoCheckResult]: Loop: 602#L522 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;havoc cstrspn_#t~mem3;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 611#L520-3 cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; 606#L520-1 assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5; 607#L521 assume cstrspn_~sc~0 == cstrspn_~c~0; 602#L522 [2019-11-15 21:19:22,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:22,937 INFO L82 PathProgramCache]: Analyzing trace with hash -796682687, now seen corresponding path program 1 times [2019-11-15 21:19:22,937 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:22,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859452609] [2019-11-15 21:19:22,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:22,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:22,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:22,962 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:19:22,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:22,962 INFO L82 PathProgramCache]: Analyzing trace with hash 2312936, now seen corresponding path program 3 times [2019-11-15 21:19:22,962 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:22,962 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823838476] [2019-11-15 21:19:22,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:22,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:22,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:22,969 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:19:22,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:22,969 INFO L82 PathProgramCache]: Analyzing trace with hash 477217064, now seen corresponding path program 2 times [2019-11-15 21:19:22,969 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:22,969 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843715603] [2019-11-15 21:19:22,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:22,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:22,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:23,194 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:19:23,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843715603] [2019-11-15 21:19:23,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157404338] [2019-11-15 21:19:23,195 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2b0cf942-4df7-451d-ab2f-a206eb6ab795/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:19:23,292 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:19:23,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:19:23,294 WARN L254 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 77 conjunts are in the unsatisfiable core [2019-11-15 21:19:23,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:19:23,472 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:19:23,492 INFO L341 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2019-11-15 21:19:23,492 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 20 [2019-11-15 21:19:23,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:19:23,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:19:23,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:19:23,519 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:38 [2019-11-15 21:19:23,786 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:19:23,786 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:19:23,797 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-11-15 21:19:23,798 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 28 [2019-11-15 21:19:23,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:19:23,815 INFO L567 ElimStorePlain]: treesize reduction 8, result has 71.4 percent of original size [2019-11-15 21:19:23,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:19:23,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:53, output treesize:8 [2019-11-15 21:19:23,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:19:23,841 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:19:23,841 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15] total 23 [2019-11-15 21:19:23,841 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382578246] [2019-11-15 21:19:23,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:19:23,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-15 21:19:23,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2019-11-15 21:19:23,940 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. cyclomatic complexity: 10 Second operand 24 states. [2019-11-15 21:19:25,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:19:25,468 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2019-11-15 21:19:25,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-15 21:19:25,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 77 transitions. [2019-11-15 21:19:25,470 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-15 21:19:25,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 65 states and 77 transitions. [2019-11-15 21:19:25,471 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2019-11-15 21:19:25,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2019-11-15 21:19:25,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 77 transitions. [2019-11-15 21:19:25,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:19:25,472 INFO L688 BuchiCegarLoop]: Abstraction has 65 states and 77 transitions. [2019-11-15 21:19:25,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 77 transitions. [2019-11-15 21:19:25,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 40. [2019-11-15 21:19:25,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-15 21:19:25,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2019-11-15 21:19:25,477 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2019-11-15 21:19:25,477 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2019-11-15 21:19:25,477 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 21:19:25,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2019-11-15 21:19:25,478 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 21:19:25,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:19:25,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:19:25,479 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:19:25,479 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:19:25,480 INFO L791 eck$LassoCheckResult]: Stem: 833#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 828#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 829#L528 assume !(main_~length1~0 < 1); 816#L528-2 assume !(main_~length2~0 < 1); 817#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 820#L537-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 821#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 822#L537-3 assume !(main_~i~0 < main_~length1~0 - 1); 823#L537-4 main_~i~1 := 0; 841#L541-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 838#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 839#L541-3 assume !(main_~i~1 < main_~length2~0 - 1); 814#L541-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);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_#t~post4.base, cstrspn_#t~post4.offset, cstrspn_#t~mem5, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~p~0.base, cstrspn_~p~0.offset, cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset, cstrspn_~c~0, cstrspn_~sc~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset;havoc cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;havoc cstrspn_~c~0;havoc cstrspn_~sc~0; 815#L522 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;havoc cstrspn_#t~mem3;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 842#L520-3 cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; 836#L520-1 assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5; 837#L521 assume cstrspn_~sc~0 == cstrspn_~c~0; 826#L522 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;havoc cstrspn_#t~mem3;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 827#L520-3 [2019-11-15 21:19:25,480 INFO L793 eck$LassoCheckResult]: Loop: 827#L520-3 cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; 840#L520-1 assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5; 830#L521 assume !(cstrspn_~sc~0 == cstrspn_~c~0); 827#L520-3 [2019-11-15 21:19:25,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:25,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1072640524, now seen corresponding path program 3 times [2019-11-15 21:19:25,480 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:25,481 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293206910] [2019-11-15 21:19:25,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:25,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:25,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:25,515 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:19:25,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:25,515 INFO L82 PathProgramCache]: Analyzing trace with hash 78613, now seen corresponding path program 2 times [2019-11-15 21:19:25,516 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:25,516 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58813839] [2019-11-15 21:19:25,516 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:25,516 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:25,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:25,521 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:19:25,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:25,521 INFO L82 PathProgramCache]: Analyzing trace with hash 477217066, now seen corresponding path program 1 times [2019-11-15 21:19:25,521 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:25,521 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960109865] [2019-11-15 21:19:25,522 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:25,522 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:25,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:25,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:25,556 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:19:26,570 WARN L191 SmtUtils]: Spent 958.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 166 [2019-11-15 21:19:26,843 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2019-11-15 21:19:26,845 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:19:26,845 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:19:26,845 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:19:26,845 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:19:26,845 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:19:26,845 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:19:26,845 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:19:26,845 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:19:26,845 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrspn-alloca-2.i_Iteration7_Lasso [2019-11-15 21:19:26,846 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:19:26,846 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:19:26,848 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 21:19:26,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:19:26,855 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 21:19:26,857 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 21:19:26,859 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 21:19:26,867 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 21:19:26,871 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 21:19:26,873 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 21:19:26,875 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 21:19:27,513 WARN L191 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 112 [2019-11-15 21:19:27,661 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-11-15 21:19:27,661 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 21:19:27,663 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 21:19:27,664 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 21:19:27,666 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 21:19:27,670 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 21:19:27,672 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 21:19:27,674 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 21:19:27,675 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 21:19:27,676 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 21:19:27,678 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 21:19:27,679 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 21:19:27,680 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 21:19:27,895 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-15 21:19:28,370 WARN L191 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 21:19:28,504 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-15 21:19:28,732 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:19:28,733 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:19:28,733 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:19:28,734 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:28,734 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:19:28,734 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:28,734 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:28,734 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:28,734 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:19:28,735 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:19:28,735 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:28,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:19:28,736 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:28,736 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:19:28,736 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:28,736 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:28,736 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:28,736 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:19:28,737 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:19:28,737 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:28,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:19:28,737 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:28,737 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:19:28,738 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:28,738 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:28,738 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:28,738 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:19:28,738 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:19:28,738 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:28,739 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:19:28,739 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:28,739 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:28,739 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:28,739 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:28,740 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:19:28,740 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:19:28,741 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:28,741 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:19:28,741 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:28,741 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:19:28,742 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:28,742 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:28,742 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:28,742 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:19:28,742 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:19:28,742 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:28,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:19:28,743 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:28,743 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:19:28,745 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:28,745 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:28,745 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:28,745 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:19:28,745 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:19:28,746 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:28,746 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 21:19:28,747 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:28,747 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:19:28,747 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:28,747 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:28,747 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:28,747 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:19:28,748 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:19:28,748 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:28,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 21:19:28,749 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:28,749 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:28,749 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:28,749 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:28,750 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:19:28,750 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:19:28,751 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:28,752 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:19:28,752 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:28,752 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:28,752 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:28,752 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:28,753 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:19:28,753 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:19:28,754 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:28,755 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 21:19:28,755 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:28,755 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 21:19:28,756 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:28,756 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:28,759 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 21:19:28,759 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:19:28,776 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:28,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:19:28,777 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:28,778 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:28,778 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:28,778 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:28,779 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:19:28,779 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:19:28,780 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:28,780 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:19:28,781 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:28,781 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:28,781 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:28,781 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:28,785 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:19:28,785 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:19:28,825 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:19:28,894 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-15 21:19:28,894 INFO L444 ModelExtractionUtils]: 56 out of 64 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-11-15 21:19:28,894 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:19:28,895 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:19:28,895 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:19:28,895 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~spanp~0.offset, v_rep(select #length ULTIMATE.start_cstrspn_~spanp~0.base)_2) = -1*ULTIMATE.start_cstrspn_~spanp~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrspn_~spanp~0.base)_2 Supporting invariants [] [2019-11-15 21:19:29,083 INFO L297 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2019-11-15 21:19:29,084 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 21:19:29,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:29,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:19:29,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:19:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:29,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 21:19:29,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:19:29,157 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 21:19:29,157 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 21:19:29,157 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 16 Second operand 3 states. [2019-11-15 21:19:29,173 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 16. Second operand 3 states. Result 49 states and 58 transitions. Complement of second has 5 states. [2019-11-15 21:19:29,174 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 21:19:29,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:19:29,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2019-11-15 21:19:29,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-15 21:19:29,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:19:29,175 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:19:29,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:29,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:19:29,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:19:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:29,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 21:19:29,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:19:29,251 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 21:19:29,252 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:19:29,252 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 16 Second operand 3 states. [2019-11-15 21:19:29,273 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 16. Second operand 3 states. Result 49 states and 60 transitions. Complement of second has 5 states. [2019-11-15 21:19:29,275 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 21:19:29,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:19:29,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2019-11-15 21:19:29,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-15 21:19:29,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:19:29,276 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:19:29,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:29,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:19:29,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:19:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:29,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 21:19:29,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:19:29,357 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 21:19:29,357 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:19:29,358 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 16 Second operand 3 states. [2019-11-15 21:19:29,368 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 16. Second operand 3 states. Result 54 states and 64 transitions. Complement of second has 4 states. [2019-11-15 21:19:29,369 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 21:19:29,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:19:29,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2019-11-15 21:19:29,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-15 21:19:29,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:19:29,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 21 letters. Loop has 3 letters. [2019-11-15 21:19:29,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:19:29,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 18 letters. Loop has 6 letters. [2019-11-15 21:19:29,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:19:29,371 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 64 transitions. [2019-11-15 21:19:29,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 21:19:29,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 27 states and 33 transitions. [2019-11-15 21:19:29,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 21:19:29,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-15 21:19:29,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 33 transitions. [2019-11-15 21:19:29,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:19:29,373 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-11-15 21:19:29,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 33 transitions. [2019-11-15 21:19:29,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2019-11-15 21:19:29,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-15 21:19:29,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2019-11-15 21:19:29,375 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-11-15 21:19:29,375 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-11-15 21:19:29,375 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 21:19:29,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2019-11-15 21:19:29,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 21:19:29,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:19:29,379 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:19:29,380 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:19:29,380 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:19:29,380 INFO L791 eck$LassoCheckResult]: Stem: 1403#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1398#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 1399#L528 assume !(main_~length1~0 < 1); 1389#L528-2 assume !(main_~length2~0 < 1); 1390#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 1393#L537-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 1391#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 1392#L537-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 1394#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 1407#L537-3 assume !(main_~i~0 < main_~length1~0 - 1); 1395#L537-4 main_~i~1 := 0; 1396#L541-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 1405#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 1406#L541-3 assume !(main_~i~1 < main_~length2~0 - 1); 1387#L541-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);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_#t~post4.base, cstrspn_#t~post4.offset, cstrspn_#t~mem5, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~p~0.base, cstrspn_~p~0.offset, cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset, cstrspn_~c~0, cstrspn_~sc~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset;havoc cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;havoc cstrspn_~c~0;havoc cstrspn_~sc~0; 1388#L522 [2019-11-15 21:19:29,380 INFO L793 eck$LassoCheckResult]: Loop: 1388#L522 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;havoc cstrspn_#t~mem3;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 1397#L520-3 cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; 1404#L520-1 assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5; 1400#L521 assume cstrspn_~sc~0 == cstrspn_~c~0; 1388#L522 [2019-11-15 21:19:29,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:29,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1523394364, now seen corresponding path program 1 times [2019-11-15 21:19:29,381 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:29,382 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122268839] [2019-11-15 21:19:29,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:29,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:29,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:29,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:29,406 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:19:29,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:29,407 INFO L82 PathProgramCache]: Analyzing trace with hash 2312936, now seen corresponding path program 4 times [2019-11-15 21:19:29,407 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:29,407 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900573942] [2019-11-15 21:19:29,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:29,408 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:29,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:29,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:29,413 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:19:29,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:29,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1430543523, now seen corresponding path program 4 times [2019-11-15 21:19:29,414 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:19:29,414 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50377352] [2019-11-15 21:19:29,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:29,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:19:29,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:19:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:19:29,452 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:19:30,356 WARN L191 SmtUtils]: Spent 800.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 128 [2019-11-15 21:19:30,547 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-11-15 21:19:30,549 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:19:30,550 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:19:30,550 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:19:30,550 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:19:30,550 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:19:30,550 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:19:30,550 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:19:30,550 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:19:30,550 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrspn-alloca-2.i_Iteration8_Lasso [2019-11-15 21:19:30,550 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:19:30,550 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:19:30,553 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 21:19:30,559 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 21:19:30,561 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 21:19:30,562 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 21:19:30,564 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 21:19:30,565 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 21:19:30,567 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 21:19:30,568 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 21:19:30,570 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 21:19:30,571 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 21:19:30,573 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 21:19:30,926 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2019-11-15 21:19:31,053 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 21:19:31,055 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 21:19:31,060 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 21:19:31,063 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 21:19:31,065 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 21:19:31,066 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 21:19:31,068 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 21:19:31,070 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 21:19:31,072 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 21:19:31,073 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 21:19:31,647 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-11-15 21:19:31,777 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:19:31,777 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:19:31,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:19:31,778 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:31,778 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:19:31,778 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:31,778 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:31,778 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:31,779 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:19:31,779 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:19:31,779 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:31,779 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 21:19:31,780 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:31,780 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:19:31,780 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:31,780 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:31,780 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:31,780 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:19:31,780 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:19:31,780 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:31,781 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 21:19:31,781 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:31,781 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:19:31,781 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:31,782 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:31,782 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:31,782 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:19:31,782 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:19:31,782 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:31,783 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 21:19:31,783 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:31,784 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:19:31,784 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:31,784 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:31,784 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:31,784 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:19:31,784 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:19:31,785 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:31,785 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 21:19:31,786 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:31,786 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:19:31,786 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:31,786 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:31,786 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:31,787 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:19:31,787 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:19:31,787 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:31,787 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 21:19:31,788 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:31,788 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:31,788 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:31,788 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:31,789 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:19:31,789 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:19:31,790 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:31,790 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 21:19:31,791 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:31,791 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:19:31,791 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:31,791 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:31,792 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:31,792 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:19:31,792 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:19:31,792 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:31,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:19:31,793 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:31,793 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:19:31,793 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:31,794 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:31,794 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:31,794 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:19:31,794 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:19:31,795 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:31,795 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 21:19:31,795 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:31,796 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:19:31,796 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:31,796 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:31,796 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:31,796 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:19:31,796 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:19:31,797 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:31,797 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 21:19:31,797 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:31,798 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:31,798 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:31,798 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:31,799 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:19:31,799 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:19:31,800 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:31,801 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 21:19:31,801 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:31,801 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:19:31,801 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:31,801 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 21:19:31,802 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:31,802 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:19:31,802 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:19:31,805 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:31,805 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 21:19:31,806 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:31,806 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:31,806 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:31,806 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:31,807 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:19:31,807 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:19:31,808 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:31,808 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 21:19:31,809 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:31,809 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 21:19:31,809 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:31,809 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:31,812 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 21:19:31,812 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:19:31,831 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:19:31,832 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 21:19:31,833 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:19:31,833 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:19:31,833 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:19:31,834 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:19:31,844 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:19:31,845 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:19:31,862 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:19:31,882 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-11-15 21:19:31,883 INFO L444 ModelExtractionUtils]: 26 out of 34 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-11-15 21:19:31,884 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:19:31,884 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:19:31,885 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:19:31,885 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrspn_~p~0.base)_2, ULTIMATE.start_cstrspn_~p~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrspn_~p~0.base)_2 - 1*ULTIMATE.start_cstrspn_~p~0.offset Supporting invariants [] [2019-11-15 21:19:31,957 INFO L297 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2019-11-15 21:19:31,958 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 21:19:31,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:19:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:31,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:19:31,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:19:32,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:19:32,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:19:32,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:19:32,020 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 21:19:32,020 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 21:19:32,020 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-15 21:19:32,028 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 28 states and 35 transitions. Complement of second has 4 states. [2019-11-15 21:19:32,029 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 21:19:32,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:19:32,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2019-11-15 21:19:32,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-15 21:19:32,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:19:32,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 19 letters. Loop has 4 letters. [2019-11-15 21:19:32,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:19:32,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 15 letters. Loop has 8 letters. [2019-11-15 21:19:32,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:19:32,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2019-11-15 21:19:32,031 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:19:32,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2019-11-15 21:19:32,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 21:19:32,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 21:19:32,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 21:19:32,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:19:32,032 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:19:32,032 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:19:32,032 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:19:32,032 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 21:19:32,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:19:32,032 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:19:32,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 21:19:32,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 09:19:32 BoogieIcfgContainer [2019-11-15 21:19:32,038 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 21:19:32,038 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:19:32,038 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:19:32,038 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:19:32,039 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:19:16" (3/4) ... [2019-11-15 21:19:32,043 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 21:19:32,043 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:19:32,044 INFO L168 Benchmark]: Toolchain (without parser) took 16987.95 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 283.1 MB). Free memory was 939.4 MB in the beginning and 892.1 MB in the end (delta: 47.3 MB). Peak memory consumption was 330.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:19:32,044 INFO L168 Benchmark]: CDTParser took 3.75 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:19:32,046 INFO L168 Benchmark]: CACSL2BoogieTranslator took 620.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -201.5 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:19:32,047 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.80 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 21:19:32,048 INFO L168 Benchmark]: Boogie Preprocessor took 57.45 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:19:32,052 INFO L168 Benchmark]: RCFGBuilder took 403.17 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 21:19:32,052 INFO L168 Benchmark]: BuchiAutomizer took 15832.97 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 124.8 MB). Free memory was 1.1 GB in the beginning and 892.1 MB in the end (delta: 219.7 MB). Peak memory consumption was 344.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:19:32,053 INFO L168 Benchmark]: Witness Printer took 4.72 ms. Allocated memory is still 1.3 GB. Free memory is still 892.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:19:32,055 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.75 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 620.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -201.5 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.80 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 57.45 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 403.17 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 15832.97 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 124.8 MB). Free memory was 1.1 GB in the beginning and 892.1 MB in the end (delta: 219.7 MB). Peak memory consumption was 344.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.72 ms. Allocated memory is still 1.3 GB. Free memory is still 892.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * nondetString1 + unknown-#length-unknown[nondetString1] + -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 unknown-#length-unknown[spanp] + -1 * spanp and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[p] + -1 * p and consists of 3 locations. One nondeterministic module has affine ranking function -1 * spanp + unknown-#length-unknown[spanp] and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 24 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.7s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 13.1s. Construction of modules took 0.5s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 36 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 40 states and ocurred in iteration 6. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 167 SDtfs, 362 SDslu, 277 SDs, 0 SdLazy, 398 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital273 mio100 ax108 hnf99 lsp87 ukn71 mio100 lsp45 div100 bol100 ite100 ukn100 eq185 hnf85 smp95 dnf186 smp96 tf100 neg95 sie117 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 51ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...