./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstpcpy-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_27b410aa-4ee6-49ed-acd9-28a9d7682a8c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_27b410aa-4ee6-49ed-acd9-28a9d7682a8c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_27b410aa-4ee6-49ed-acd9-28a9d7682a8c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_27b410aa-4ee6-49ed-acd9-28a9d7682a8c/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstpcpy-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_27b410aa-4ee6-49ed-acd9-28a9d7682a8c/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_27b410aa-4ee6-49ed-acd9-28a9d7682a8c/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 97f817c294f65682bc18734ad52a0295ea6b342c ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:47:05,278 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:47:05,279 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:47:05,289 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:47:05,289 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:47:05,290 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:47:05,292 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:47:05,294 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:47:05,296 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:47:05,296 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:47:05,297 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:47:05,298 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:47:05,299 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:47:05,299 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:47:05,300 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:47:05,301 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:47:05,302 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:47:05,303 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:47:05,304 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:47:05,306 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:47:05,308 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:47:05,309 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:47:05,310 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:47:05,310 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:47:05,312 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:47:05,313 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:47:05,313 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:47:05,314 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:47:05,314 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:47:05,315 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:47:05,315 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:47:05,316 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:47:05,316 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:47:05,317 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:47:05,318 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:47:05,318 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:47:05,319 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:47:05,319 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:47:05,319 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:47:05,320 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:47:05,320 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:47:05,321 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_27b410aa-4ee6-49ed-acd9-28a9d7682a8c/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 20:47:05,335 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:47:05,336 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:47:05,337 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:47:05,337 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:47:05,337 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:47:05,338 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 20:47:05,338 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 20:47:05,338 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 20:47:05,338 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 20:47:05,338 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 20:47:05,339 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 20:47:05,339 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:47:05,339 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:47:05,339 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 20:47:05,340 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:47:05,340 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:47:05,340 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:47:05,340 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 20:47:05,341 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 20:47:05,341 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 20:47:05,341 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:47:05,341 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:47:05,342 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 20:47:05,342 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:47:05,342 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 20:47:05,342 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:47:05,342 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:47:05,343 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 20:47:05,343 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:47:05,343 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:47:05,343 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 20:47:05,344 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 20:47:05,345 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_27b410aa-4ee6-49ed-acd9-28a9d7682a8c/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 -> 97f817c294f65682bc18734ad52a0295ea6b342c [2019-11-15 20:47:05,368 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:47:05,377 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:47:05,380 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:47:05,381 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:47:05,381 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:47:05,382 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_27b410aa-4ee6-49ed-acd9-28a9d7682a8c/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstpcpy-alloca-1.i [2019-11-15 20:47:05,428 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_27b410aa-4ee6-49ed-acd9-28a9d7682a8c/bin/uautomizer/data/05e761282/87ac11302f9d4e3da5bf9d1712990c0f/FLAGc2cacef1e [2019-11-15 20:47:05,868 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:47:05,869 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_27b410aa-4ee6-49ed-acd9-28a9d7682a8c/sv-benchmarks/c/array-memsafety/openbsd_cstpcpy-alloca-1.i [2019-11-15 20:47:05,884 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_27b410aa-4ee6-49ed-acd9-28a9d7682a8c/bin/uautomizer/data/05e761282/87ac11302f9d4e3da5bf9d1712990c0f/FLAGc2cacef1e [2019-11-15 20:47:06,232 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_27b410aa-4ee6-49ed-acd9-28a9d7682a8c/bin/uautomizer/data/05e761282/87ac11302f9d4e3da5bf9d1712990c0f [2019-11-15 20:47:06,234 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:47:06,235 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:47:06,236 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:47:06,236 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:47:06,239 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:47:06,240 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:47:06" (1/1) ... [2019-11-15 20:47:06,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aa2f979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:47:06, skipping insertion in model container [2019-11-15 20:47:06,242 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:47:06" (1/1) ... [2019-11-15 20:47:06,249 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:47:06,287 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:47:06,667 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:47:06,677 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:47:06,739 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:47:06,794 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:47:06,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:47:06 WrapperNode [2019-11-15 20:47:06,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:47:06,797 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:47:06,797 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:47:06,797 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:47:06,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:47:06" (1/1) ... [2019-11-15 20:47:06,818 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:47:06" (1/1) ... [2019-11-15 20:47:06,838 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:47:06,838 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:47:06,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:47:06,839 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:47:06,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:47:06" (1/1) ... [2019-11-15 20:47:06,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:47:06" (1/1) ... [2019-11-15 20:47:06,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:47:06" (1/1) ... [2019-11-15 20:47:06,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:47:06" (1/1) ... [2019-11-15 20:47:06,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:47:06" (1/1) ... [2019-11-15 20:47:06,868 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:47:06" (1/1) ... [2019-11-15 20:47:06,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:47:06" (1/1) ... [2019-11-15 20:47:06,880 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:47:06,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:47:06,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:47:06,886 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:47:06,886 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:47:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27b410aa-4ee6-49ed-acd9-28a9d7682a8c/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 20:47:06,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 20:47:06,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:47:06,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:47:06,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:47:06,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:47:06,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:47:07,207 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:47:07,207 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 20:47:07,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:47:07 BoogieIcfgContainer [2019-11-15 20:47:07,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:47:07,209 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 20:47:07,209 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 20:47:07,212 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 20:47:07,221 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:47:07,222 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 08:47:06" (1/3) ... [2019-11-15 20:47:07,222 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ceb9db0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:47:07, skipping insertion in model container [2019-11-15 20:47:07,223 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:47:07,223 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:47:06" (2/3) ... [2019-11-15 20:47:07,223 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ceb9db0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:47:07, skipping insertion in model container [2019-11-15 20:47:07,223 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:47:07,223 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:47:07" (3/3) ... [2019-11-15 20:47:07,225 INFO L371 chiAutomizerObserver]: Analyzing ICFG openbsd_cstpcpy-alloca-1.i [2019-11-15 20:47:07,304 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 20:47:07,304 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 20:47:07,304 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 20:47:07,305 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:47:07,305 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:47:07,305 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 20:47:07,305 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:47:07,305 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 20:47:07,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-15 20:47:07,345 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 20:47:07,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:47:07,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:47:07,352 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 20:47:07,352 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:47:07,352 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 20:47:07,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-15 20:47:07,355 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 20:47:07,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:47:07,355 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:47:07,355 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 20:47:07,356 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:47:07,363 INFO L791 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_#t~ret11.base, main_#t~ret11.offset, main_~length1~0, main_~length2~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length1~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~length2~0 := main_#t~nondet6;havoc main_#t~nondet6; 10#L521true assume !(main_~length1~0 < 1); 13#L521-2true assume !(main_~length2~0 < 1); 6#L524-1true assume !(main_~length1~0 < main_~length2~0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 16#L531-3true [2019-11-15 20:47:07,363 INFO L793 eck$LassoCheckResult]: Loop: 16#L531-3true assume !!(main_~i~0 < main_~length2~0);call write~int(main_#t~nondet10, main_~nondetString~0.base, main_~nondetString~0.offset + main_~i~0, 1);havoc main_#t~nondet10; 15#L531-2true main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 16#L531-3true [2019-11-15 20:47:07,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:07,368 INFO L82 PathProgramCache]: Analyzing trace with hash 28695882, now seen corresponding path program 1 times [2019-11-15 20:47:07,376 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:47:07,376 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407870064] [2019-11-15 20:47:07,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:07,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:07,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:47:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:47:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:47:07,515 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:47:07,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:07,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1827, now seen corresponding path program 1 times [2019-11-15 20:47:07,516 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:47:07,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527318525] [2019-11-15 20:47:07,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:07,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:07,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:47:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:47:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:47:07,535 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:47:07,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:07,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1806939692, now seen corresponding path program 1 times [2019-11-15 20:47:07,537 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:47:07,537 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656010457] [2019-11-15 20:47:07,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:07,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:07,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:47:07,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:47:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:47:07,585 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:47:07,839 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-11-15 20:47:07,948 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:47:07,949 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:47:07,949 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:47:07,950 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:47:07,950 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:47:07,950 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:47:07,950 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:47:07,950 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:47:07,951 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstpcpy-alloca-1.i_Iteration1_Lasso [2019-11-15 20:47:07,951 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:47:07,951 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:47:07,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:47:07,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:47:07,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:47:07,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:47:08,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:47:08,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:47:08,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:47:08,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:47:08,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:47:08,167 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-11-15 20:47:08,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:47:08,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:47:08,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:47:08,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:47:08,605 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 20:47:08,725 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:47:08,732 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:47:08,734 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 20:47:08,738 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:47:08,739 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:47:08,739 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:47:08,740 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:47:08,747 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:47:08,747 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:47:08,765 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:47:08,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:47:08,769 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:47:08,769 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:47:08,770 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:47:08,770 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:47:08,770 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:47:08,771 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:47:08,771 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:47:08,772 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:47:08,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:47:08,779 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:47:08,779 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:47:08,780 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:47:08,780 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:47:08,781 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:47:08,782 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:47:08,782 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:47:08,784 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:47:08,784 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 20:47:08,785 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:47:08,785 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:47:08,786 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:47:08,793 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:47:08,794 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:47:08,794 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:47:08,794 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:47:08,795 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:47:08,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:47:08,797 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:47:08,797 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:47:08,797 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:47:08,798 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:47:08,799 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:47:08,800 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:47:08,805 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:47:08,813 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 20:47:08,814 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:47:08,814 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:47:08,814 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:47:08,814 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:47:08,815 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:47:08,815 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:47:08,815 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:47:08,830 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:47:08,831 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 20:47:08,831 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:47:08,831 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:47:08,832 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:47:08,832 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:47:08,833 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:47:08,834 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:47:08,837 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:47:08,838 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 20:47:08,838 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:47:08,839 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:47:08,839 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:47:08,839 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:47:08,841 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:47:08,844 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:47:08,849 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:47:08,853 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 20:47:08,855 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:47:08,861 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:47:08,862 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:47:08,862 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:47:08,862 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:47:08,863 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:47:08,863 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:47:08,864 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:47:08,864 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 20:47:08,865 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:47:08,868 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 20:47:08,868 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:47:08,869 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:47:08,874 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:47:08,880 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:47:08,925 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:47:08,931 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 20:47:08,932 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:47:08,932 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:47:08,933 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:47:08,933 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:47:08,937 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:47:08,937 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:47:08,946 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:47:08,947 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 20:47:08,947 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:47:08,948 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:47:08,948 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:47:08,948 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:47:08,950 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:47:08,950 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:47:08,959 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:47:08,959 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 20:47:08,960 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:47:08,960 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:47:08,961 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:47:08,961 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:47:08,964 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:47:08,964 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:47:09,015 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:47:09,107 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-15 20:47:09,107 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-11-15 20:47:09,110 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:47:09,112 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:47:09,113 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:47:09,114 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length2~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length2~0 Supporting invariants [] [2019-11-15 20:47:09,131 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 20:47:09,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:47:09,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:47:09,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:47:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:47:09,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:47:09,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:47:09,211 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 20:47:09,227 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 20:47:09,228 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2019-11-15 20:47:09,283 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 3 states. Result 39 states and 50 transitions. Complement of second has 7 states. [2019-11-15 20:47:09,284 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 20:47:09,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:47:09,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2019-11-15 20:47:09,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-15 20:47:09,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:47:09,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 20:47:09,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:47:09,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-15 20:47:09,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:47:09,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2019-11-15 20:47:09,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:47:09,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 12 states and 16 transitions. [2019-11-15 20:47:09,304 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 20:47:09,305 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 20:47:09,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-11-15 20:47:09,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:47:09,306 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-15 20:47:09,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-11-15 20:47:09,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-15 20:47:09,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-15 20:47:09,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-11-15 20:47:09,336 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-15 20:47:09,336 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-15 20:47:09,336 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 20:47:09,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-11-15 20:47:09,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:47:09,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:47:09,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:47:09,338 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:47:09,338 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:47:09,339 INFO L791 eck$LassoCheckResult]: Stem: 130#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 127#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_#t~ret11.base, main_#t~ret11.offset, main_~length1~0, main_~length2~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length1~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~length2~0 := main_#t~nondet6;havoc main_#t~nondet6; 128#L521 assume !(main_~length1~0 < 1); 129#L521-2 assume !(main_~length2~0 < 1); 133#L524-1 assume !(main_~length1~0 < main_~length2~0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 136#L531-3 assume !(main_~i~0 < main_~length2~0); 138#L531-4 call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length2~0 - 1), 1);cstpcpy_#in~to.base, cstpcpy_#in~to.offset, cstpcpy_#in~from.base, cstpcpy_#in~from.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;havoc cstpcpy_#res.base, cstpcpy_#res.offset;havoc cstpcpy_#t~pre2.base, cstpcpy_#t~pre2.offset, cstpcpy_#t~pre3.base, cstpcpy_#t~pre3.offset, cstpcpy_#t~mem4, cstpcpy_~to.base, cstpcpy_~to.offset, cstpcpy_~from.base, cstpcpy_~from.offset;cstpcpy_~to.base, cstpcpy_~to.offset := cstpcpy_#in~to.base, cstpcpy_#in~to.offset;cstpcpy_~from.base, cstpcpy_~from.offset := cstpcpy_#in~from.base, cstpcpy_#in~from.offset; 137#L515-4 [2019-11-15 20:47:09,342 INFO L793 eck$LassoCheckResult]: Loop: 137#L515-4 call cstpcpy_#t~mem4 := read~int(cstpcpy_~from.base, cstpcpy_~from.offset, 1);call write~int(cstpcpy_#t~mem4, cstpcpy_~to.base, cstpcpy_~to.offset, 1); 131#L515-1 assume !!(0 != cstpcpy_#t~mem4);havoc cstpcpy_#t~mem4; 132#L515-3 cstpcpy_#t~pre2.base, cstpcpy_#t~pre2.offset := cstpcpy_~from.base, 1 + cstpcpy_~from.offset;cstpcpy_~from.base, cstpcpy_~from.offset := cstpcpy_~from.base, 1 + cstpcpy_~from.offset;havoc cstpcpy_#t~pre2.base, cstpcpy_#t~pre2.offset;cstpcpy_#t~pre3.base, cstpcpy_#t~pre3.offset := cstpcpy_~to.base, 1 + cstpcpy_~to.offset;cstpcpy_~to.base, cstpcpy_~to.offset := cstpcpy_~to.base, 1 + cstpcpy_~to.offset;havoc cstpcpy_#t~pre3.base, cstpcpy_#t~pre3.offset; 137#L515-4 [2019-11-15 20:47:09,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:09,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1806939634, now seen corresponding path program 1 times [2019-11-15 20:47:09,343 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:47:09,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037799858] [2019-11-15 20:47:09,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:09,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:09,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:47:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:47:09,431 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 20:47:09,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037799858] [2019-11-15 20:47:09,432 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:47:09,432 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:47:09,432 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425755362] [2019-11-15 20:47:09,434 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:47:09,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:09,434 INFO L82 PathProgramCache]: Analyzing trace with hash 66694, now seen corresponding path program 1 times [2019-11-15 20:47:09,434 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:47:09,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147138504] [2019-11-15 20:47:09,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:09,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:09,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:47:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:47:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:47:09,445 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:47:09,520 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:47:09,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:47:09,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:47:09,523 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-11-15 20:47:09,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:47:09,547 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-11-15 20:47:09,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:47:09,548 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2019-11-15 20:47:09,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:47:09,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2019-11-15 20:47:09,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 20:47:09,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 20:47:09,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2019-11-15 20:47:09,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:47:09,550 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-11-15 20:47:09,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2019-11-15 20:47:09,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-11-15 20:47:09,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-15 20:47:09,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2019-11-15 20:47:09,569 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-11-15 20:47:09,569 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-11-15 20:47:09,569 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 20:47:09,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2019-11-15 20:47:09,570 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:47:09,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:47:09,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:47:09,571 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:47:09,571 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:47:09,571 INFO L791 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 159#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_#t~ret11.base, main_#t~ret11.offset, main_~length1~0, main_~length2~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length1~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~length2~0 := main_#t~nondet6;havoc main_#t~nondet6; 160#L521 assume !(main_~length1~0 < 1); 161#L521-2 assume !(main_~length2~0 < 1); 165#L524-1 assume !(main_~length1~0 < main_~length2~0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 168#L531-3 assume !!(main_~i~0 < main_~length2~0);call write~int(main_#t~nondet10, main_~nondetString~0.base, main_~nondetString~0.offset + main_~i~0, 1);havoc main_#t~nondet10; 166#L531-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 167#L531-3 assume !(main_~i~0 < main_~length2~0); 169#L531-4 call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length2~0 - 1), 1);cstpcpy_#in~to.base, cstpcpy_#in~to.offset, cstpcpy_#in~from.base, cstpcpy_#in~from.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;havoc cstpcpy_#res.base, cstpcpy_#res.offset;havoc cstpcpy_#t~pre2.base, cstpcpy_#t~pre2.offset, cstpcpy_#t~pre3.base, cstpcpy_#t~pre3.offset, cstpcpy_#t~mem4, cstpcpy_~to.base, cstpcpy_~to.offset, cstpcpy_~from.base, cstpcpy_~from.offset;cstpcpy_~to.base, cstpcpy_~to.offset := cstpcpy_#in~to.base, cstpcpy_#in~to.offset;cstpcpy_~from.base, cstpcpy_~from.offset := cstpcpy_#in~from.base, cstpcpy_#in~from.offset; 170#L515-4 [2019-11-15 20:47:09,572 INFO L793 eck$LassoCheckResult]: Loop: 170#L515-4 call cstpcpy_#t~mem4 := read~int(cstpcpy_~from.base, cstpcpy_~from.offset, 1);call write~int(cstpcpy_#t~mem4, cstpcpy_~to.base, cstpcpy_~to.offset, 1); 163#L515-1 assume !!(0 != cstpcpy_#t~mem4);havoc cstpcpy_#t~mem4; 164#L515-3 cstpcpy_#t~pre2.base, cstpcpy_#t~pre2.offset := cstpcpy_~from.base, 1 + cstpcpy_~from.offset;cstpcpy_~from.base, cstpcpy_~from.offset := cstpcpy_~from.base, 1 + cstpcpy_~from.offset;havoc cstpcpy_#t~pre2.base, cstpcpy_#t~pre2.offset;cstpcpy_#t~pre3.base, cstpcpy_#t~pre3.offset := cstpcpy_~to.base, 1 + cstpcpy_~to.offset;cstpcpy_~to.base, cstpcpy_~to.offset := cstpcpy_~to.base, 1 + cstpcpy_~to.offset;havoc cstpcpy_#t~pre3.base, cstpcpy_#t~pre3.offset; 170#L515-4 [2019-11-15 20:47:09,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:09,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1302257236, now seen corresponding path program 1 times [2019-11-15 20:47:09,573 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:47:09,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295196041] [2019-11-15 20:47:09,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:09,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:09,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:47:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:47:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:47:09,597 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:47:09,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:09,598 INFO L82 PathProgramCache]: Analyzing trace with hash 66694, now seen corresponding path program 2 times [2019-11-15 20:47:09,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:47:09,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179076713] [2019-11-15 20:47:09,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:09,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:09,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:47:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:47:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:47:09,607 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:47:09,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:09,607 INFO L82 PathProgramCache]: Analyzing trace with hash -894230189, now seen corresponding path program 1 times [2019-11-15 20:47:09,607 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:47:09,608 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787686316] [2019-11-15 20:47:09,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:09,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:09,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:47:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:47:09,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:47:09,734 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787686316] [2019-11-15 20:47:09,735 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273719115] [2019-11-15 20:47:09,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27b410aa-4ee6-49ed-acd9-28a9d7682a8c/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 20:47:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:47:09,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 20:47:09,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:47:09,898 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-11-15 20:47:09,898 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:47:09,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:47:09,909 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 20:47:09,910 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:23 [2019-11-15 20:47:09,934 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:47:09,936 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:47:09,936 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 18 treesize of output 10 [2019-11-15 20:47:09,937 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:47:09,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:47:09,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:47:09,949 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:33, output treesize:3 [2019-11-15 20:47:09,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:47:09,951 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:47:09,951 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2019-11-15 20:47:09,951 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250671559] [2019-11-15 20:47:10,018 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:47:10,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 20:47:10,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:47:10,018 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand 12 states. [2019-11-15 20:47:10,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:47:10,240 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-11-15 20:47:10,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:47:10,241 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2019-11-15 20:47:10,242 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:47:10,242 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 15 states and 18 transitions. [2019-11-15 20:47:10,243 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 20:47:10,243 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 20:47:10,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 18 transitions. [2019-11-15 20:47:10,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:47:10,243 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-11-15 20:47:10,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 18 transitions. [2019-11-15 20:47:10,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-11-15 20:47:10,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-15 20:47:10,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2019-11-15 20:47:10,245 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-11-15 20:47:10,245 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-11-15 20:47:10,245 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 20:47:10,245 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2019-11-15 20:47:10,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:47:10,246 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:47:10,246 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:47:10,246 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:47:10,246 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:47:10,247 INFO L791 eck$LassoCheckResult]: Stem: 250#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 247#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_#t~ret11.base, main_#t~ret11.offset, main_~length1~0, main_~length2~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length1~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~length2~0 := main_#t~nondet6;havoc main_#t~nondet6; 248#L521 assume !(main_~length1~0 < 1); 249#L521-2 assume !(main_~length2~0 < 1); 253#L524-1 assume !(main_~length1~0 < main_~length2~0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 256#L531-3 assume !!(main_~i~0 < main_~length2~0);call write~int(main_#t~nondet10, main_~nondetString~0.base, main_~nondetString~0.offset + main_~i~0, 1);havoc main_#t~nondet10; 254#L531-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 255#L531-3 assume !!(main_~i~0 < main_~length2~0);call write~int(main_#t~nondet10, main_~nondetString~0.base, main_~nondetString~0.offset + main_~i~0, 1);havoc main_#t~nondet10; 257#L531-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 260#L531-3 assume !(main_~i~0 < main_~length2~0); 259#L531-4 call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length2~0 - 1), 1);cstpcpy_#in~to.base, cstpcpy_#in~to.offset, cstpcpy_#in~from.base, cstpcpy_#in~from.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;havoc cstpcpy_#res.base, cstpcpy_#res.offset;havoc cstpcpy_#t~pre2.base, cstpcpy_#t~pre2.offset, cstpcpy_#t~pre3.base, cstpcpy_#t~pre3.offset, cstpcpy_#t~mem4, cstpcpy_~to.base, cstpcpy_~to.offset, cstpcpy_~from.base, cstpcpy_~from.offset;cstpcpy_~to.base, cstpcpy_~to.offset := cstpcpy_#in~to.base, cstpcpy_#in~to.offset;cstpcpy_~from.base, cstpcpy_~from.offset := cstpcpy_#in~from.base, cstpcpy_#in~from.offset; 258#L515-4 [2019-11-15 20:47:10,247 INFO L793 eck$LassoCheckResult]: Loop: 258#L515-4 call cstpcpy_#t~mem4 := read~int(cstpcpy_~from.base, cstpcpy_~from.offset, 1);call write~int(cstpcpy_#t~mem4, cstpcpy_~to.base, cstpcpy_~to.offset, 1); 251#L515-1 assume !!(0 != cstpcpy_#t~mem4);havoc cstpcpy_#t~mem4; 252#L515-3 cstpcpy_#t~pre2.base, cstpcpy_#t~pre2.offset := cstpcpy_~from.base, 1 + cstpcpy_~from.offset;cstpcpy_~from.base, cstpcpy_~from.offset := cstpcpy_~from.base, 1 + cstpcpy_~from.offset;havoc cstpcpy_#t~pre2.base, cstpcpy_#t~pre2.offset;cstpcpy_#t~pre3.base, cstpcpy_#t~pre3.offset := cstpcpy_~to.base, 1 + cstpcpy_~to.offset;cstpcpy_~to.base, cstpcpy_~to.offset := cstpcpy_~to.base, 1 + cstpcpy_~to.offset;havoc cstpcpy_#t~pre3.base, cstpcpy_#t~pre3.offset; 258#L515-4 [2019-11-15 20:47:10,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:10,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1633777206, now seen corresponding path program 2 times [2019-11-15 20:47:10,247 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:47:10,247 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710342038] [2019-11-15 20:47:10,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:10,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:10,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:47:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:47:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:47:10,269 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:47:10,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:10,270 INFO L82 PathProgramCache]: Analyzing trace with hash 66694, now seen corresponding path program 3 times [2019-11-15 20:47:10,270 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:47:10,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583967139] [2019-11-15 20:47:10,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:10,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:10,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:47:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:47:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:47:10,277 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:47:10,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:10,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1287382577, now seen corresponding path program 2 times [2019-11-15 20:47:10,278 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:47:10,278 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134531743] [2019-11-15 20:47:10,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:10,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:10,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:47:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:47:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:47:10,303 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:47:10,782 WARN L191 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 102 [2019-11-15 20:47:10,895 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-15 20:47:10,897 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:47:10,897 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:47:10,897 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:47:10,897 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:47:10,897 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:47:10,897 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:47:10,898 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:47:10,898 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:47:10,898 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstpcpy-alloca-1.i_Iteration4_Lasso [2019-11-15 20:47:10,898 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:47:10,898 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:47:10,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:47:10,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:47:11,133 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-11-15 20:47:11,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:47:11,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:47:11,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:47:11,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:47:11,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:47:11,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:47:11,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:47:11,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:47:11,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:47:11,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:47:11,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:47:11,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:47:11,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:47:11,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:47:11,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:47:11,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:47:11,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:47:11,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:47:11,906 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-11-15 20:47:11,968 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:47:11,968 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:47:11,968 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 20:47:11,969 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:47:11,969 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:47:11,969 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:47:11,969 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:47:11,969 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:47:11,970 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:47:11,970 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:47:11,970 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:47:11,970 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 20:47:11,971 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:47:11,971 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:47:11,971 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:47:11,971 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:47:11,972 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:47:11,972 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:47:11,973 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:47:11,974 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 20:47:11,974 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:47:11,974 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:47:11,974 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:47:11,974 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:47:11,974 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:47:11,975 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:47:11,975 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:47:11,975 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:47:11,976 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 20:47:11,976 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:47:11,976 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:47:11,976 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:47:11,976 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:47:11,978 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:47:11,978 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:47:11,989 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:47:11,990 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 20:47:11,990 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:47:11,990 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:47:11,991 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:47:11,991 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:47:11,992 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:47:11,992 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:47:11,993 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:47:11,994 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 20:47:11,994 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:47:11,995 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:47:11,995 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:47:11,995 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:47:12,003 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:47:12,003 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:47:12,116 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:47:12,149 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:47:12,149 INFO L444 ModelExtractionUtils]: 39 out of 43 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 20:47:12,150 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:47:12,153 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:47:12,153 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:47:12,153 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstpcpy_~to.base)_1, ULTIMATE.start_cstpcpy_~to.offset) = 1*v_rep(select #length ULTIMATE.start_cstpcpy_~to.base)_1 - 1*ULTIMATE.start_cstpcpy_~to.offset Supporting invariants [] [2019-11-15 20:47:12,196 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-11-15 20:47:12,198 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 20:47:12,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:47:12,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:47:12,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:47:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:47:12,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:47:12,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:47:12,247 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 20:47:12,247 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 20:47:12,247 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-15 20:47:12,257 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 17 states and 21 transitions. Complement of second has 4 states. [2019-11-15 20:47:12,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 20:47:12,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:47:12,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-11-15 20:47:12,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 11 letters. Loop has 3 letters. [2019-11-15 20:47:12,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:47:12,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-15 20:47:12,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:47:12,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 11 letters. Loop has 6 letters. [2019-11-15 20:47:12,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:47:12,259 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2019-11-15 20:47:12,260 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:47:12,261 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 0 states and 0 transitions. [2019-11-15 20:47:12,261 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 20:47:12,261 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 20:47:12,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 20:47:12,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:47:12,261 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:47:12,261 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:47:12,261 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:47:12,261 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 20:47:12,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:47:12,261 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:47:12,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 20:47:12,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 08:47:12 BoogieIcfgContainer [2019-11-15 20:47:12,267 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 20:47:12,267 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:47:12,267 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:47:12,268 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:47:12,268 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:47:07" (3/4) ... [2019-11-15 20:47:12,271 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 20:47:12,271 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:47:12,273 INFO L168 Benchmark]: Toolchain (without parser) took 6037.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 193.5 MB). Free memory was 944.7 MB in the beginning and 1.0 GB in the end (delta: -66.5 MB). Peak memory consumption was 126.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:47:12,273 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:47:12,274 INFO L168 Benchmark]: CACSL2BoogieTranslator took 560.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -187.8 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:47:12,274 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.23 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 20:47:12,275 INFO L168 Benchmark]: Boogie Preprocessor took 41.94 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:47:12,275 INFO L168 Benchmark]: RCFGBuilder took 328.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:47:12,276 INFO L168 Benchmark]: BuchiAutomizer took 5057.93 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 43.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.1 MB). Peak memory consumption was 135.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:47:12,276 INFO L168 Benchmark]: Witness Printer took 4.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:47:12,279 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 560.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -187.8 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.23 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 41.94 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 328.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5057.93 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 43.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.1 MB). Peak memory consumption was 135.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + length2 and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[to] + -1 * to and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.9s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 4.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 47 SDtfs, 62 SDslu, 60 SDs, 0 SdLazy, 85 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital171 mio100 ax111 hnf98 lsp84 ukn80 mio100 lsp51 div100 bol100 ite100 ukn100 eq180 hnf89 smp100 dnf159 smp96 tf100 neg94 sie120 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 60ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...