./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3883bb27-4209-4d63-a15f-8fcd10022d67/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3883bb27-4209-4d63-a15f-8fcd10022d67/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3883bb27-4209-4d63-a15f-8fcd10022d67/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3883bb27-4209-4d63-a15f-8fcd10022d67/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3883bb27-4209-4d63-a15f-8fcd10022d67/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3883bb27-4209-4d63-a15f-8fcd10022d67/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 bbb28681f649db641abcf0a1b656085d04f9cc91 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_3883bb27-4209-4d63-a15f-8fcd10022d67/bin/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:43:34,933 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:43:34,935 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:43:34,953 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:43:34,953 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:43:34,955 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:43:34,957 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:43:34,969 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:43:34,974 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:43:34,977 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:43:34,980 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:43:34,981 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:43:34,982 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:43:34,985 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:43:34,986 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:43:34,987 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:43:34,988 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:43:34,991 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:43:34,994 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:43:34,998 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:43:35,002 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:43:35,005 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:43:35,007 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:43:35,008 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:43:35,011 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:43:35,011 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:43:35,012 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:43:35,013 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:43:35,014 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:43:35,015 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:43:35,015 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:43:35,016 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:43:35,017 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:43:35,018 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:43:35,019 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:43:35,019 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:43:35,020 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:43:35,020 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:43:35,021 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:43:35,021 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:43:35,022 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:43:35,023 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3883bb27-4209-4d63-a15f-8fcd10022d67/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 22:43:35,067 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:43:35,067 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:43:35,068 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:43:35,069 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:43:35,069 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:43:35,069 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:43:35,070 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:43:35,070 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:43:35,070 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:43:35,070 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:43:35,071 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:43:35,071 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:43:35,071 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:43:35,072 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:43:35,072 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:43:35,072 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:43:35,073 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:43:35,073 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:43:35,073 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:43:35,075 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:43:35,075 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:43:35,076 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:43:35,076 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:43:35,076 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:43:35,077 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:43:35,078 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:43:35,078 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:43:35,078 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:43:35,079 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:43:35,079 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:43:35,080 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:43:35,081 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:43:35,081 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_3883bb27-4209-4d63-a15f-8fcd10022d67/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 -> bbb28681f649db641abcf0a1b656085d04f9cc91 [2019-11-15 22:43:35,124 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:43:35,137 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:43:35,143 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:43:35,145 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:43:35,145 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:43:35,146 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3883bb27-4209-4d63-a15f-8fcd10022d67/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i [2019-11-15 22:43:35,210 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3883bb27-4209-4d63-a15f-8fcd10022d67/bin/uautomizer/data/bc1da1338/810be8ea5d834ecb9ac58f9c38c23d11/FLAG7c778b586 [2019-11-15 22:43:35,768 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:43:35,769 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3883bb27-4209-4d63-a15f-8fcd10022d67/sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i [2019-11-15 22:43:35,797 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3883bb27-4209-4d63-a15f-8fcd10022d67/bin/uautomizer/data/bc1da1338/810be8ea5d834ecb9ac58f9c38c23d11/FLAG7c778b586 [2019-11-15 22:43:36,046 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3883bb27-4209-4d63-a15f-8fcd10022d67/bin/uautomizer/data/bc1da1338/810be8ea5d834ecb9ac58f9c38c23d11 [2019-11-15 22:43:36,049 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:43:36,050 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:43:36,051 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:43:36,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:43:36,056 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:43:36,057 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:43:36" (1/1) ... [2019-11-15 22:43:36,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ca44468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:36, skipping insertion in model container [2019-11-15 22:43:36,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:43:36" (1/1) ... [2019-11-15 22:43:36,069 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:43:36,126 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:43:36,587 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:43:36,598 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:43:36,662 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:43:36,735 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:43:36,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:36 WrapperNode [2019-11-15 22:43:36,737 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:43:36,739 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:43:36,740 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:43:36,740 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:43:36,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:36" (1/1) ... [2019-11-15 22:43:36,797 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:36" (1/1) ... [2019-11-15 22:43:36,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:43:36,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:43:36,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:43:36,849 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:43:36,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:36" (1/1) ... [2019-11-15 22:43:36,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:36" (1/1) ... [2019-11-15 22:43:36,884 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:36" (1/1) ... [2019-11-15 22:43:36,885 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:36" (1/1) ... [2019-11-15 22:43:36,895 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:36" (1/1) ... [2019-11-15 22:43:36,900 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:36" (1/1) ... [2019-11-15 22:43:36,903 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:36" (1/1) ... [2019-11-15 22:43:36,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:43:36,908 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:43:36,908 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:43:36,908 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:43:36,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3883bb27-4209-4d63-a15f-8fcd10022d67/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:43:36,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:43:36,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:43:36,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:43:36,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:43:36,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:43:36,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:43:37,510 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:43:37,510 INFO L284 CfgBuilder]: Removed 16 assume(true) statements. [2019-11-15 22:43:37,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:43:37 BoogieIcfgContainer [2019-11-15 22:43:37,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:43:37,513 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:43:37,513 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:43:37,516 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:43:37,517 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:43:37,518 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:43:36" (1/3) ... [2019-11-15 22:43:37,519 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2bf4c370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:43:37, skipping insertion in model container [2019-11-15 22:43:37,519 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:43:37,519 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:36" (2/3) ... [2019-11-15 22:43:37,520 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2bf4c370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:43:37, skipping insertion in model container [2019-11-15 22:43:37,520 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:43:37,520 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:43:37" (3/3) ... [2019-11-15 22:43:37,522 INFO L371 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrstr-alloca-2.i [2019-11-15 22:43:37,578 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:43:37,578 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:43:37,578 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:43:37,578 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:43:37,578 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:43:37,578 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:43:37,578 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:43:37,578 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:43:37,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. [2019-11-15 22:43:37,617 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2019-11-15 22:43:37,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:43:37,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:43:37,623 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 22:43:37,623 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:43:37,623 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:43:37,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. [2019-11-15 22:43:37,627 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2019-11-15 22:43:37,627 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:43:37,627 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:43:37,628 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 22:43:37,628 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:43:37,634 INFO L791 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, 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~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 4#L555true assume !(main_~length1~0 < 1); 28#L555-2true assume !(main_~length2~0 < 1); 19#L558-1true call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 35#L564-3true [2019-11-15 22:43:37,635 INFO L793 eck$LassoCheckResult]: Loop: 35#L564-3true assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 32#L564-2true main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 35#L564-3true [2019-11-15 22:43:37,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:37,639 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-15 22:43:37,646 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:37,647 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147461769] [2019-11-15 22:43:37,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:37,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:37,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:37,789 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:43:37,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:37,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2019-11-15 22:43:37,791 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:37,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052377739] [2019-11-15 22:43:37,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:37,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:37,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:37,813 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:43:37,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:37,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2019-11-15 22:43:37,815 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:37,815 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480250949] [2019-11-15 22:43:37,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:37,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:37,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:37,872 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:43:38,194 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-15 22:43:38,315 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:43:38,316 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:43:38,316 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:43:38,316 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:43:38,316 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:43:38,317 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:43:38,317 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:43:38,317 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:43:38,317 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-2.i_Iteration1_Lasso [2019-11-15 22:43:38,318 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:43:38,318 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:43:38,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:38,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:38,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:38,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:38,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:38,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:38,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:38,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:38,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:38,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:38,591 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-11-15 22:43:38,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:38,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-11-15 22:43:38,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-11-15 22:43:38,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:38,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:38,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:39,158 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 22:43:39,323 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:43:39,330 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:43:39,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:43:39,334 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:39,335 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:39,335 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:39,336 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:39,336 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:39,338 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:39,338 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:39,341 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:39,341 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:43:39,342 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:39,342 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:39,342 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:39,343 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:39,343 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:39,344 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:39,344 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:39,351 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:39,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:43:39,353 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:39,354 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:39,355 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:39,355 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:39,356 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:39,356 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:39,357 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:39,365 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:39,369 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:43:39,370 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:39,373 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:39,374 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:39,374 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:39,374 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:39,375 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:39,375 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:39,376 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:39,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:43:39,380 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:39,380 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:39,381 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:39,381 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:39,381 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:39,382 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:39,382 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:39,383 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:39,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:43:39,385 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:39,385 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:39,385 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:39,386 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:39,388 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:43:39,389 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:43:39,394 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:39,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:43:39,396 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:39,397 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:39,397 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:39,397 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:39,400 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:43:39,400 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:43:39,405 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:39,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:43:39,406 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:39,407 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:39,407 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:39,407 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:39,407 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:39,408 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:39,408 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:39,409 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:39,410 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:43:39,411 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:39,411 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:39,411 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:39,412 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:39,414 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:43:39,428 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:43:39,436 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:39,437 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:43:39,438 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:39,439 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:39,439 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:39,439 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:39,439 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:39,440 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:39,440 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:39,445 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:39,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:43:39,447 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:39,451 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 22:43:39,452 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:39,452 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:39,459 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 22:43:39,460 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:43:39,509 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:39,519 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:43:39,520 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:39,521 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:39,521 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:39,521 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:39,526 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:43:39,533 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:43:39,604 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:43:39,645 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 22:43:39,645 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 22:43:39,648 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:43:39,650 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:43:39,650 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:43:39,651 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~length1~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-15 22:43:39,671 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 22:43:39,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:39,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:43:39,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:43:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:39,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:43:39,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:43:39,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:43:39,793 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:43:39,795 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states. Second operand 3 states. [2019-11-15 22:43:39,875 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states.. Second operand 3 states. Result 99 states and 145 transitions. Complement of second has 7 states. [2019-11-15 22:43:39,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:43:39,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:43:39,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2019-11-15 22:43:39,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-15 22:43:39,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:43:39,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 22:43:39,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:43:39,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-15 22:43:39,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:43:39,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 145 transitions. [2019-11-15 22:43:39,892 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2019-11-15 22:43:39,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 32 states and 43 transitions. [2019-11-15 22:43:39,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-11-15 22:43:39,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-15 22:43:39,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 43 transitions. [2019-11-15 22:43:39,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:43:39,900 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-11-15 22:43:39,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 43 transitions. [2019-11-15 22:43:39,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-15 22:43:39,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-15 22:43:39,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2019-11-15 22:43:39,933 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-11-15 22:43:39,933 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-11-15 22:43:39,934 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:43:39,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 43 transitions. [2019-11-15 22:43:39,937 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2019-11-15 22:43:39,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:43:39,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:43:39,938 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:43:39,938 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:43:39,938 INFO L791 eck$LassoCheckResult]: Stem: 235#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 217#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, 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~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 210#L555 assume !(main_~length1~0 < 1); 211#L555-2 assume !(main_~length2~0 < 1); 227#L558-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 228#L564-3 assume !(main_~i~0 < main_~length1~0); 239#L564-4 main_~i~1 := 0; 209#L568-3 [2019-11-15 22:43:39,939 INFO L793 eck$LassoCheckResult]: Loop: 209#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 208#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 209#L568-3 [2019-11-15 22:43:39,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:39,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2019-11-15 22:43:39,939 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:39,940 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484051010] [2019-11-15 22:43:39,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:39,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:39,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:40,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:43:40,026 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484051010] [2019-11-15 22:43:40,027 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:40,028 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:43:40,028 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132767284] [2019-11-15 22:43:40,030 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:43:40,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:40,031 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2019-11-15 22:43:40,031 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:40,031 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543848203] [2019-11-15 22:43:40,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:40,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:40,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:40,044 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:43:40,092 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:40,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:43:40,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:43:40,097 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-11-15 22:43:40,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:40,140 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-11-15 22:43:40,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:43:40,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2019-11-15 22:43:40,143 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2019-11-15 22:43:40,144 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 43 transitions. [2019-11-15 22:43:40,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-15 22:43:40,145 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-15 22:43:40,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 43 transitions. [2019-11-15 22:43:40,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:43:40,146 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-11-15 22:43:40,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 43 transitions. [2019-11-15 22:43:40,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-11-15 22:43:40,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-15 22:43:40,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2019-11-15 22:43:40,150 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-11-15 22:43:40,150 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-11-15 22:43:40,150 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:43:40,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2019-11-15 22:43:40,152 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2019-11-15 22:43:40,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:43:40,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:43:40,153 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:43:40,153 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:43:40,153 INFO L791 eck$LassoCheckResult]: Stem: 307#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 289#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, 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~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 282#L555 assume !(main_~length1~0 < 1); 283#L555-2 assume !(main_~length2~0 < 1); 300#L558-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 301#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 309#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 310#L564-3 assume !(main_~i~0 < main_~length1~0); 311#L564-4 main_~i~1 := 0; 281#L568-3 [2019-11-15 22:43:40,153 INFO L793 eck$LassoCheckResult]: Loop: 281#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 280#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 281#L568-3 [2019-11-15 22:43:40,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:40,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1298440016, now seen corresponding path program 1 times [2019-11-15 22:43:40,154 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:40,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142887460] [2019-11-15 22:43:40,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:40,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:40,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:40,218 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:43:40,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:40,218 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 2 times [2019-11-15 22:43:40,219 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:40,219 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904370952] [2019-11-15 22:43:40,219 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:40,219 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:40,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:40,238 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:43:40,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:40,238 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626574, now seen corresponding path program 1 times [2019-11-15 22:43:40,239 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:40,239 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543691252] [2019-11-15 22:43:40,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:40,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:40,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:40,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:40,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:40,294 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:43:40,613 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-11-15 22:43:40,696 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:43:40,696 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:43:40,696 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:43:40,696 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:43:40,696 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:43:40,697 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:43:40,697 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:43:40,697 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:43:40,697 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-2.i_Iteration3_Lasso [2019-11-15 22:43:40,697 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:43:40,697 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:43:40,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:40,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:40,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:40,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:40,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:40,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:41,015 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-11-15 22:43:41,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:41,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:41,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:41,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:41,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:41,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:41,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:41,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:43:41,439 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 22:43:41,556 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:43:41,556 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:43:41,557 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:43:41,558 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:41,558 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:41,559 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:41,559 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:41,559 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:41,560 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:41,560 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:41,561 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:41,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:43:41,562 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:41,562 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:41,562 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:41,563 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:41,563 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:41,563 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:41,563 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:41,564 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:41,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:43:41,565 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:41,566 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:41,566 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:41,566 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:41,566 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:41,567 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:41,567 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:41,568 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:41,568 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:43:41,569 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:41,569 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:41,569 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:41,570 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:41,570 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:41,570 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:41,570 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:41,571 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:41,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:43:41,572 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:41,572 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:41,573 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:41,573 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:41,574 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:43:41,574 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:43:41,577 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:41,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:43:41,578 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:41,578 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:41,579 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:41,579 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:41,580 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:43:41,580 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:43:41,583 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:41,584 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:43:41,585 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:41,585 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 22:43:41,585 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:41,585 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:41,588 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 22:43:41,589 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:43:41,604 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:41,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:43:41,606 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:41,606 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:41,606 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:41,606 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:41,606 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:41,607 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:41,607 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:41,608 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:41,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:43:41,609 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:41,609 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:43:41,610 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:41,610 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:41,610 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:41,610 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:43:41,611 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:43:41,611 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:43:41,612 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:43:41,613 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:43:41,613 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:43:41,613 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:43:41,613 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:43:41,616 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:43:41,617 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:43:41,663 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:43:41,675 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:43:41,675 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 22:43:41,676 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:43:41,677 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:43:41,677 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:43:41,678 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~length2~0) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~length2~0 Supporting invariants [] [2019-11-15 22:43:41,721 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-11-15 22:43:41,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:41,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:43:41,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:43:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:41,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:43:41,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:43:41,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:43:41,806 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:43:41,806 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 42 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-11-15 22:43:41,839 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 42 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 55 states and 75 transitions. Complement of second has 6 states. [2019-11-15 22:43:41,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:43:41,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:43:41,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2019-11-15 22:43:41,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-15 22:43:41,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:43:41,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 11 letters. Loop has 2 letters. [2019-11-15 22:43:41,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:43:41,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-15 22:43:41,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:43:41,845 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 75 transitions. [2019-11-15 22:43:41,850 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-11-15 22:43:41,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 33 states and 44 transitions. [2019-11-15 22:43:41,852 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-15 22:43:41,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-11-15 22:43:41,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 44 transitions. [2019-11-15 22:43:41,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:43:41,853 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-11-15 22:43:41,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 44 transitions. [2019-11-15 22:43:41,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-11-15 22:43:41,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-15 22:43:41,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2019-11-15 22:43:41,861 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-11-15 22:43:41,861 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-11-15 22:43:41,861 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 22:43:41,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 44 transitions. [2019-11-15 22:43:41,862 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-11-15 22:43:41,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:43:41,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:43:41,866 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:43:41,866 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:43:41,867 INFO L791 eck$LassoCheckResult]: Stem: 479#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 461#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, 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~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 453#L555 assume !(main_~length1~0 < 1); 454#L555-2 assume !(main_~length2~0 < 1); 471#L558-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 472#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 481#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 482#L564-3 assume !(main_~i~0 < main_~length1~0); 483#L564-4 main_~i~1 := 0; 457#L568-3 assume !(main_~i~1 < main_~length2~0); 458#L568-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);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 478#L540 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 469#L518-4 [2019-11-15 22:43:41,867 INFO L793 eck$LassoCheckResult]: Loop: 469#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 474#L518-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 468#L518-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 469#L518-4 [2019-11-15 22:43:41,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:41,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1351083894, now seen corresponding path program 1 times [2019-11-15 22:43:41,868 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:41,868 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823293556] [2019-11-15 22:43:41,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:41,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:41,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:41,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:43:41,951 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823293556] [2019-11-15 22:43:41,951 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:41,951 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:43:41,951 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358880478] [2019-11-15 22:43:41,952 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:43:41,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:41,952 INFO L82 PathProgramCache]: Analyzing trace with hash 79603, now seen corresponding path program 1 times [2019-11-15 22:43:41,952 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:41,953 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376408285] [2019-11-15 22:43:41,953 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:41,953 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:41,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:43:41,960 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:43:42,018 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:42,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:43:42,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:43:42,019 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-11-15 22:43:42,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:42,053 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2019-11-15 22:43:42,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:43:42,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 44 transitions. [2019-11-15 22:43:42,058 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-11-15 22:43:42,058 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 44 transitions. [2019-11-15 22:43:42,058 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-11-15 22:43:42,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-11-15 22:43:42,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2019-11-15 22:43:42,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:43:42,059 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2019-11-15 22:43:42,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2019-11-15 22:43:42,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-11-15 22:43:42,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-15 22:43:42,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2019-11-15 22:43:42,062 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-11-15 22:43:42,062 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-11-15 22:43:42,062 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 22:43:42,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2019-11-15 22:43:42,063 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-11-15 22:43:42,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:43:42,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:43:42,064 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:43:42,064 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:43:42,065 INFO L791 eck$LassoCheckResult]: Stem: 553#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 535#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, 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~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 527#L555 assume !(main_~length1~0 < 1); 528#L555-2 assume !(main_~length2~0 < 1); 546#L558-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 547#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 555#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 556#L564-3 assume !(main_~i~0 < main_~length1~0); 557#L564-4 main_~i~1 := 0; 533#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 525#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 526#L568-3 assume !(main_~i~1 < main_~length2~0); 534#L568-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);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 552#L540 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 543#L518-4 [2019-11-15 22:43:42,065 INFO L793 eck$LassoCheckResult]: Loop: 543#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 548#L518-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 542#L518-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 543#L518-4 [2019-11-15 22:43:42,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:42,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1313217428, now seen corresponding path program 1 times [2019-11-15 22:43:42,065 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:42,065 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648341535] [2019-11-15 22:43:42,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:42,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:42,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:42,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:43:42,247 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648341535] [2019-11-15 22:43:42,247 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062899751] [2019-11-15 22:43:42,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3883bb27-4209-4d63-a15f-8fcd10022d67/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:43:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:42,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-15 22:43:42,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:43:42,519 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2019-11-15 22:43:42,537 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:43:42,537 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2019-11-15 22:43:42,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:43:42,550 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:43:42,552 INFO L392 ElimStorePlain]: Different costs {0=[v_arrayElimCell_1], 1=[v_arrayElimCell_2]} [2019-11-15 22:43:42,559 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:921) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkStemFeasibility(LassoCheck.java:880) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:794) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 22:43:42,563 INFO L168 Benchmark]: Toolchain (without parser) took 6512.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 214.4 MB). Free memory was 939.3 MB in the beginning and 1.0 GB in the end (delta: -63.1 MB). Peak memory consumption was 151.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:43:42,563 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:43:42,564 INFO L168 Benchmark]: CACSL2BoogieTranslator took 687.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -170.7 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:43:42,564 INFO L168 Benchmark]: Boogie Procedure Inliner took 108.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:43:42,565 INFO L168 Benchmark]: Boogie Preprocessor took 59.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:43:42,566 INFO L168 Benchmark]: RCFGBuilder took 604.30 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: 35.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:43:42,566 INFO L168 Benchmark]: BuchiAutomizer took 5048.43 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 72.4 MB). Peak memory consumption was 152.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:43:42,570 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 687.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -170.7 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 108.79 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 59.09 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 604.30 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: 35.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5048.43 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 72.4 MB). Peak memory consumption was 152.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...