./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/cstrspn-alloca-1.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_00ae7af0-70c5-445c-b555-8ebf6d279993/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_00ae7af0-70c5-445c-b555-8ebf6d279993/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_00ae7af0-70c5-445c-b555-8ebf6d279993/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_00ae7af0-70c5-445c-b555-8ebf6d279993/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrspn-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_00ae7af0-70c5-445c-b555-8ebf6d279993/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_00ae7af0-70c5-445c-b555-8ebf6d279993/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 646417a8dd8807492175439f0c109786ec3887ae ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 19:54:49,229 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 19:54:49,230 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 19:54:49,241 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 19:54:49,241 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 19:54:49,242 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 19:54:49,243 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 19:54:49,245 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 19:54:49,247 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 19:54:49,248 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 19:54:49,254 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 19:54:49,256 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 19:54:49,256 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 19:54:49,257 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 19:54:49,258 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 19:54:49,259 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 19:54:49,260 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 19:54:49,260 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 19:54:49,262 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 19:54:49,265 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 19:54:49,266 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 19:54:49,267 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 19:54:49,268 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 19:54:49,269 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 19:54:49,272 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 19:54:49,273 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 19:54:49,273 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 19:54:49,274 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 19:54:49,274 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 19:54:49,275 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 19:54:49,276 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 19:54:49,276 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 19:54:49,277 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 19:54:49,278 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 19:54:49,279 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 19:54:49,279 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 19:54:49,280 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 19:54:49,280 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 19:54:49,281 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 19:54:49,282 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 19:54:49,282 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 19:54:49,283 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_00ae7af0-70c5-445c-b555-8ebf6d279993/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 19:54:49,301 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 19:54:49,302 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 19:54:49,303 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 19:54:49,303 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 19:54:49,303 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 19:54:49,304 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 19:54:49,304 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 19:54:49,304 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 19:54:49,304 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 19:54:49,304 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 19:54:49,305 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 19:54:49,305 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 19:54:49,305 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 19:54:49,305 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 19:54:49,305 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 19:54:49,306 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 19:54:49,306 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 19:54:49,306 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 19:54:49,306 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 19:54:49,306 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 19:54:49,307 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 19:54:49,307 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 19:54:49,307 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 19:54:49,307 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 19:54:49,307 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 19:54:49,308 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 19:54:49,308 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 19:54:49,308 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 19:54:49,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 19:54:49,308 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 19:54:49,309 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 19:54:49,310 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 19:54:49,310 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_00ae7af0-70c5-445c-b555-8ebf6d279993/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 -> 646417a8dd8807492175439f0c109786ec3887ae [2019-11-15 19:54:49,335 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 19:54:49,345 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 19:54:49,349 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 19:54:49,350 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 19:54:49,350 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 19:54:49,351 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_00ae7af0-70c5-445c-b555-8ebf6d279993/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrspn-alloca-1.i [2019-11-15 19:54:49,403 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_00ae7af0-70c5-445c-b555-8ebf6d279993/bin/uautomizer/data/eef0ca61f/c2601e11a71d4d32885e32d0e55ed178/FLAG130ba8d86 [2019-11-15 19:54:49,806 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 19:54:49,807 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_00ae7af0-70c5-445c-b555-8ebf6d279993/sv-benchmarks/c/array-memsafety/cstrspn-alloca-1.i [2019-11-15 19:54:49,822 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_00ae7af0-70c5-445c-b555-8ebf6d279993/bin/uautomizer/data/eef0ca61f/c2601e11a71d4d32885e32d0e55ed178/FLAG130ba8d86 [2019-11-15 19:54:50,143 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_00ae7af0-70c5-445c-b555-8ebf6d279993/bin/uautomizer/data/eef0ca61f/c2601e11a71d4d32885e32d0e55ed178 [2019-11-15 19:54:50,147 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 19:54:50,149 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 19:54:50,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 19:54:50,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 19:54:50,155 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 19:54:50,156 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 07:54:50" (1/1) ... [2019-11-15 19:54:50,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77cc66d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:50, skipping insertion in model container [2019-11-15 19:54:50,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 07:54:50" (1/1) ... [2019-11-15 19:54:50,163 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 19:54:50,212 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 19:54:50,579 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 19:54:50,593 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 19:54:50,641 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 19:54:50,693 INFO L192 MainTranslator]: Completed translation [2019-11-15 19:54:50,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:50 WrapperNode [2019-11-15 19:54:50,694 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 19:54:50,697 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 19:54:50,697 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 19:54:50,697 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 19:54:50,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:50" (1/1) ... [2019-11-15 19:54:50,736 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:50" (1/1) ... [2019-11-15 19:54:50,764 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 19:54:50,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 19:54:50,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 19:54:50,765 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 19:54:50,773 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:50" (1/1) ... [2019-11-15 19:54:50,773 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:50" (1/1) ... [2019-11-15 19:54:50,776 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:50" (1/1) ... [2019-11-15 19:54:50,776 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:50" (1/1) ... [2019-11-15 19:54:50,785 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:50" (1/1) ... [2019-11-15 19:54:50,799 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:50" (1/1) ... [2019-11-15 19:54:50,803 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:50" (1/1) ... [2019-11-15 19:54:50,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 19:54:50,817 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 19:54:50,817 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 19:54:50,817 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 19:54:50,818 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00ae7af0-70c5-445c-b555-8ebf6d279993/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 19:54:50,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 19:54:50,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 19:54:50,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 19:54:50,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 19:54:50,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 19:54:50,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 19:54:51,200 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 19:54:51,200 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-15 19:54:51,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:54:51 BoogieIcfgContainer [2019-11-15 19:54:51,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 19:54:51,202 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 19:54:51,202 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 19:54:51,205 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 19:54:51,206 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 19:54:51,206 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 07:54:50" (1/3) ... [2019-11-15 19:54:51,207 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e72984b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 07:54:51, skipping insertion in model container [2019-11-15 19:54:51,207 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 19:54:51,207 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:50" (2/3) ... [2019-11-15 19:54:51,208 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e72984b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 07:54:51, skipping insertion in model container [2019-11-15 19:54:51,208 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 19:54:51,208 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:54:51" (3/3) ... [2019-11-15 19:54:51,209 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrspn-alloca-1.i [2019-11-15 19:54:51,250 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 19:54:51,250 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 19:54:51,250 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 19:54:51,250 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 19:54:51,250 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 19:54:51,250 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 19:54:51,250 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 19:54:51,250 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 19:54:51,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-11-15 19:54:51,282 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-15 19:54:51,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:54:51,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:54:51,288 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 19:54:51,288 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 19:54:51,289 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 19:54:51,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-11-15 19:54:51,291 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-15 19:54:51,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:54:51,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:54:51,291 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 19:54:51,291 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 19:54:51,299 INFO L791 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 13#L532true assume !(main_~length1~0 < 1); 18#L532-2true assume !(main_~length2~0 < 1); 9#L535-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 25#L541-3true [2019-11-15 19:54:51,299 INFO L793 eck$LassoCheckResult]: Loop: 25#L541-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 22#L541-2true main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 25#L541-3true [2019-11-15 19:54:51,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:51,304 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-15 19:54:51,312 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:51,312 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545381365] [2019-11-15 19:54:51,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:51,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:51,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:51,434 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:54:51,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:51,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2019-11-15 19:54:51,435 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:51,435 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125300909] [2019-11-15 19:54:51,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:51,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:51,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:51,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:51,452 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:54:51,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:51,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2019-11-15 19:54:51,453 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:51,454 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895727926] [2019-11-15 19:54:51,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:51,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:51,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:51,496 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:54:51,670 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-15 19:54:51,772 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 19:54:51,774 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 19:54:51,774 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 19:54:51,774 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 19:54:51,774 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 19:54:51,775 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:54:51,775 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 19:54:51,775 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 19:54:51,775 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-1.i_Iteration1_Lasso [2019-11-15 19:54:51,775 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 19:54:51,775 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 19:54:51,808 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 19:54:51,814 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 19:54:51,817 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 19:54:51,820 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 19:54:51,824 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 19:54:51,829 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 19:54:51,991 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-11-15 19:54:52,015 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 19:54:52,017 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 19:54:52,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:54:52,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:54:52,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:54:52,032 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 19:54:52,035 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 19:54:52,039 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 19:54:52,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:54:52,402 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 19:54:52,518 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 19:54:52,525 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 19:54:52,527 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 19:54:52,531 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:54:52,532 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:54:52,532 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:54:52,533 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:54:52,533 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:54:52,535 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:54:52,535 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:54:52,538 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:54:52,539 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 19:54:52,541 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:54:52,541 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:54:52,541 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:54:52,542 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:54:52,542 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:54:52,543 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:54:52,547 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:54:52,549 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:54:52,553 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 19:54:52,555 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:54:52,555 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:54:52,556 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:54:52,557 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:54:52,557 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:54:52,558 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:54:52,558 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:54:52,561 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:54:52,561 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 19:54:52,569 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:54:52,570 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:54:52,570 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:54:52,571 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:54:52,573 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:54:52,576 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:54:52,581 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:54:52,585 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 19:54:52,587 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:54:52,588 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:54:52,588 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:54:52,588 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:54:52,594 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:54:52,594 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:54:52,616 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:54:52,616 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 19:54:52,617 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:54:52,617 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:54:52,618 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:54:52,618 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:54:52,620 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:54:52,620 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:54:52,634 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:54:52,638 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:54:52,639 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:54:52,640 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:54:52,640 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:54:52,640 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:54:52,642 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:54:52,647 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:54:52,652 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:54:52,655 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 19:54:52,655 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:54:52,656 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:54:52,657 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:54:52,657 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:54:52,657 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:54:52,658 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:54:52,659 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:54:52,660 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:54:52,665 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 19:54:52,666 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:54:52,666 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 19:54:52,667 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:54:52,667 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:54:52,673 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 19:54:52,674 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:54:52,722 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:54:52,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:54:52,729 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:54:52,729 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:54:52,730 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:54:52,730 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:54:52,735 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:54:52,735 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:54:52,820 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 19:54:52,877 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 19:54:52,878 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 19:54:52,882 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 19:54:52,883 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 19:54:52,885 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 19:54:52,886 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~length1~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-15 19:54:52,903 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 19:54:52,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:52,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:52,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 19:54:52,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:54:52,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:52,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 19:54:52,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:54:52,985 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 19:54:53,001 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 19:54:53,002 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 3 states. [2019-11-15 19:54:53,067 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states.. Second operand 3 states. Result 60 states and 87 transitions. Complement of second has 7 states. [2019-11-15 19:54:53,070 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 19:54:53,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 19:54:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2019-11-15 19:54:53,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-15 19:54:53,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:54:53,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 19:54:53,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:54:53,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-15 19:54:53,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:54:53,078 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 87 transitions. [2019-11-15 19:54:53,084 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 19:54:53,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 20 states and 27 transitions. [2019-11-15 19:54:53,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-15 19:54:53,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-15 19:54:53,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2019-11-15 19:54:53,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 19:54:53,090 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-15 19:54:53,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2019-11-15 19:54:53,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-15 19:54:53,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-15 19:54:53,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2019-11-15 19:54:53,117 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-15 19:54:53,117 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-15 19:54:53,117 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 19:54:53,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2019-11-15 19:54:53,118 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 19:54:53,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:54:53,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:54:53,119 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:53,119 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 19:54:53,119 INFO L791 eck$LassoCheckResult]: Stem: 172#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 167#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 168#L532 assume !(main_~length1~0 < 1); 169#L532-2 assume !(main_~length2~0 < 1); 163#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 164#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 160#L541-4 main_~i~1 := 0; 161#L546-3 [2019-11-15 19:54:53,119 INFO L793 eck$LassoCheckResult]: Loop: 161#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 165#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 161#L546-3 [2019-11-15 19:54:53,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:53,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2019-11-15 19:54:53,120 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:53,120 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127644403] [2019-11-15 19:54:53,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:53,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:53,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:53,140 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:54:53,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:53,141 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2019-11-15 19:54:53,141 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:53,141 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408405691] [2019-11-15 19:54:53,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:53,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:53,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:53,161 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:54:53,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:53,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2019-11-15 19:54:53,168 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:53,168 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036363743] [2019-11-15 19:54:53,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:53,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:53,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:53,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:53,211 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:54:53,436 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 19:54:53,436 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 19:54:53,437 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 19:54:53,437 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 19:54:53,437 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 19:54:53,437 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:54:53,437 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 19:54:53,437 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 19:54:53,437 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-1.i_Iteration2_Lasso [2019-11-15 19:54:53,437 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 19:54:53,437 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 19:54:53,441 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 19:54:53,444 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 19:54:53,446 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 19:54:53,449 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 19:54:53,452 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 19:54:53,455 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 19:54:53,460 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 19:54:53,462 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 19:54:53,464 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 19:54:53,467 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 19:54:53,620 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-11-15 19:54:53,645 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 19:54:53,653 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 19:54:53,656 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 19:54:53,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:54:54,052 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 19:54:54,102 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 19:54:54,103 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 19:54:54,103 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 19:54:54,104 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:54:54,104 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:54:54,104 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:54:54,104 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:54:54,104 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:54:54,105 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:54:54,105 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:54:54,105 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:54:54,106 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 19:54:54,106 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:54:54,106 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:54:54,106 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:54:54,106 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:54:54,106 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:54:54,107 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:54:54,107 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:54:54,107 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:54:54,108 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 19:54:54,108 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:54:54,108 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:54:54,108 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:54:54,108 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:54:54,109 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:54:54,109 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:54:54,109 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:54:54,109 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:54:54,110 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 19:54:54,110 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:54:54,110 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:54:54,110 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:54:54,110 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:54:54,111 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:54:54,112 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:54:54,113 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:54:54,114 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 19:54:54,114 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:54:54,114 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:54:54,114 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:54:54,114 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:54:54,115 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:54:54,115 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:54:54,115 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:54:54,116 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:54:54,116 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 19:54:54,116 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:54:54,116 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:54:54,117 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:54:54,117 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:54:54,118 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:54:54,118 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:54:54,121 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:54:54,121 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:54:54,121 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:54:54,122 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:54:54,122 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:54:54,122 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:54:54,123 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:54:54,123 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:54:54,124 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:54:54,125 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 19:54:54,125 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:54:54,125 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:54:54,125 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:54:54,125 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:54:54,126 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:54:54,126 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:54:54,126 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:54:54,126 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:54:54,127 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 19:54:54,127 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:54:54,127 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:54:54,127 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:54:54,128 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:54:54,128 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:54:54,128 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:54:54,131 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:54:54,131 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:54:54,131 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:54:54,132 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:54:54,132 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:54:54,132 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:54:54,133 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:54:54,133 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:54:54,142 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:54:54,146 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 19:54:54,147 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:54:54,147 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:54:54,147 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:54:54,148 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:54:54,149 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:54:54,151 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:54:54,213 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 19:54:54,253 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 19:54:54,255 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 19:54:54,255 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 19:54:54,259 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 19:54:54,260 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 19:54:54,260 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1, ULTIMATE.start_main_~nondetString2~0.offset) = -1*ULTIMATE.start_main_~i~1 + 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1 - 1*ULTIMATE.start_main_~nondetString2~0.offset Supporting invariants [] [2019-11-15 19:54:54,291 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 19:54:54,293 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 19:54:54,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:54,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 19:54:54,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:54:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:54,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 19:54:54,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:54:54,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 19:54:54,357 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 19:54:54,357 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-15 19:54:54,395 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 31 states and 44 transitions. Complement of second has 6 states. [2019-11-15 19:54:54,396 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 19:54:54,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 19:54:54,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2019-11-15 19:54:54,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 19:54:54,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:54:54,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-15 19:54:54,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:54:54,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-15 19:54:54,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:54:54,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 44 transitions. [2019-11-15 19:54:54,399 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 19:54:54,400 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 29 transitions. [2019-11-15 19:54:54,400 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-15 19:54:54,400 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 19:54:54,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 29 transitions. [2019-11-15 19:54:54,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 19:54:54,401 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2019-11-15 19:54:54,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 29 transitions. [2019-11-15 19:54:54,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-15 19:54:54,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-15 19:54:54,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2019-11-15 19:54:54,403 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2019-11-15 19:54:54,403 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2019-11-15 19:54:54,403 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 19:54:54,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2019-11-15 19:54:54,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 19:54:54,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:54:54,405 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:54:54,405 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:54,405 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:54,406 INFO L791 eck$LassoCheckResult]: Stem: 298#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 293#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 294#L532 assume !(main_~length1~0 < 1); 295#L532-2 assume !(main_~length2~0 < 1); 288#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 289#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 285#L541-4 main_~i~1 := 0; 286#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 292#L546-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~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~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;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 284#L519-4 [2019-11-15 19:54:54,406 INFO L793 eck$LassoCheckResult]: Loop: 284#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 287#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 299#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 296#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 297#L522-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7; 281#L522-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 282#L524 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 283#L519-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 284#L519-4 [2019-11-15 19:54:54,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:54,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2019-11-15 19:54:54,407 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:54,407 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485958036] [2019-11-15 19:54:54,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:54,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:54,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:54,432 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:54:54,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:54,433 INFO L82 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 1 times [2019-11-15 19:54:54,433 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:54,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130560006] [2019-11-15 19:54:54,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:54,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:54,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:54,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:54,448 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:54:54,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:54,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1903570310, now seen corresponding path program 1 times [2019-11-15 19:54:54,449 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:54,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313748144] [2019-11-15 19:54:54,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:54,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:54,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:54,725 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 19:54:54,726 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313748144] [2019-11-15 19:54:54,726 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:54,727 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 19:54:54,727 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75733815] [2019-11-15 19:54:54,894 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-11-15 19:54:55,119 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-11-15 19:54:55,119 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:55,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 19:54:55,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 19:54:55,122 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. cyclomatic complexity: 11 Second operand 10 states. [2019-11-15 19:54:55,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:55,419 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2019-11-15 19:54:55,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 19:54:55,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 66 transitions. [2019-11-15 19:54:55,422 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-11-15 19:54:55,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 48 states and 64 transitions. [2019-11-15 19:54:55,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2019-11-15 19:54:55,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2019-11-15 19:54:55,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 64 transitions. [2019-11-15 19:54:55,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 19:54:55,425 INFO L688 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2019-11-15 19:54:55,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 64 transitions. [2019-11-15 19:54:55,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2019-11-15 19:54:55,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-15 19:54:55,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2019-11-15 19:54:55,429 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2019-11-15 19:54:55,429 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2019-11-15 19:54:55,429 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 19:54:55,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 44 transitions. [2019-11-15 19:54:55,430 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-11-15 19:54:55,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:54:55,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:54:55,430 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:55,430 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 19:54:55,431 INFO L791 eck$LassoCheckResult]: Stem: 402#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 396#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 397#L532 assume !(main_~length1~0 < 1); 398#L532-2 assume !(main_~length2~0 < 1); 390#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 391#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 408#L541-4 main_~i~1 := 0; 394#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 395#L546-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~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~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;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 412#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 411#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 404#L522-5 [2019-11-15 19:54:55,431 INFO L793 eck$LassoCheckResult]: Loop: 404#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 409#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 403#L522-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 404#L522-5 [2019-11-15 19:54:55,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:55,431 INFO L82 PathProgramCache]: Analyzing trace with hash -2087759941, now seen corresponding path program 1 times [2019-11-15 19:54:55,431 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:55,431 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086321336] [2019-11-15 19:54:55,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:55,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:55,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:55,532 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 19:54:55,532 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086321336] [2019-11-15 19:54:55,532 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:55,532 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 19:54:55,532 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727945043] [2019-11-15 19:54:55,533 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 19:54:55,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:55,533 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 1 times [2019-11-15 19:54:55,533 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:55,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801257370] [2019-11-15 19:54:55,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:55,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:55,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:55,541 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:54:55,699 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:55,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 19:54:55,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 19:54:55,699 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. cyclomatic complexity: 17 Second operand 7 states. [2019-11-15 19:54:55,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:55,770 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-11-15 19:54:55,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 19:54:55,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2019-11-15 19:54:55,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 19:54:55,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 22 states and 29 transitions. [2019-11-15 19:54:55,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-15 19:54:55,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 19:54:55,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2019-11-15 19:54:55,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 19:54:55,773 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-11-15 19:54:55,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2019-11-15 19:54:55,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-11-15 19:54:55,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-15 19:54:55,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2019-11-15 19:54:55,775 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-11-15 19:54:55,775 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-11-15 19:54:55,775 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 19:54:55,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2019-11-15 19:54:55,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 19:54:55,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:54:55,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:54:55,776 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:55,776 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:55,777 INFO L791 eck$LassoCheckResult]: Stem: 475#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 470#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 471#L532 assume !(main_~length1~0 < 1); 472#L532-2 assume !(main_~length2~0 < 1); 465#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 466#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 477#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 478#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 462#L541-4 main_~i~1 := 0; 463#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 469#L546-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~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~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;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 461#L519-4 [2019-11-15 19:54:55,777 INFO L793 eck$LassoCheckResult]: Loop: 461#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 464#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 476#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 473#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 474#L522-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7; 458#L522-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 459#L524 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 460#L519-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 461#L519-4 [2019-11-15 19:54:55,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:55,777 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2019-11-15 19:54:55,777 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:55,777 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967199366] [2019-11-15 19:54:55,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:55,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:55,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:55,794 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:54:55,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:55,795 INFO L82 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 2 times [2019-11-15 19:54:55,795 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:55,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91011775] [2019-11-15 19:54:55,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:55,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:55,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:55,806 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:54:55,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:55,806 INFO L82 PathProgramCache]: Analyzing trace with hash -164170776, now seen corresponding path program 1 times [2019-11-15 19:54:55,806 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:55,807 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805340625] [2019-11-15 19:54:55,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:55,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:55,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:55,927 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 19:54:55,927 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805340625] [2019-11-15 19:54:55,928 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:55,928 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 19:54:55,928 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957433106] [2019-11-15 19:54:56,034 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-11-15 19:54:56,191 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-11-15 19:54:56,191 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:56,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 19:54:56,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-15 19:54:56,192 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. cyclomatic complexity: 10 Second operand 10 states. [2019-11-15 19:54:56,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:56,362 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2019-11-15 19:54:56,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 19:54:56,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 46 transitions. [2019-11-15 19:54:56,363 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2019-11-15 19:54:56,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 34 states and 44 transitions. [2019-11-15 19:54:56,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-11-15 19:54:56,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-11-15 19:54:56,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2019-11-15 19:54:56,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 19:54:56,365 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2019-11-15 19:54:56,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2019-11-15 19:54:56,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-11-15 19:54:56,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-15 19:54:56,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2019-11-15 19:54:56,368 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-11-15 19:54:56,368 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-11-15 19:54:56,368 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 19:54:56,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2019-11-15 19:54:56,370 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2019-11-15 19:54:56,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:54:56,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:54:56,371 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:56,371 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:56,371 INFO L791 eck$LassoCheckResult]: Stem: 560#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 555#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 556#L532 assume !(main_~length1~0 < 1); 557#L532-2 assume !(main_~length2~0 < 1); 549#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 550#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 565#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 566#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 544#L541-4 main_~i~1 := 0; 545#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 553#L546-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~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~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;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 546#L519-4 [2019-11-15 19:54:56,371 INFO L793 eck$LassoCheckResult]: Loop: 546#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 547#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 568#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 567#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 561#L522-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 562#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 558#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 559#L522-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7; 540#L522-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 541#L524 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 548#L519-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 546#L519-4 [2019-11-15 19:54:56,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:56,372 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 2 times [2019-11-15 19:54:56,372 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:56,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539372225] [2019-11-15 19:54:56,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:56,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:56,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:56,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:56,391 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:54:56,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:56,391 INFO L82 PathProgramCache]: Analyzing trace with hash -898285594, now seen corresponding path program 1 times [2019-11-15 19:54:56,391 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:56,392 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218249525] [2019-11-15 19:54:56,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:56,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:56,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:56,405 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:54:56,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:56,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1809250353, now seen corresponding path program 1 times [2019-11-15 19:54:56,406 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:56,406 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454385902] [2019-11-15 19:54:56,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:56,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:56,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:56,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:56,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 19:54:56,541 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454385902] [2019-11-15 19:54:56,542 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:56,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 19:54:56,542 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155953765] [2019-11-15 19:54:56,831 WARN L191 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 75 [2019-11-15 19:54:57,060 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-11-15 19:54:57,060 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:57,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 19:54:57,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-15 19:54:57,061 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. cyclomatic complexity: 14 Second operand 9 states. [2019-11-15 19:54:57,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:57,151 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-11-15 19:54:57,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 19:54:57,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 35 transitions. [2019-11-15 19:54:57,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-15 19:54:57,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 23 states and 29 transitions. [2019-11-15 19:54:57,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-15 19:54:57,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-15 19:54:57,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2019-11-15 19:54:57,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 19:54:57,153 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-15 19:54:57,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2019-11-15 19:54:57,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-15 19:54:57,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-15 19:54:57,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2019-11-15 19:54:57,156 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-11-15 19:54:57,156 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-11-15 19:54:57,156 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 19:54:57,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2019-11-15 19:54:57,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-15 19:54:57,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:54:57,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:54:57,157 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:57,157 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:57,157 INFO L791 eck$LassoCheckResult]: Stem: 642#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 636#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 637#L532 assume !(main_~length1~0 < 1); 638#L532-2 assume !(main_~length2~0 < 1); 631#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 632#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 644#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 645#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 628#L541-4 main_~i~1 := 0; 629#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 633#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 634#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 635#L546-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~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~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;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 627#L519-4 [2019-11-15 19:54:57,157 INFO L793 eck$LassoCheckResult]: Loop: 627#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 630#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 643#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 639#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 640#L522-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7; 624#L522-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 625#L524 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 626#L519-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 627#L519-4 [2019-11-15 19:54:57,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:57,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2019-11-15 19:54:57,158 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:57,158 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324143158] [2019-11-15 19:54:57,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:57,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:57,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:57,177 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:54:57,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:57,177 INFO L82 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 3 times [2019-11-15 19:54:57,177 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:57,178 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413479049] [2019-11-15 19:54:57,178 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:57,178 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:57,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:57,187 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:54:57,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:57,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1875279350, now seen corresponding path program 1 times [2019-11-15 19:54:57,187 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:57,188 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124436877] [2019-11-15 19:54:57,188 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:57,188 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:57,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:57,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:57,217 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:54:57,336 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-11-15 19:54:57,553 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-11-15 19:54:57,965 WARN L191 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 115 [2019-11-15 19:54:58,102 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-11-15 19:54:58,104 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 19:54:58,105 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 19:54:58,105 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 19:54:58,105 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 19:54:58,105 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 19:54:58,105 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:54:58,105 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 19:54:58,105 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 19:54:58,105 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-1.i_Iteration7_Lasso [2019-11-15 19:54:58,105 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 19:54:58,105 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 19:54:58,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 19:54:58,127 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 19:54:58,132 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 19:54:58,134 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 19:54:58,140 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 19:54:58,143 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 19:54:58,532 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 84 [2019-11-15 19:54:58,703 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-11-15 19:54:58,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 19:54:58,705 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 19:54:58,706 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 19:54:58,707 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 19:54:58,709 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 19:54:58,711 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 19:54:58,712 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 19:54:58,714 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 19:54:58,716 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 19:54:58,725 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 19:54:58,726 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 19:54:58,729 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 19:54:58,732 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 19:54:58,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 19:54:58,735 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 19:54:58,737 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 19:54:58,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 19:54:58,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 19:54:58,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 19:54:59,173 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2019-11-15 19:54:59,584 WARN L191 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-11-15 19:54:59,670 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 19:54:59,670 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 19:54:59,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:54:59,671 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:54:59,671 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:54:59,672 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:54:59,672 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:54:59,672 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:54:59,672 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:54:59,673 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:54:59,673 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:54:59,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 19:54:59,674 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:54:59,674 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:54:59,674 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:54:59,675 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:54:59,675 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:54:59,675 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:54:59,675 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:54:59,676 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:54:59,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 19:54:59,676 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:54:59,676 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:54:59,677 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:54:59,677 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:54:59,677 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:54:59,677 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:54:59,677 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:54:59,678 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:54:59,678 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 19:54:59,678 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:54:59,679 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:54:59,679 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:54:59,679 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:54:59,679 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:54:59,679 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:54:59,679 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:54:59,680 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:54:59,680 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 19:54:59,681 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:54:59,681 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:54:59,681 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:54:59,681 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:54:59,682 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:54:59,682 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:54:59,683 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:54:59,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 19:54:59,684 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:54:59,684 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:54:59,684 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 19:54:59,684 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:54:59,688 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-15 19:54:59,688 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 19:54:59,703 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:54:59,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:54:59,704 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:54:59,704 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:54:59,704 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:54:59,705 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:54:59,708 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:54:59,708 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:54:59,736 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 19:54:59,773 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-15 19:54:59,773 INFO L444 ModelExtractionUtils]: 47 out of 55 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-11-15 19:54:59,774 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 19:54:59,774 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 19:54:59,775 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 19:54:59,775 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~sc1~0.offset, v_rep(select #length ULTIMATE.start_cstrspn_~sc1~0.base)_1) = -1*ULTIMATE.start_cstrspn_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrspn_~sc1~0.base)_1 Supporting invariants [] [2019-11-15 19:54:59,830 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2019-11-15 19:54:59,831 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 19:54:59,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:59,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 19:54:59,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:54:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:59,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 19:54:59,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:54:59,901 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 19:54:59,902 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 19:54:59,902 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-15 19:54:59,928 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 31 states and 40 transitions. Complement of second has 4 states. [2019-11-15 19:54:59,928 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 19:54:59,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 19:54:59,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2019-11-15 19:54:59,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 13 letters. Loop has 8 letters. [2019-11-15 19:54:59,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:54:59,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 21 letters. Loop has 8 letters. [2019-11-15 19:54:59,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:54:59,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 13 letters. Loop has 16 letters. [2019-11-15 19:54:59,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:54:59,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2019-11-15 19:54:59,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 19:54:59,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 27 states and 35 transitions. [2019-11-15 19:54:59,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 19:54:59,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 19:54:59,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2019-11-15 19:54:59,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 19:54:59,932 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-15 19:54:59,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2019-11-15 19:54:59,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-15 19:54:59,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-15 19:54:59,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-11-15 19:54:59,934 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-15 19:54:59,934 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-15 19:54:59,934 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 19:54:59,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2019-11-15 19:54:59,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 19:54:59,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:54:59,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:54:59,935 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:59,935 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 19:54:59,935 INFO L791 eck$LassoCheckResult]: Stem: 842#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 834#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 835#L532 assume !(main_~length1~0 < 1); 836#L532-2 assume !(main_~length2~0 < 1); 829#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 830#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 845#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 846#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 824#L541-4 main_~i~1 := 0; 825#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 831#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 832#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 833#L546-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~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~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;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 826#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 828#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 843#L522-5 [2019-11-15 19:54:59,935 INFO L793 eck$LassoCheckResult]: Loop: 843#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 837#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 838#L522-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 843#L522-5 [2019-11-15 19:54:59,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:59,936 INFO L82 PathProgramCache]: Analyzing trace with hash 2055034687, now seen corresponding path program 1 times [2019-11-15 19:54:59,936 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:59,936 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78050576] [2019-11-15 19:54:59,936 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:59,936 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:59,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:59,963 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:54:59,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:59,964 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 2 times [2019-11-15 19:54:59,964 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:59,964 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868589142] [2019-11-15 19:54:59,964 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:59,964 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:59,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:59,976 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:54:59,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:59,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1074579938, now seen corresponding path program 1 times [2019-11-15 19:54:59,977 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:59,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115766353] [2019-11-15 19:54:59,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:59,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:59,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:55:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:55:00,021 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:55:00,660 WARN L191 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 129 [2019-11-15 19:55:00,878 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-11-15 19:55:00,880 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 19:55:00,880 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 19:55:00,880 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 19:55:00,880 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 19:55:00,880 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 19:55:00,880 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:55:00,880 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 19:55:00,880 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 19:55:00,880 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-1.i_Iteration8_Lasso [2019-11-15 19:55:00,880 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 19:55:00,880 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 19:55:00,883 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 19:55:00,886 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 19:55:00,887 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 19:55:00,890 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 19:55:00,891 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 19:55:00,893 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 19:55:00,894 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 19:55:00,896 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 19:55:00,901 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 19:55:00,903 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 19:55:00,912 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 19:55:00,914 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 19:55:00,915 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 19:55:00,917 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 19:55:00,919 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 19:55:00,920 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 19:55:00,921 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 19:55:00,923 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 19:55:00,924 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 19:55:00,926 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 19:55:00,932 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 19:55:00,934 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 19:55:00,936 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 19:55:01,378 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 96 [2019-11-15 19:55:01,514 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-11-15 19:55:01,514 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 19:55:01,516 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 19:55:01,704 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-11-15 19:55:02,331 WARN L191 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 19:55:02,589 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-11-15 19:55:02,611 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 19:55:02,611 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 19:55:02,611 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 19:55:02,612 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:02,612 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:55:02,612 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:02,612 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:02,612 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:02,613 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:55:02,613 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:55:02,613 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:02,613 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:55:02,614 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:02,614 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:55:02,614 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:02,614 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:02,614 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:02,614 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:55:02,614 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:55:02,615 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:02,615 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 19:55:02,615 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:02,615 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:55:02,615 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:02,616 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:02,616 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:02,616 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:55:02,616 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:55:02,616 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:02,616 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 19:55:02,617 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:02,617 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:55:02,617 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:02,617 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:02,617 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:02,617 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:55:02,617 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:55:02,618 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:02,618 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 19:55:02,618 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:02,618 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:02,618 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:02,619 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:02,619 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:55:02,619 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:55:02,620 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:02,620 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 19:55:02,621 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:02,621 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:55:02,621 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:02,621 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:02,621 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:02,621 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:55:02,621 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:55:02,621 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:02,622 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 19:55:02,622 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:02,622 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:55:02,622 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:02,622 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:02,622 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:02,623 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:55:02,623 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:55:02,625 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:02,625 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 19:55:02,626 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:02,626 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:55:02,626 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:02,626 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:02,626 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:02,626 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:55:02,627 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:55:02,627 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:02,627 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 19:55:02,628 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:02,628 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:55:02,628 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:02,628 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:02,628 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:02,629 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:55:02,629 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:55:02,629 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:02,630 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 19:55:02,630 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:02,630 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:02,630 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:02,630 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:02,631 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:55:02,631 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:55:02,632 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:02,632 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 19:55:02,633 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:02,633 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:55:02,633 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:02,633 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:02,633 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:02,634 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:55:02,634 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:55:02,634 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:02,635 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 19:55:02,635 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:02,635 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:55:02,635 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:02,636 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:02,636 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:02,636 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:55:02,636 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:55:02,636 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:02,637 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 19:55:02,637 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:02,637 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:55:02,638 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:02,638 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:02,638 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:02,638 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:55:02,638 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:55:02,639 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:02,639 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 19:55:02,640 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:02,640 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:02,640 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:02,640 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:02,641 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:55:02,641 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:55:02,642 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:02,642 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 19:55:02,643 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:02,643 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:55:02,643 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:02,643 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:02,643 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:02,644 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:55:02,644 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:55:02,644 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:02,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 19:55:02,645 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:02,645 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:55:02,645 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:02,645 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:02,646 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:02,646 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:55:02,646 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:55:02,646 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:02,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:55:02,647 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:02,647 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:55:02,648 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:02,648 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:02,648 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:02,648 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:55:02,648 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:55:02,649 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:02,649 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 19:55:02,649 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:02,650 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:55:02,650 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:02,650 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:02,650 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:02,650 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:55:02,650 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:55:02,651 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:02,651 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 19:55:02,652 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:02,652 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:02,652 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:02,652 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:02,653 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:55:02,653 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:55:02,654 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:02,654 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 19:55:02,654 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:02,655 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:55:02,655 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:02,655 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:02,655 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:02,655 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:55:02,656 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:55:02,656 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:02,656 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 19:55:02,657 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:02,657 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:55:02,657 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:02,657 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:02,657 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:02,657 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:55:02,658 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:55:02,658 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:02,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:55:02,659 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:02,659 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:55:02,659 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:02,659 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:02,659 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:02,660 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:55:02,660 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:55:02,660 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:02,661 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 19:55:02,661 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:02,661 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:02,661 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:02,662 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:02,664 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:55:02,665 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:55:02,685 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 19:55:02,712 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 19:55:02,713 INFO L444 ModelExtractionUtils]: 53 out of 58 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 19:55:02,713 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 19:55:02,714 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 19:55:02,714 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 19:55:02,714 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~s~0.offset, v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_2) = -1*ULTIMATE.start_cstrspn_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_2 Supporting invariants [] [2019-11-15 19:55:02,819 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2019-11-15 19:55:02,820 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 19:55:02,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:55:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:02,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 19:55:02,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:55:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:02,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 19:55:02,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:55:02,889 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 19:55:02,890 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 19:55:02,890 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-11-15 19:55:02,914 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 54 states and 67 transitions. Complement of second has 5 states. [2019-11-15 19:55:02,915 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 19:55:02,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 19:55:02,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2019-11-15 19:55:02,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-15 19:55:02,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:55:02,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-15 19:55:02,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:55:02,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 15 letters. Loop has 6 letters. [2019-11-15 19:55:02,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:55:02,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 67 transitions. [2019-11-15 19:55:02,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 19:55:02,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 40 states and 50 transitions. [2019-11-15 19:55:02,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-15 19:55:02,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-15 19:55:02,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 50 transitions. [2019-11-15 19:55:02,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 19:55:02,919 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-11-15 19:55:02,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 50 transitions. [2019-11-15 19:55:02,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2019-11-15 19:55:02,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-15 19:55:02,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2019-11-15 19:55:02,921 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2019-11-15 19:55:02,921 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2019-11-15 19:55:02,921 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 19:55:02,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 41 transitions. [2019-11-15 19:55:02,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 19:55:02,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:55:02,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:55:02,922 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:55:02,923 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 19:55:02,923 INFO L791 eck$LassoCheckResult]: Stem: 1094#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1087#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 1088#L532 assume !(main_~length1~0 < 1); 1089#L532-2 assume !(main_~length2~0 < 1); 1082#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 1083#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 1097#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1098#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1076#L541-4 main_~i~1 := 0; 1077#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 1084#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 1085#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 1086#L546-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~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~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;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 1078#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 1079#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 1096#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 1092#L522-1 assume !cstrspn_#t~short7; 1093#L522-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7; 1072#L522-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 1073#L524 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 1074#L519-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 1075#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 1081#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 1095#L522-5 [2019-11-15 19:55:02,926 INFO L793 eck$LassoCheckResult]: Loop: 1095#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 1090#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 1091#L522-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 1095#L522-5 [2019-11-15 19:55:02,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:55:02,926 INFO L82 PathProgramCache]: Analyzing trace with hash -777149455, now seen corresponding path program 1 times [2019-11-15 19:55:02,926 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:55:02,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772356038] [2019-11-15 19:55:02,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:02,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:02,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:55:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:02,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 19:55:02,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772356038] [2019-11-15 19:55:02,997 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:55:02,997 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 19:55:02,997 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314024838] [2019-11-15 19:55:02,997 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 19:55:02,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:55:02,998 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 3 times [2019-11-15 19:55:02,998 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:55:02,998 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719654697] [2019-11-15 19:55:02,998 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:02,998 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:02,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:55:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:55:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:55:03,005 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:55:03,187 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-15 19:55:03,187 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:55:03,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 19:55:03,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 19:55:03,187 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. cyclomatic complexity: 14 Second operand 7 states. [2019-11-15 19:55:03,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:55:03,289 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2019-11-15 19:55:03,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 19:55:03,290 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2019-11-15 19:55:03,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 19:55:03,290 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 32 states and 39 transitions. [2019-11-15 19:55:03,291 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 19:55:03,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 19:55:03,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. [2019-11-15 19:55:03,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 19:55:03,291 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-11-15 19:55:03,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. [2019-11-15 19:55:03,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-15 19:55:03,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-15 19:55:03,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2019-11-15 19:55:03,293 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-11-15 19:55:03,293 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-11-15 19:55:03,293 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 19:55:03,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 39 transitions. [2019-11-15 19:55:03,294 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 19:55:03,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:55:03,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:55:03,294 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:55:03,295 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 19:55:03,295 INFO L791 eck$LassoCheckResult]: Stem: 1179#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1172#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 1173#L532 assume !(main_~length1~0 < 1); 1174#L532-2 assume !(main_~length2~0 < 1); 1167#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 1168#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 1184#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1185#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1161#L541-4 main_~i~1 := 0; 1162#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 1169#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 1170#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 1171#L546-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~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~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;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 1163#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 1164#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 1182#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 1188#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 1186#L522-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7; 1157#L522-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 1158#L524 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 1159#L519-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 1160#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 1166#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 1180#L522-5 [2019-11-15 19:55:03,295 INFO L793 eck$LassoCheckResult]: Loop: 1180#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 1175#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 1176#L522-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 1180#L522-5 [2019-11-15 19:55:03,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:55:03,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1742810479, now seen corresponding path program 2 times [2019-11-15 19:55:03,295 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:55:03,295 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801375707] [2019-11-15 19:55:03,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:03,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:03,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:55:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:03,537 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 19:55:03,537 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801375707] [2019-11-15 19:55:03,537 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320810549] [2019-11-15 19:55:03,537 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00ae7af0-70c5-445c-b555-8ebf6d279993/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 19:55:03,628 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 19:55:03,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 19:55:03,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-15 19:55:03,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:55:03,667 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-15 19:55:03,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:03,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:03,675 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:55:03,675 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-11-15 19:55:03,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 21 [2019-11-15 19:55:03,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:03,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:03,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 19:55:03,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:31 [2019-11-15 19:55:03,897 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:03,898 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 21 [2019-11-15 19:55:03,898 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 19:55:03,918 INFO L567 ElimStorePlain]: treesize reduction 8, result has 63.6 percent of original size [2019-11-15 19:55:03,919 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:55:03,919 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:38, output treesize:3 [2019-11-15 19:55:03,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 19:55:03,948 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:55:03,949 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-15 19:55:03,949 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565782071] [2019-11-15 19:55:03,953 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 19:55:03,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:55:03,953 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 4 times [2019-11-15 19:55:03,953 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:55:03,953 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273698382] [2019-11-15 19:55:03,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:03,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:03,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:55:03,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:55:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:55:03,966 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:55:04,168 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-15 19:55:04,168 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:55:04,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 19:55:04,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-11-15 19:55:04,169 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. cyclomatic complexity: 12 Second operand 16 states. [2019-11-15 19:55:04,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:55:04,605 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2019-11-15 19:55:04,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 19:55:04,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 62 transitions. [2019-11-15 19:55:04,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 19:55:04,607 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 35 states and 42 transitions. [2019-11-15 19:55:04,607 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 19:55:04,607 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 19:55:04,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2019-11-15 19:55:04,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 19:55:04,607 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-11-15 19:55:04,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2019-11-15 19:55:04,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-11-15 19:55:04,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-15 19:55:04,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2019-11-15 19:55:04,609 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-11-15 19:55:04,609 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-11-15 19:55:04,610 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-15 19:55:04,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. [2019-11-15 19:55:04,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 19:55:04,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:55:04,610 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:55:04,611 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:55:04,611 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 19:55:04,611 INFO L791 eck$LassoCheckResult]: Stem: 1363#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1356#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 1357#L532 assume !(main_~length1~0 < 1); 1358#L532-2 assume !(main_~length2~0 < 1); 1351#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 1352#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 1368#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1369#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 1371#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1373#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1345#L541-4 main_~i~1 := 0; 1346#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 1353#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 1354#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 1355#L546-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~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~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;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 1347#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 1348#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 1366#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 1361#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 1362#L522-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7; 1341#L522-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 1342#L524 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 1343#L519-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 1344#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 1350#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 1364#L522-5 [2019-11-15 19:55:04,611 INFO L793 eck$LassoCheckResult]: Loop: 1364#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 1359#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 1360#L522-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 1364#L522-5 [2019-11-15 19:55:04,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:55:04,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1365761455, now seen corresponding path program 3 times [2019-11-15 19:55:04,612 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:55:04,612 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635566157] [2019-11-15 19:55:04,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:04,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:04,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:55:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:55:04,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:55:04,645 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:55:04,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:55:04,646 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 5 times [2019-11-15 19:55:04,646 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:55:04,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454591571] [2019-11-15 19:55:04,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:04,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:04,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:55:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:55:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:55:04,652 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:55:04,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:55:04,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1174254192, now seen corresponding path program 1 times [2019-11-15 19:55:04,653 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:55:04,653 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951918264] [2019-11-15 19:55:04,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:04,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:04,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:55:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:55:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:55:04,685 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:55:06,267 WARN L191 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 227 DAG size of output: 182 [2019-11-15 19:55:09,877 WARN L191 SmtUtils]: Spent 3.59 s on a formula simplification. DAG size of input: 145 DAG size of output: 145 [2019-11-15 19:55:09,879 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 19:55:09,880 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 19:55:09,880 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 19:55:09,880 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 19:55:09,880 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 19:55:09,880 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:55:09,880 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 19:55:09,880 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 19:55:09,880 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-1.i_Iteration11_Lasso [2019-11-15 19:55:09,880 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 19:55:09,880 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 19:55:09,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 19:55:09,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:55:09,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:55:09,899 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 19:55:09,902 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 19:55:09,905 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 19:55:09,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:55:09,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:55:09,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:55:09,919 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 19:55:09,921 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 19:55:09,922 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 19:55:09,924 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 19:55:09,927 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 19:55:09,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:55:09,937 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 19:55:10,235 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-15 19:55:11,406 WARN L191 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 141 DAG size of output: 116 [2019-11-15 19:55:11,585 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-11-15 19:55:11,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:55:11,587 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 19:55:11,589 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 19:55:11,591 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 19:55:11,592 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 19:55:11,594 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 19:55:11,596 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 19:55:11,597 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 19:55:11,609 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 19:55:11,611 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 19:55:11,876 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-11-15 19:55:12,081 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-11-15 19:55:12,519 WARN L191 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 19:55:12,838 WARN L191 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2019-11-15 19:55:12,992 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-11-15 19:55:13,144 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 19:55:13,144 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 19:55:13,144 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 19:55:13,146 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:13,146 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:55:13,146 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:13,146 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:13,146 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:13,147 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:55:13,147 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:55:13,147 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:13,147 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 19:55:13,148 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:13,148 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:55:13,148 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:13,148 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:13,148 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:13,148 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:55:13,148 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:55:13,149 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:13,149 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 19:55:13,149 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:13,150 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:55:13,150 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:13,150 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:13,150 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:13,150 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:55:13,150 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:55:13,151 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:13,151 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 19:55:13,151 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:13,152 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:13,152 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:13,152 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:13,152 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:55:13,153 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:55:13,153 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:13,154 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 19:55:13,154 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:13,154 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:13,155 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:13,155 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:13,155 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:55:13,156 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:55:13,156 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:13,157 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 19:55:13,157 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:13,157 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:13,157 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:13,158 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:13,158 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:55:13,158 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:55:13,159 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:13,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:55:13,160 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:13,160 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:55:13,160 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:13,161 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:13,161 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:13,161 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:55:13,161 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:55:13,161 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:13,162 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 19:55:13,162 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:13,162 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:55:13,162 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:13,163 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:13,163 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:13,163 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:55:13,163 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:55:13,164 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:13,164 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 19:55:13,164 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:13,164 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:55:13,165 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:13,165 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:13,165 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:13,165 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:55:13,165 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:55:13,166 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:13,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 19:55:13,166 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:13,167 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:55:13,167 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:13,167 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:13,167 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:13,167 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:55:13,168 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:55:13,168 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:13,168 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 19:55:13,169 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:13,169 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:55:13,169 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:13,169 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:13,169 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:13,170 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:55:13,170 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:55:13,170 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:13,170 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 19:55:13,171 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:13,171 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:55:13,171 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:13,171 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:13,171 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:13,172 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:55:13,172 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:55:13,172 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:13,172 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 19:55:13,173 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:13,173 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:55:13,173 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:13,173 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:13,173 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:13,174 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:55:13,174 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:55:13,174 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:13,174 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 19:55:13,175 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:13,175 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:55:13,175 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:13,175 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:13,175 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:13,176 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:55:13,176 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:55:13,176 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:13,176 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 19:55:13,177 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:13,177 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:55:13,177 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:13,177 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:13,178 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:13,178 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:55:13,178 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:55:13,178 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:13,179 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 19:55:13,179 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:13,179 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:13,179 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:13,180 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:13,180 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:55:13,180 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:55:13,181 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:13,181 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 19:55:13,182 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:13,182 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:13,182 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:13,182 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:13,183 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:55:13,183 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:55:13,186 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:13,187 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 19:55:13,187 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:13,187 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 19:55:13,188 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:13,188 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:13,191 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 19:55:13,191 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:55:13,205 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:13,206 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 19:55:13,206 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:13,207 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 19:55:13,207 INFO L203 nArgumentSynthesizer]: 6 loop disjuncts [2019-11-15 19:55:13,207 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:13,231 INFO L400 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2019-11-15 19:55:13,231 INFO L401 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-11-15 19:55:13,413 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:13,414 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 19:55:13,414 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:13,415 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:13,415 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:13,415 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:13,415 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:55:13,416 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:55:13,417 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:13,417 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 19:55:13,418 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:13,418 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:13,418 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:13,418 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:13,419 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:55:13,419 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:55:13,419 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:13,420 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 19:55:13,420 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:13,420 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:13,421 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:13,421 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:13,421 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:55:13,421 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:55:13,422 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:55:13,423 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 19:55:13,423 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:55:13,423 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:55:13,423 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:55:13,424 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:55:13,427 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:55:13,427 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:55:13,462 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 19:55:13,485 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 19:55:13,486 INFO L444 ModelExtractionUtils]: 55 out of 61 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 19:55:13,486 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 19:55:13,487 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 19:55:13,487 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 19:55:13,487 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_3, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_3 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2019-11-15 19:55:13,665 INFO L297 tatePredicateManager]: 35 out of 35 supporting invariants were superfluous and have been removed [2019-11-15 19:55:13,666 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 19:55:13,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:55:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:13,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 19:55:13,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:55:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:13,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 19:55:13,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:55:13,734 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 19:55:13,735 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 19:55:13,735 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-11-15 19:55:13,753 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 50 states and 58 transitions. Complement of second has 5 states. [2019-11-15 19:55:13,754 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 19:55:13,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 19:55:13,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2019-11-15 19:55:13,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-15 19:55:13,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:55:13,754 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 19:55:13,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:55:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:13,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 19:55:13,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:55:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:13,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 19:55:13,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:55:13,802 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 19:55:13,803 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 19:55:13,803 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-11-15 19:55:13,822 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 50 states and 58 transitions. Complement of second has 5 states. [2019-11-15 19:55:13,823 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 19:55:13,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 19:55:13,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2019-11-15 19:55:13,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-15 19:55:13,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:55:13,824 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 19:55:13,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:55:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:13,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 19:55:13,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:55:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:13,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 19:55:13,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:55:13,880 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 19:55:13,880 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 19:55:13,880 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-11-15 19:55:13,900 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 49 states and 58 transitions. Complement of second has 4 states. [2019-11-15 19:55:13,903 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 19:55:13,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 19:55:13,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2019-11-15 19:55:13,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-15 19:55:13,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:55:13,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 28 letters. Loop has 3 letters. [2019-11-15 19:55:13,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:55:13,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 25 letters. Loop has 6 letters. [2019-11-15 19:55:13,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:55:13,905 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 58 transitions. [2019-11-15 19:55:13,906 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 19:55:13,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 0 states and 0 transitions. [2019-11-15 19:55:13,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 19:55:13,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 19:55:13,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 19:55:13,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 19:55:13,906 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 19:55:13,906 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 19:55:13,906 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 19:55:13,906 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-15 19:55:13,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 19:55:13,907 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 19:55:13,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 19:55:13,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 07:55:13 BoogieIcfgContainer [2019-11-15 19:55:13,912 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 19:55:13,912 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 19:55:13,912 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 19:55:13,912 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 19:55:13,912 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:54:51" (3/4) ... [2019-11-15 19:55:13,915 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 19:55:13,916 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 19:55:13,917 INFO L168 Benchmark]: Toolchain (without parser) took 23768.51 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 506.5 MB). Free memory was 939.9 MB in the beginning and 878.4 MB in the end (delta: 61.4 MB). Peak memory consumption was 567.9 MB. Max. memory is 11.5 GB. [2019-11-15 19:55:13,917 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 961.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 19:55:13,918 INFO L168 Benchmark]: CACSL2BoogieTranslator took 544.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -196.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-15 19:55:13,919 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.66 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.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. [2019-11-15 19:55:13,919 INFO L168 Benchmark]: Boogie Preprocessor took 51.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 19:55:13,919 INFO L168 Benchmark]: RCFGBuilder took 384.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. [2019-11-15 19:55:13,920 INFO L168 Benchmark]: BuchiAutomizer took 22709.65 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 346.0 MB). Free memory was 1.1 GB in the beginning and 878.4 MB in the end (delta: 229.4 MB). Peak memory consumption was 575.4 MB. Max. memory is 11.5 GB. [2019-11-15 19:55:13,920 INFO L168 Benchmark]: Witness Printer took 3.95 ms. Allocated memory is still 1.5 GB. Free memory is still 878.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 19:55:13,923 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 961.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 544.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -196.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.66 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.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 384.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 22709.65 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 346.0 MB). Free memory was 1.1 GB in the beginning and 878.4 MB in the end (delta: 229.4 MB). Peak memory consumption was 575.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.95 ms. Allocated memory is still 1.5 GB. Free memory is still 878.4 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 11 terminating modules (6 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function length1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * i + unknown-#length-unknown[nondetString2] + -1 * nondetString2 and consists of 4 locations. One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[sc1] and consists of 3 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. 6 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 22.6s and 12 iterations. TraceHistogramMax:2. Analysis of lassos took 20.6s. Construction of modules took 0.5s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 7. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 28 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 34 states and ocurred in iteration 10. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 248 SDtfs, 587 SDslu, 539 SDs, 0 SdLazy, 550 SolverSat, 73 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU3 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital419 mio100 ax107 hnf98 lsp83 ukn67 mio100 lsp44 div104 bol100 ite100 ukn100 eq179 hnf87 smp91 dnf371 smp61 tf100 neg95 sie117 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 207ms VariablesStem: 8 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 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...