./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e140fc64-426c-4e20-91f7-af923cae2a70/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e140fc64-426c-4e20-91f7-af923cae2a70/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e140fc64-426c-4e20-91f7-af923cae2a70/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e140fc64-426c-4e20-91f7-af923cae2a70/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e140fc64-426c-4e20-91f7-af923cae2a70/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e140fc64-426c-4e20-91f7-af923cae2a70/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 46421108dc6473f7bf7bcbb7826a3247c1ccc8d1 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:02:17,755 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:02:17,759 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:02:17,770 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:02:17,770 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:02:17,771 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:02:17,772 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:02:17,774 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:02:17,775 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:02:17,778 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:02:17,779 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:02:17,780 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:02:17,780 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:02:17,781 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:02:17,782 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:02:17,782 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:02:17,783 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:02:17,784 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:02:17,792 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:02:17,793 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:02:17,794 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:02:17,795 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:02:17,799 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:02:17,800 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:02:17,801 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:02:17,801 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:02:17,802 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:02:17,802 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:02:17,803 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:02:17,803 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:02:17,803 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:02:17,807 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:02:17,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:02:17,809 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:02:17,809 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:02:17,810 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:02:17,810 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:02:17,810 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:02:17,811 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:02:17,811 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:02:17,815 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:02:17,816 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e140fc64-426c-4e20-91f7-af923cae2a70/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 09:02:17,831 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:02:17,831 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:02:17,843 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:02:17,843 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:02:17,843 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:02:17,843 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:02:17,844 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:02:17,844 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:02:17,844 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:02:17,844 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:02:17,844 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:02:17,844 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:02:17,845 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:02:17,845 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:02:17,845 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:02:17,845 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:02:17,845 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:02:17,846 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:02:17,846 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:02:17,846 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:02:17,846 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:02:17,846 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:02:17,846 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:02:17,847 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:02:17,847 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:02:17,847 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:02:17,847 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:02:17,847 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:02:17,848 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:02:17,848 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:02:17,849 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:02:17,850 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:02:17,850 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_e140fc64-426c-4e20-91f7-af923cae2a70/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 46421108dc6473f7bf7bcbb7826a3247c1ccc8d1 [2019-10-22 09:02:17,888 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:02:17,900 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:02:17,904 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:02:17,906 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:02:17,906 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:02:17,907 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e140fc64-426c-4e20-91f7-af923cae2a70/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca-2.i [2019-10-22 09:02:17,962 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e140fc64-426c-4e20-91f7-af923cae2a70/bin/uautomizer/data/21009e95d/0d1cfcaa80924b258a64775f57460cdf/FLAGb9cdd4392 [2019-10-22 09:02:18,396 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:02:18,399 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e140fc64-426c-4e20-91f7-af923cae2a70/sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca-2.i [2019-10-22 09:02:18,413 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e140fc64-426c-4e20-91f7-af923cae2a70/bin/uautomizer/data/21009e95d/0d1cfcaa80924b258a64775f57460cdf/FLAGb9cdd4392 [2019-10-22 09:02:18,751 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e140fc64-426c-4e20-91f7-af923cae2a70/bin/uautomizer/data/21009e95d/0d1cfcaa80924b258a64775f57460cdf [2019-10-22 09:02:18,753 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:02:18,754 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:02:18,755 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:18,755 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:02:18,758 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:02:18,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:18" (1/1) ... [2019-10-22 09:02:18,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29b9025e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:18, skipping insertion in model container [2019-10-22 09:02:18,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:18" (1/1) ... [2019-10-22 09:02:18,768 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:02:18,799 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:02:19,174 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:19,184 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:02:19,238 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:19,274 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:02:19,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:19 WrapperNode [2019-10-22 09:02:19,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:19,275 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:19,275 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:02:19,276 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:02:19,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:19" (1/1) ... [2019-10-22 09:02:19,303 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:19" (1/1) ... [2019-10-22 09:02:19,330 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:19,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:02:19,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:02:19,332 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:02:19,345 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:19" (1/1) ... [2019-10-22 09:02:19,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:19" (1/1) ... [2019-10-22 09:02:19,350 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:19" (1/1) ... [2019-10-22 09:02:19,352 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:19" (1/1) ... [2019-10-22 09:02:19,359 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:19" (1/1) ... [2019-10-22 09:02:19,373 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:19" (1/1) ... [2019-10-22 09:02:19,375 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:19" (1/1) ... [2019-10-22 09:02:19,383 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:02:19,384 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:02:19,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:02:19,384 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:02:19,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e140fc64-426c-4e20-91f7-af923cae2a70/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:19,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:02:19,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:02:19,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:02:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:02:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:02:19,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:02:19,886 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:02:19,886 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-22 09:02:19,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:19 BoogieIcfgContainer [2019-10-22 09:02:19,887 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:02:19,888 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:02:19,888 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:02:19,891 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:02:19,892 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:19,892 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:02:18" (1/3) ... [2019-10-22 09:02:19,893 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56cdc1b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:02:19, skipping insertion in model container [2019-10-22 09:02:19,893 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:19,893 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:19" (2/3) ... [2019-10-22 09:02:19,893 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56cdc1b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:02:19, skipping insertion in model container [2019-10-22 09:02:19,893 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:19,894 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:19" (3/3) ... [2019-10-22 09:02:19,895 INFO L371 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrspn-alloca-2.i [2019-10-22 09:02:19,943 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:02:19,944 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:02:19,944 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:02:19,944 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:02:19,944 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:02:19,944 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:02:19,944 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:02:19,944 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:02:19,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-10-22 09:02:19,979 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-10-22 09:02:19,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:19,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:19,990 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 09:02:19,990 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:02:19,990 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:02:19,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-10-22 09:02:19,993 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-10-22 09:02:19,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:19,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:19,993 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 09:02:19,994 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:02:20,000 INFO L791 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 19#L528true assume !(main_~length1~0 < 1); 5#L528-2true assume !(main_~length2~0 < 1); 15#L531-1true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 8#L537-3true [2019-10-22 09:02:20,000 INFO L793 eck$LassoCheckResult]: Loop: 8#L537-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 7#L537-2true main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 8#L537-3true [2019-10-22 09:02:20,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:20,005 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-10-22 09:02:20,011 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:20,011 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955542817] [2019-10-22 09:02:20,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:20,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:20,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:20,140 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:20,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:20,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2019-10-22 09:02:20,141 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:20,141 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882219455] [2019-10-22 09:02:20,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:20,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:20,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:20,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:20,162 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:20,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:20,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2019-10-22 09:02:20,164 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:20,164 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398246621] [2019-10-22 09:02:20,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:20,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:20,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:20,209 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:20,470 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-10-22 09:02:20,484 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:20,484 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:20,485 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:20,485 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:20,485 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:20,486 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:20,486 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:20,486 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:20,486 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrspn-alloca-2.i_Iteration1_Lasso [2019-10-22 09:02:20,486 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:20,486 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:20,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:20,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:20,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:20,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:20,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:20,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:20,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:20,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:20,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:20,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:20,701 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-10-22 09:02:20,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:20,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-10-22 09:02:20,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:20,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-10-22 09:02:20,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:21,055 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-10-22 09:02:21,163 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:21,173 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:21,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-10-22 09:02:21,178 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:21,179 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:21,180 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:21,180 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:21,184 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:21,187 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:21,201 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:21,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:21,213 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:21,213 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:21,214 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:21,214 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:21,214 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:21,215 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:21,215 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:21,216 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:21,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:21,217 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:21,218 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:21,218 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:21,218 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:21,218 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:21,219 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:21,219 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:21,228 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:21,228 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:21,229 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:21,229 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:21,230 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:21,230 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:21,230 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:21,231 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:21,231 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:21,232 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:21,232 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:21,233 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:21,233 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:21,234 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:21,234 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:21,234 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:21,235 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:21,235 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:21,236 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:21,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:21,237 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:21,238 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:21,238 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:21,238 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:21,240 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:21,241 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:21,248 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:21,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:21,249 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:21,250 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:21,250 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:21,250 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:21,252 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:21,252 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:21,255 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:21,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:21,261 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:21,261 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:21,261 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:21,261 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:21,262 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:21,262 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:21,262 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:21,263 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:21,267 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:21,268 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:21,268 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:21,268 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:21,268 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:21,270 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:21,270 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:21,279 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:21,279 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:21,282 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:21,283 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:21,283 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:21,283 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:21,283 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:21,284 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:21,284 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:21,285 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:21,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:21,286 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:21,286 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 09:02:21,287 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:21,287 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:21,293 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:02:21,294 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:21,347 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:21,354 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:21,355 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:21,355 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:21,355 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:21,355 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:21,355 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:21,356 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:21,356 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:21,357 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:21,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:21,358 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:21,358 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:21,358 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:21,358 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:21,360 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:21,360 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:21,366 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:21,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:21,367 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:21,368 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:21,371 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:21,371 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:21,372 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:21,372 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:21,377 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:21,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:21,378 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:21,378 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:21,379 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:21,379 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:21,380 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:21,380 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:21,383 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:21,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:21,386 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:21,386 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:21,386 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:21,387 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:21,389 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:21,389 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:21,442 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:21,520 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 09:02:21,520 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 09:02:21,522 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:21,524 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:02:21,524 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:21,525 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nondetString1~0.offset, v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1, ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~nondetString1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-10-22 09:02:21,540 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-10-22 09:02:21,548 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:02:21,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:21,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:21,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:21,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:02:21,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:21,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:21,623 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:02:21,625 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states. Second operand 3 states. [2019-10-22 09:02:21,697 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states.. Second operand 3 states. Result 48 states and 67 transitions. Complement of second has 7 states. [2019-10-22 09:02:21,699 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-10-22 09:02:21,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:02:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2019-10-22 09:02:21,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 5 letters. Loop has 2 letters. [2019-10-22 09:02:21,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:21,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 09:02:21,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:21,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 5 letters. Loop has 4 letters. [2019-10-22 09:02:21,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:21,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 67 transitions. [2019-10-22 09:02:21,717 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 09:02:21,724 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 16 states and 22 transitions. [2019-10-22 09:02:21,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 09:02:21,725 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-10-22 09:02:21,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-10-22 09:02:21,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:21,727 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-10-22 09:02:21,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-10-22 09:02:21,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-10-22 09:02:21,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-22 09:02:21,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-10-22 09:02:21,749 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-10-22 09:02:21,749 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-10-22 09:02:21,750 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:02:21,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2019-10-22 09:02:21,750 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 09:02:21,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:21,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:21,751 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:21,751 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:02:21,752 INFO L791 eck$LassoCheckResult]: Stem: 153#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 150#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 151#L528 assume !(main_~length1~0 < 1); 142#L528-2 assume !(main_~length2~0 < 1); 143#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 146#L537-3 assume !(main_~i~0 < main_~length1~0 - 1); 147#L537-4 main_~i~1 := 0; 148#L541-3 [2019-10-22 09:02:21,752 INFO L793 eck$LassoCheckResult]: Loop: 148#L541-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 155#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 148#L541-3 [2019-10-22 09:02:21,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:21,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2019-10-22 09:02:21,752 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:21,753 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6561206] [2019-10-22 09:02:21,753 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:21,753 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:21,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:21,773 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:21,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:21,773 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2019-10-22 09:02:21,774 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:21,774 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108443983] [2019-10-22 09:02:21,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:21,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:21,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:21,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:21,783 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:21,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:21,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2019-10-22 09:02:21,784 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:21,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044526896] [2019-10-22 09:02:21,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:21,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:21,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:21,806 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:21,976 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:21,976 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:21,976 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:21,977 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:21,977 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:21,977 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:21,977 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:21,977 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:21,977 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrspn-alloca-2.i_Iteration2_Lasso [2019-10-22 09:02:21,977 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:21,977 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:21,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:21,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:22,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:22,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:22,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:22,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:22,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:22,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:22,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:22,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:22,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:22,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:22,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:22,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:22,491 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-10-22 09:02:22,591 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:22,591 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:22,591 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:22,592 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:22,592 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:22,592 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:22,593 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:22,593 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:22,593 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:22,593 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:22,594 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:22,594 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:22,595 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:22,595 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 09:02:22,595 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:22,595 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:22,598 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:02:22,598 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:22,612 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:22,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-10-22 09:02:22,613 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:22,614 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:22,614 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:22,614 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:22,615 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:22,615 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:22,619 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:22,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-10-22 09:02:22,620 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:22,621 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:22,621 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:22,621 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:22,622 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:22,622 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:22,624 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:22,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:22,625 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:22,625 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:22,625 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:22,625 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:22,627 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:22,627 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:22,654 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:22,674 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 09:02:22,674 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:02:22,674 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:22,675 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:02:22,676 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:22,676 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~length2~0) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~length2~0 Supporting invariants [] [2019-10-22 09:02:22,687 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-10-22 09:02:22,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:22,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:22,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:22,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:02:22,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:22,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:22,743 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:02:22,743 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-10-22 09:02:22,770 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 23 states and 34 transitions. Complement of second has 6 states. [2019-10-22 09:02:22,772 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-10-22 09:02:22,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:02:22,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2019-10-22 09:02:22,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 09:02:22,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:22,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 9 letters. Loop has 2 letters. [2019-10-22 09:02:22,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:22,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 7 letters. Loop has 4 letters. [2019-10-22 09:02:22,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:22,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 34 transitions. [2019-10-22 09:02:22,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:02:22,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 17 states and 24 transitions. [2019-10-22 09:02:22,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 09:02:22,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 09:02:22,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2019-10-22 09:02:22,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:22,776 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-10-22 09:02:22,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2019-10-22 09:02:22,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-22 09:02:22,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 09:02:22,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2019-10-22 09:02:22,778 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-10-22 09:02:22,779 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-10-22 09:02:22,779 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:02:22,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2019-10-22 09:02:22,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:02:22,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:22,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:22,780 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:22,780 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:22,780 INFO L791 eck$LassoCheckResult]: Stem: 266#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 263#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 264#L528 assume !(main_~length1~0 < 1); 255#L528-2 assume !(main_~length2~0 < 1); 256#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 259#L537-3 assume !(main_~i~0 < main_~length1~0 - 1); 260#L537-4 main_~i~1 := 0; 261#L541-3 assume !(main_~i~1 < main_~length2~0 - 1); 253#L541-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_#t~post4.base, cstrspn_#t~post4.offset, cstrspn_#t~mem5, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~p~0.base, cstrspn_~p~0.offset, cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset, cstrspn_~c~0, cstrspn_~sc~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset;havoc cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;havoc cstrspn_~c~0;havoc cstrspn_~sc~0; 254#L522 [2019-10-22 09:02:22,780 INFO L793 eck$LassoCheckResult]: Loop: 254#L522 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 262#L520-3 cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; 267#L520-1 assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~mem5;havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset; 265#L521 assume cstrspn_~sc~0 == cstrspn_~c~0; 254#L522 [2019-10-22 09:02:22,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:22,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2019-10-22 09:02:22,781 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:22,781 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655249741] [2019-10-22 09:02:22,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:22,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:22,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:22,804 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:22,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:22,804 INFO L82 PathProgramCache]: Analyzing trace with hash 2312936, now seen corresponding path program 1 times [2019-10-22 09:02:22,804 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:22,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577873802] [2019-10-22 09:02:22,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:22,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:22,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:22,814 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:22,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:22,814 INFO L82 PathProgramCache]: Analyzing trace with hash -587636803, now seen corresponding path program 1 times [2019-10-22 09:02:22,814 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:22,814 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563804650] [2019-10-22 09:02:22,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:22,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:22,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:23,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:23,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563804650] [2019-10-22 09:02:23,042 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:23,042 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 09:02:23,042 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024958154] [2019-10-22 09:02:23,145 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:23,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 09:02:23,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-22 09:02:23,149 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand 9 states. [2019-10-22 09:02:23,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:23,291 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2019-10-22 09:02:23,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 09:02:23,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. [2019-10-22 09:02:23,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:02:23,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 18 states and 24 transitions. [2019-10-22 09:02:23,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 09:02:23,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 09:02:23,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2019-10-22 09:02:23,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:23,294 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-10-22 09:02:23,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2019-10-22 09:02:23,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-10-22 09:02:23,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 09:02:23,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-10-22 09:02:23,301 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-10-22 09:02:23,302 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-10-22 09:02:23,302 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:02:23,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-10-22 09:02:23,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:02:23,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:23,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:23,303 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:23,303 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:23,303 INFO L791 eck$LassoCheckResult]: Stem: 325#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 322#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 323#L528 assume !(main_~length1~0 < 1); 314#L528-2 assume !(main_~length2~0 < 1); 315#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 318#L537-3 assume !(main_~i~0 < main_~length1~0 - 1); 319#L537-4 main_~i~1 := 0; 320#L541-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 327#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 328#L541-3 assume !(main_~i~1 < main_~length2~0 - 1); 312#L541-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_#t~post4.base, cstrspn_#t~post4.offset, cstrspn_#t~mem5, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~p~0.base, cstrspn_~p~0.offset, cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset, cstrspn_~c~0, cstrspn_~sc~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset;havoc cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;havoc cstrspn_~c~0;havoc cstrspn_~sc~0; 313#L522 [2019-10-22 09:02:23,303 INFO L793 eck$LassoCheckResult]: Loop: 313#L522 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 321#L520-3 cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; 326#L520-1 assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~mem5;havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset; 324#L521 assume cstrspn_~sc~0 == cstrspn_~c~0; 313#L522 [2019-10-22 09:02:23,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:23,304 INFO L82 PathProgramCache]: Analyzing trace with hash -2087704584, now seen corresponding path program 1 times [2019-10-22 09:02:23,304 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:23,304 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522944356] [2019-10-22 09:02:23,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:23,305 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:23,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:23,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:23,342 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:23,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:23,344 INFO L82 PathProgramCache]: Analyzing trace with hash 2312936, now seen corresponding path program 2 times [2019-10-22 09:02:23,345 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:23,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261409292] [2019-10-22 09:02:23,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:23,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:23,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:23,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:23,366 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:23,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:23,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1860214623, now seen corresponding path program 1 times [2019-10-22 09:02:23,369 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:23,369 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798320816] [2019-10-22 09:02:23,369 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:23,369 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:23,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:23,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:02:23,552 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798320816] [2019-10-22 09:02:23,552 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:23,552 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 09:02:23,552 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075736949] [2019-10-22 09:02:23,635 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:23,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 09:02:23,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-22 09:02:23,635 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 9 Second operand 8 states. [2019-10-22 09:02:23,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:23,744 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2019-10-22 09:02:23,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 09:02:23,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2019-10-22 09:02:23,745 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-10-22 09:02:23,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 36 transitions. [2019-10-22 09:02:23,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-10-22 09:02:23,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-10-22 09:02:23,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 36 transitions. [2019-10-22 09:02:23,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:23,746 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-10-22 09:02:23,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 36 transitions. [2019-10-22 09:02:23,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2019-10-22 09:02:23,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-22 09:02:23,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-10-22 09:02:23,749 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-10-22 09:02:23,749 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-10-22 09:02:23,749 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:02:23,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2019-10-22 09:02:23,750 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 09:02:23,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:23,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:23,750 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:23,751 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:02:23,751 INFO L791 eck$LassoCheckResult]: Stem: 395#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 391#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 392#L528 assume !(main_~length1~0 < 1); 381#L528-2 assume !(main_~length2~0 < 1); 382#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 385#L537-3 assume !(main_~i~0 < main_~length1~0 - 1); 386#L537-4 main_~i~1 := 0; 388#L541-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 398#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 399#L541-3 assume !(main_~i~1 < main_~length2~0 - 1); 379#L541-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_#t~post4.base, cstrspn_#t~post4.offset, cstrspn_#t~mem5, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~p~0.base, cstrspn_~p~0.offset, cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset, cstrspn_~c~0, cstrspn_~sc~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset;havoc cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;havoc cstrspn_~c~0;havoc cstrspn_~sc~0; 380#L522 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 394#L520-3 [2019-10-22 09:02:23,751 INFO L793 eck$LassoCheckResult]: Loop: 394#L520-3 cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; 400#L520-1 assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~mem5;havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset; 393#L521 assume !(cstrspn_~sc~0 == cstrspn_~c~0); 394#L520-3 [2019-10-22 09:02:23,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:23,751 INFO L82 PathProgramCache]: Analyzing trace with hash -294332619, now seen corresponding path program 1 times [2019-10-22 09:02:23,752 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:23,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796926110] [2019-10-22 09:02:23,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:23,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:23,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:23,772 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:23,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:23,773 INFO L82 PathProgramCache]: Analyzing trace with hash 78613, now seen corresponding path program 1 times [2019-10-22 09:02:23,773 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:23,773 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734431442] [2019-10-22 09:02:23,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:23,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:23,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:23,779 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:23,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:23,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1860214625, now seen corresponding path program 1 times [2019-10-22 09:02:23,779 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:23,779 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254701809] [2019-10-22 09:02:23,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:23,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:23,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:23,813 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:24,256 WARN L191 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 120 [2019-10-22 09:02:24,414 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-10-22 09:02:24,416 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:24,416 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:24,416 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:24,416 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:24,416 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:24,417 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:24,417 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:24,417 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:24,417 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrspn-alloca-2.i_Iteration5_Lasso [2019-10-22 09:02:24,417 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:24,417 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:24,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:24,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:24,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:24,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:24,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:24,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:24,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:24,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:24,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:24,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:24,826 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 89 [2019-10-22 09:02:24,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-10-22 09:02:24,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:24,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:24,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:24,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-10-22 09:02:24,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-10-22 09:02:24,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-10-22 09:02:24,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:24,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-10-22 09:02:24,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-10-22 09:02:24,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-10-22 09:02:24,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-10-22 09:02:25,552 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-10-22 09:02:25,592 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:25,592 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:25,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:25,593 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:25,593 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:25,593 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:25,594 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:25,594 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:25,594 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:25,594 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:25,594 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:25,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:25,595 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:25,595 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:25,595 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:25,595 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:25,596 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:25,597 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:25,598 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:25,598 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:25,599 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:25,599 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:25,599 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:25,599 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:25,599 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:25,599 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:25,599 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:25,600 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:25,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:25,600 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:25,600 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:25,601 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:25,601 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:25,601 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:25,601 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:25,601 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:25,601 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:25,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:25,602 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:25,602 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:25,602 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:25,602 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:25,602 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:25,603 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:25,603 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:25,603 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:25,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:25,604 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:25,605 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:25,605 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:25,605 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:25,605 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:25,605 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:25,605 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:25,606 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:25,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:25,606 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:25,606 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:25,606 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:25,606 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:25,607 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:25,607 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:25,609 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:25,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:25,609 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:25,610 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:25,610 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:25,610 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:25,610 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:25,610 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:25,610 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:25,611 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:25,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-10-22 09:02:25,611 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:25,611 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:25,611 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:25,611 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:25,613 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:25,613 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:25,614 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:25,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:25,614 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:25,615 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:25,615 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:25,615 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:25,615 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:25,615 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:25,617 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:25,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:25,617 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:25,618 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:25,618 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:25,618 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:25,621 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:25,621 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:25,643 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:25,673 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 09:02:25,674 INFO L444 ModelExtractionUtils]: 43 out of 49 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 09:02:25,674 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:25,675 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:02:25,675 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:25,675 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrspn_~spanp~0.base)_1, ULTIMATE.start_cstrspn_~spanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrspn_~spanp~0.base)_1 - 1*ULTIMATE.start_cstrspn_~spanp~0.offset Supporting invariants [] [2019-10-22 09:02:25,762 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2019-10-22 09:02:25,763 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:02:25,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:25,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:25,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:25,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:25,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:25,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 09:02:25,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:25,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:25,824 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:02:25,824 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 33 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-10-22 09:02:25,834 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 33 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 38 states and 46 transitions. Complement of second has 5 states. [2019-10-22 09:02:25,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:25,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:02:25,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2019-10-22 09:02:25,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 12 letters. Loop has 3 letters. [2019-10-22 09:02:25,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:25,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 15 letters. Loop has 3 letters. [2019-10-22 09:02:25,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:25,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 12 letters. Loop has 6 letters. [2019-10-22 09:02:25,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:25,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 46 transitions. [2019-10-22 09:02:25,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:02:25,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 24 states and 30 transitions. [2019-10-22 09:02:25,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-10-22 09:02:25,838 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-10-22 09:02:25,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2019-10-22 09:02:25,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:25,838 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-10-22 09:02:25,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2019-10-22 09:02:25,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-10-22 09:02:25,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-22 09:02:25,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2019-10-22 09:02:25,840 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-10-22 09:02:25,840 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-10-22 09:02:25,840 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:02:25,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2019-10-22 09:02:25,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:02:25,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:25,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:25,841 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:25,841 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:25,842 INFO L791 eck$LassoCheckResult]: Stem: 605#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 599#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 600#L528 assume !(main_~length1~0 < 1); 591#L528-2 assume !(main_~length2~0 < 1); 592#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 595#L537-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 593#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 594#L537-3 assume !(main_~i~0 < main_~length1~0 - 1); 596#L537-4 main_~i~1 := 0; 597#L541-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 609#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 610#L541-3 assume !(main_~i~1 < main_~length2~0 - 1); 589#L541-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_#t~post4.base, cstrspn_#t~post4.offset, cstrspn_#t~mem5, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~p~0.base, cstrspn_~p~0.offset, cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset, cstrspn_~c~0, cstrspn_~sc~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset;havoc cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;havoc cstrspn_~c~0;havoc cstrspn_~sc~0; 590#L522 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 598#L520-3 cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; 608#L520-1 assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~mem5;havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset; 601#L521 assume cstrspn_~sc~0 == cstrspn_~c~0; 602#L522 [2019-10-22 09:02:25,842 INFO L793 eck$LassoCheckResult]: Loop: 602#L522 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 611#L520-3 cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; 606#L520-1 assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~mem5;havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset; 607#L521 assume cstrspn_~sc~0 == cstrspn_~c~0; 602#L522 [2019-10-22 09:02:25,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:25,842 INFO L82 PathProgramCache]: Analyzing trace with hash -796682687, now seen corresponding path program 1 times [2019-10-22 09:02:25,842 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:25,842 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140203669] [2019-10-22 09:02:25,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:25,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:25,870 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:25,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:25,871 INFO L82 PathProgramCache]: Analyzing trace with hash 2312936, now seen corresponding path program 3 times [2019-10-22 09:02:25,871 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:25,871 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213604396] [2019-10-22 09:02:25,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:25,878 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:25,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:25,878 INFO L82 PathProgramCache]: Analyzing trace with hash 477217064, now seen corresponding path program 2 times [2019-10-22 09:02:25,878 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:25,879 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625715500] [2019-10-22 09:02:25,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:26,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:02:26,094 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625715500] [2019-10-22 09:02:26,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959549754] [2019-10-22 09:02:26,095 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e140fc64-426c-4e20-91f7-af923cae2a70/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-10-22 09:02:26,170 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 09:02:26,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:02:26,172 WARN L254 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 77 conjunts are in the unsatisfiable core [2019-10-22 09:02:26,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:26,373 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 09:02:26,392 INFO L341 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2019-10-22 09:02:26,393 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 20 [2019-10-22 09:02:26,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:26,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:26,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-22 09:02:26,410 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:38 [2019-10-22 09:02:26,665 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 09:02:26,666 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 09:02:26,682 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-10-22 09:02:26,683 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 28 [2019-10-22 09:02:26,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:26,711 INFO L567 ElimStorePlain]: treesize reduction 8, result has 71.4 percent of original size [2019-10-22 09:02:26,713 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:26,713 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:53, output treesize:8 [2019-10-22 09:02:26,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:26,753 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:26,753 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15] total 23 [2019-10-22 09:02:26,753 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747527220] [2019-10-22 09:02:26,847 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:26,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-22 09:02:26,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2019-10-22 09:02:26,849 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. cyclomatic complexity: 10 Second operand 24 states. [2019-10-22 09:02:28,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:28,231 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2019-10-22 09:02:28,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-22 09:02:28,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 77 transitions. [2019-10-22 09:02:28,232 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-10-22 09:02:28,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 65 states and 77 transitions. [2019-10-22 09:02:28,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2019-10-22 09:02:28,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2019-10-22 09:02:28,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 77 transitions. [2019-10-22 09:02:28,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:28,235 INFO L688 BuchiCegarLoop]: Abstraction has 65 states and 77 transitions. [2019-10-22 09:02:28,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 77 transitions. [2019-10-22 09:02:28,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 40. [2019-10-22 09:02:28,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-22 09:02:28,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2019-10-22 09:02:28,238 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2019-10-22 09:02:28,238 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2019-10-22 09:02:28,238 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 09:02:28,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2019-10-22 09:02:28,239 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 09:02:28,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:28,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:28,240 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:28,240 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:02:28,240 INFO L791 eck$LassoCheckResult]: Stem: 833#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 828#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 829#L528 assume !(main_~length1~0 < 1); 816#L528-2 assume !(main_~length2~0 < 1); 817#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 820#L537-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 821#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 822#L537-3 assume !(main_~i~0 < main_~length1~0 - 1); 823#L537-4 main_~i~1 := 0; 841#L541-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 838#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 839#L541-3 assume !(main_~i~1 < main_~length2~0 - 1); 814#L541-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_#t~post4.base, cstrspn_#t~post4.offset, cstrspn_#t~mem5, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~p~0.base, cstrspn_~p~0.offset, cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset, cstrspn_~c~0, cstrspn_~sc~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset;havoc cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;havoc cstrspn_~c~0;havoc cstrspn_~sc~0; 815#L522 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 842#L520-3 cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; 836#L520-1 assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~mem5;havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset; 837#L521 assume cstrspn_~sc~0 == cstrspn_~c~0; 826#L522 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 827#L520-3 [2019-10-22 09:02:28,240 INFO L793 eck$LassoCheckResult]: Loop: 827#L520-3 cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; 840#L520-1 assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~mem5;havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset; 830#L521 assume !(cstrspn_~sc~0 == cstrspn_~c~0); 827#L520-3 [2019-10-22 09:02:28,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:28,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1072640524, now seen corresponding path program 3 times [2019-10-22 09:02:28,240 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:28,241 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493827550] [2019-10-22 09:02:28,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:28,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:28,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:28,271 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:28,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:28,271 INFO L82 PathProgramCache]: Analyzing trace with hash 78613, now seen corresponding path program 2 times [2019-10-22 09:02:28,271 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:28,271 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375546328] [2019-10-22 09:02:28,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:28,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:28,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:28,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:28,276 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:28,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:28,277 INFO L82 PathProgramCache]: Analyzing trace with hash 477217066, now seen corresponding path program 1 times [2019-10-22 09:02:28,277 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:28,277 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43277493] [2019-10-22 09:02:28,277 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:28,277 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:28,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:28,323 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:29,056 WARN L191 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 166 [2019-10-22 09:02:29,296 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2019-10-22 09:02:29,298 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:29,298 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:29,298 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:29,298 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:29,298 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:29,298 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:29,298 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:29,298 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:29,298 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrspn-alloca-2.i_Iteration7_Lasso [2019-10-22 09:02:29,298 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:29,299 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:29,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:29,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:29,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:29,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:29,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:29,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:29,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:29,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:29,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:29,848 WARN L191 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 112 [2019-10-22 09:02:29,973 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-10-22 09:02:29,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:29,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:29,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:29,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:29,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:29,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:29,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:29,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:29,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:29,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:29,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:29,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:30,482 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-10-22 09:02:30,749 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:30,749 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:30,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:30,750 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:30,750 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:30,750 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:30,750 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:30,750 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:30,751 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:30,751 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:30,751 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:30,752 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:30,752 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:30,752 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:30,753 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:30,753 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:30,753 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:30,753 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:30,753 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:30,753 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:30,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:30,754 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:30,754 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:30,754 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:30,754 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:30,754 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:30,755 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:30,755 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:30,755 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:30,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:30,756 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:30,756 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:30,756 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:30,757 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:30,757 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:30,757 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:30,764 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:30,764 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:30,765 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:30,765 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:30,765 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:30,765 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:30,765 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:30,766 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:30,766 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:30,766 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:30,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:30,767 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:30,767 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:30,767 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:30,767 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:30,767 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:30,768 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:30,768 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:30,768 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:30,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:30,768 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:30,769 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:30,769 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:30,769 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:30,769 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:30,769 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:30,769 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:30,769 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:30,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:30,770 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:30,770 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:30,770 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:30,770 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:30,771 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:30,771 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:30,772 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:30,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:30,773 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:30,773 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:30,773 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:30,773 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:30,774 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:30,774 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:30,775 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:30,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:30,775 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:30,776 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 09:02:30,776 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:30,776 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:30,779 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:02:30,779 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:30,795 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:30,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:30,796 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:30,796 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:30,797 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:30,797 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:30,797 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:30,797 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:30,798 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:30,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:30,799 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:30,799 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:30,799 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:30,799 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:30,803 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:30,803 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:30,845 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:30,914 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-10-22 09:02:30,915 INFO L444 ModelExtractionUtils]: 56 out of 64 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-10-22 09:02:30,915 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:30,916 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:02:30,916 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:30,916 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrspn_~spanp~0.base)_2, ULTIMATE.start_cstrspn_~spanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrspn_~spanp~0.base)_2 - 1*ULTIMATE.start_cstrspn_~spanp~0.offset Supporting invariants [] [2019-10-22 09:02:31,071 INFO L297 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2019-10-22 09:02:31,073 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:02:31,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:31,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:31,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:31,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 09:02:31,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:31,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:31,125 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:02:31,125 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 16 Second operand 3 states. [2019-10-22 09:02:31,138 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 16. Second operand 3 states. Result 49 states and 58 transitions. Complement of second has 5 states. [2019-10-22 09:02:31,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:31,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:02:31,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2019-10-22 09:02:31,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 18 letters. Loop has 3 letters. [2019-10-22 09:02:31,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:31,140 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:02:31,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:31,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:31,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:31,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 09:02:31,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:31,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:31,194 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-10-22 09:02:31,194 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 16 Second operand 3 states. [2019-10-22 09:02:31,212 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 16. Second operand 3 states. Result 49 states and 60 transitions. Complement of second has 5 states. [2019-10-22 09:02:31,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:31,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:02:31,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2019-10-22 09:02:31,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 18 letters. Loop has 3 letters. [2019-10-22 09:02:31,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:31,215 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:02:31,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:31,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:31,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:31,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 09:02:31,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:31,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:31,271 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-10-22 09:02:31,271 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 16 Second operand 3 states. [2019-10-22 09:02:31,281 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 16. Second operand 3 states. Result 54 states and 64 transitions. Complement of second has 4 states. [2019-10-22 09:02:31,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:31,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:02:31,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2019-10-22 09:02:31,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 18 letters. Loop has 3 letters. [2019-10-22 09:02:31,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:31,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 21 letters. Loop has 3 letters. [2019-10-22 09:02:31,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:31,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 18 letters. Loop has 6 letters. [2019-10-22 09:02:31,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:31,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 64 transitions. [2019-10-22 09:02:31,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 09:02:31,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 27 states and 33 transitions. [2019-10-22 09:02:31,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 09:02:31,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-10-22 09:02:31,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 33 transitions. [2019-10-22 09:02:31,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:31,285 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-10-22 09:02:31,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 33 transitions. [2019-10-22 09:02:31,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2019-10-22 09:02:31,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-22 09:02:31,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2019-10-22 09:02:31,287 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-10-22 09:02:31,287 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-10-22 09:02:31,287 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 09:02:31,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2019-10-22 09:02:31,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 09:02:31,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:31,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:31,288 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:31,288 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:31,291 INFO L791 eck$LassoCheckResult]: Stem: 1403#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1398#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 1399#L528 assume !(main_~length1~0 < 1); 1389#L528-2 assume !(main_~length2~0 < 1); 1390#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 1393#L537-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 1391#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 1392#L537-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 1394#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 1407#L537-3 assume !(main_~i~0 < main_~length1~0 - 1); 1395#L537-4 main_~i~1 := 0; 1396#L541-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 1405#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 1406#L541-3 assume !(main_~i~1 < main_~length2~0 - 1); 1387#L541-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_#t~post4.base, cstrspn_#t~post4.offset, cstrspn_#t~mem5, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~p~0.base, cstrspn_~p~0.offset, cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset, cstrspn_~c~0, cstrspn_~sc~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset;havoc cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;havoc cstrspn_~c~0;havoc cstrspn_~sc~0; 1388#L522 [2019-10-22 09:02:31,291 INFO L793 eck$LassoCheckResult]: Loop: 1388#L522 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 1397#L520-3 cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; 1404#L520-1 assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~mem5;havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset; 1400#L521 assume cstrspn_~sc~0 == cstrspn_~c~0; 1388#L522 [2019-10-22 09:02:31,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:31,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1523394364, now seen corresponding path program 1 times [2019-10-22 09:02:31,291 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:31,292 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201366428] [2019-10-22 09:02:31,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:31,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:31,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:31,314 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:31,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:31,316 INFO L82 PathProgramCache]: Analyzing trace with hash 2312936, now seen corresponding path program 4 times [2019-10-22 09:02:31,317 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:31,317 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194498060] [2019-10-22 09:02:31,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:31,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:31,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:31,326 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:31,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:31,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1430543523, now seen corresponding path program 4 times [2019-10-22 09:02:31,327 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:31,327 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000451870] [2019-10-22 09:02:31,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:31,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:31,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:31,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:31,364 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:32,092 WARN L191 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 128 [2019-10-22 09:02:32,255 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-10-22 09:02:32,257 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:32,257 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:32,257 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:32,257 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:32,257 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:32,257 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:32,257 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:32,257 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:32,258 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrspn-alloca-2.i_Iteration8_Lasso [2019-10-22 09:02:32,258 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:32,258 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:32,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,548 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2019-10-22 09:02:32,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,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-10-22 09:02:32,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:32,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:33,072 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-10-22 09:02:33,180 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:33,181 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:33,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-10-22 09:02:33,181 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:33,181 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:33,182 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:33,182 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:33,182 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:33,182 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:33,182 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:33,182 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:33,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:33,183 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:33,183 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:33,183 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:33,183 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:33,183 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:33,183 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:33,183 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:33,183 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:33,184 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:33,184 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:33,185 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:33,185 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:33,185 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:33,185 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:33,185 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:33,185 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:33,185 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:33,186 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:33,186 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:33,186 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:33,186 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:33,186 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:33,186 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:33,187 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:33,187 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:33,187 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:33,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-10-22 09:02:33,188 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:33,188 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:33,188 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:33,188 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:33,189 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:33,189 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:33,189 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:33,189 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:33,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:33,190 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:33,190 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:33,190 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:33,190 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:33,190 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:33,191 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:33,191 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:33,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:33,192 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:33,193 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:33,193 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:33,193 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:33,193 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:33,193 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:33,193 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:33,194 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:33,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:33,194 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:33,194 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:33,194 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:33,194 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:33,195 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:33,195 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:33,195 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:33,195 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:33,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:33,196 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:33,197 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:33,197 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:33,197 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:33,197 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:33,197 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:33,197 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:33,197 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:33,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:33,198 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:33,198 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:33,198 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:33,198 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:33,199 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:33,199 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:33,201 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:33,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:33,201 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:33,201 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:33,202 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:33,202 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:02:33,202 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:33,202 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:02:33,202 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:33,204 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:33,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:33,205 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:33,205 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:33,205 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:33,206 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:33,206 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:33,206 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:33,207 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:33,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:33,207 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:33,208 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 09:02:33,208 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:33,208 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:33,211 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:02:33,211 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:33,223 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:33,223 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:33,223 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:33,224 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:33,224 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:33,224 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:33,225 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:33,225 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:33,241 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:33,257 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-10-22 09:02:33,257 INFO L444 ModelExtractionUtils]: 26 out of 34 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-10-22 09:02:33,258 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:33,258 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:02:33,258 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:33,259 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrspn_~p~0.base)_2, ULTIMATE.start_cstrspn_~p~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrspn_~p~0.base)_2 - 1*ULTIMATE.start_cstrspn_~p~0.offset Supporting invariants [] [2019-10-22 09:02:33,312 INFO L297 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2019-10-22 09:02:33,313 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:02:33,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:33,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:33,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:33,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:02:33,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:33,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:33,356 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:02:33,356 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-10-22 09:02:33,362 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 28 states and 35 transitions. Complement of second has 4 states. [2019-10-22 09:02:33,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:33,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:02:33,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2019-10-22 09:02:33,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 15 letters. Loop has 4 letters. [2019-10-22 09:02:33,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:33,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 19 letters. Loop has 4 letters. [2019-10-22 09:02:33,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:33,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 15 letters. Loop has 8 letters. [2019-10-22 09:02:33,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:33,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2019-10-22 09:02:33,365 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:02:33,365 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2019-10-22 09:02:33,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:02:33,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:02:33,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:02:33,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:33,365 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:33,365 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:33,366 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:33,366 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 09:02:33,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:02:33,366 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:02:33,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:02:33,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:02:33 BoogieIcfgContainer [2019-10-22 09:02:33,373 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:02:33,373 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:02:33,373 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:02:33,374 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:02:33,374 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:19" (3/4) ... [2019-10-22 09:02:33,377 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:02:33,379 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:02:33,380 INFO L168 Benchmark]: Toolchain (without parser) took 14626.16 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 396.4 MB). Free memory was 939.1 MB in the beginning and 952.2 MB in the end (delta: -13.0 MB). Peak memory consumption was 383.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:33,381 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:33,381 INFO L168 Benchmark]: CACSL2BoogieTranslator took 520.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -178.4 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:33,383 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.36 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:33,383 INFO L168 Benchmark]: Boogie Preprocessor took 51.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:33,384 INFO L168 Benchmark]: RCFGBuilder took 503.56 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: 29.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:33,384 INFO L168 Benchmark]: BuchiAutomizer took 13485.39 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 250.6 MB). Free memory was 1.1 GB in the beginning and 952.2 MB in the end (delta: 136.4 MB). Peak memory consumption was 387.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:33,384 INFO L168 Benchmark]: Witness Printer took 5.42 ms. Allocated memory is still 1.4 GB. Free memory is still 952.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:33,386 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 520.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -178.4 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.36 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. * Boogie Preprocessor took 51.64 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 503.56 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: 29.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13485.39 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 250.6 MB). Free memory was 1.1 GB in the beginning and 952.2 MB in the end (delta: 136.4 MB). Peak memory consumption was 387.0 MB. Max. memory is 11.5 GB. * Witness Printer took 5.42 ms. Allocated memory is still 1.4 GB. Free memory is still 952.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * nondetString1 + unknown-#length-unknown[nondetString1] + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * i + length2 and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[spanp] + -1 * spanp and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[p] + -1 * p and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[spanp] + -1 * spanp and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 24 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.4s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 11.0s. Construction of modules took 0.4s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 36 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 40 states and ocurred in iteration 6. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 167 SDtfs, 362 SDslu, 277 SDs, 0 SdLazy, 398 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital273 mio100 ax108 hnf99 lsp87 ukn71 mio100 lsp45 div100 bol100 ite100 ukn100 eq185 hnf85 smp95 dnf186 smp96 tf100 neg95 sie117 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 61ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...