./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrcat-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f6fb2bb1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/openbsd_cstrcat-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 cb6ff0b2d9abd29a15d3eb2d5a86a23b460e9725 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-f6fb2bb [2019-11-19 20:08:20,277 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 20:08:20,280 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 20:08:20,299 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 20:08:20,300 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 20:08:20,302 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 20:08:20,304 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 20:08:20,313 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 20:08:20,318 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 20:08:20,323 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 20:08:20,324 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 20:08:20,326 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 20:08:20,326 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 20:08:20,329 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 20:08:20,330 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 20:08:20,332 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 20:08:20,333 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 20:08:20,334 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 20:08:20,337 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 20:08:20,340 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 20:08:20,345 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 20:08:20,348 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 20:08:20,351 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 20:08:20,353 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 20:08:20,357 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 20:08:20,358 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 20:08:20,358 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 20:08:20,361 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 20:08:20,361 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 20:08:20,362 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 20:08:20,363 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 20:08:20,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 20:08:20,364 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 20:08:20,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 20:08:20,367 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 20:08:20,367 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 20:08:20,368 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 20:08:20,369 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 20:08:20,369 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 20:08:20,370 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 20:08:20,373 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 20:08:20,374 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-19 20:08:20,401 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 20:08:20,402 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 20:08:20,403 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 20:08:20,404 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 20:08:20,405 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 20:08:20,405 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-19 20:08:20,405 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-19 20:08:20,406 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-19 20:08:20,406 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-19 20:08:20,406 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-19 20:08:20,407 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-19 20:08:20,408 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 20:08:20,408 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 20:08:20,408 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 20:08:20,408 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 20:08:20,409 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 20:08:20,409 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 20:08:20,409 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-19 20:08:20,410 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-19 20:08:20,410 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-19 20:08:20,410 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 20:08:20,410 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 20:08:20,411 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-19 20:08:20,411 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 20:08:20,411 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-19 20:08:20,412 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 20:08:20,412 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 20:08:20,412 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-19 20:08:20,412 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 20:08:20,413 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 20:08:20,413 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-19 20:08:20,414 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-19 20:08:20,414 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> cb6ff0b2d9abd29a15d3eb2d5a86a23b460e9725 [2019-11-19 20:08:20,710 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 20:08:20,728 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 20:08:20,732 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 20:08:20,734 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 20:08:20,734 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 20:08:20,735 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrcat-alloca-2.i [2019-11-19 20:08:20,796 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e726bf83/0ea0270c7a054ff291103561f6b7a3a8/FLAG50a9246ec [2019-11-19 20:08:21,321 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 20:08:21,322 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrcat-alloca-2.i [2019-11-19 20:08:21,348 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e726bf83/0ea0270c7a054ff291103561f6b7a3a8/FLAG50a9246ec [2019-11-19 20:08:21,644 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e726bf83/0ea0270c7a054ff291103561f6b7a3a8 [2019-11-19 20:08:21,647 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 20:08:21,648 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 20:08:21,649 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 20:08:21,650 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 20:08:21,653 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 20:08:21,654 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:08:21" (1/1) ... [2019-11-19 20:08:21,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4415c148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:08:21, skipping insertion in model container [2019-11-19 20:08:21,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:08:21" (1/1) ... [2019-11-19 20:08:21,665 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 20:08:21,714 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 20:08:22,158 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 20:08:22,169 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 20:08:22,217 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 20:08:22,270 INFO L192 MainTranslator]: Completed translation [2019-11-19 20:08:22,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:08:22 WrapperNode [2019-11-19 20:08:22,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 20:08:22,272 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 20:08:22,273 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 20:08:22,273 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 20:08:22,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:08:22" (1/1) ... [2019-11-19 20:08:22,298 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:08:22" (1/1) ... [2019-11-19 20:08:22,323 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 20:08:22,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 20:08:22,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 20:08:22,324 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 20:08:22,332 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:08:22" (1/1) ... [2019-11-19 20:08:22,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:08:22" (1/1) ... [2019-11-19 20:08:22,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:08:22" (1/1) ... [2019-11-19 20:08:22,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:08:22" (1/1) ... [2019-11-19 20:08:22,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:08:22" (1/1) ... [2019-11-19 20:08:22,351 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:08:22" (1/1) ... [2019-11-19 20:08:22,353 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:08:22" (1/1) ... [2019-11-19 20:08:22,356 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 20:08:22,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 20:08:22,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 20:08:22,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 20:08:22,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:08:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-19 20:08:22,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 20:08:22,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 20:08:22,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 20:08:22,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 20:08:22,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 20:08:22,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 20:08:22,765 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 20:08:22,766 INFO L285 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-19 20:08:22,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:08:22 BoogieIcfgContainer [2019-11-19 20:08:22,767 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 20:08:22,768 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-19 20:08:22,768 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-19 20:08:22,772 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-19 20:08:22,773 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 20:08:22,774 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 08:08:21" (1/3) ... [2019-11-19 20:08:22,775 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43d54eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 08:08:22, skipping insertion in model container [2019-11-19 20:08:22,776 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 20:08:22,776 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:08:22" (2/3) ... [2019-11-19 20:08:22,776 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43d54eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 08:08:22, skipping insertion in model container [2019-11-19 20:08:22,777 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 20:08:22,777 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:08:22" (3/3) ... [2019-11-19 20:08:22,779 INFO L371 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrcat-alloca-2.i [2019-11-19 20:08:22,822 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-19 20:08:22,822 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-19 20:08:22,822 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-19 20:08:22,822 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 20:08:22,823 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 20:08:22,823 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-19 20:08:22,823 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 20:08:22,823 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-19 20:08:22,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2019-11-19 20:08:22,863 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9 [2019-11-19 20:08:22,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 20:08:22,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 20:08:22,870 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-19 20:08:22,870 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-19 20:08:22,870 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-19 20:08:22,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2019-11-19 20:08:22,872 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9 [2019-11-19 20:08:22,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 20:08:22,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 20:08:22,874 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-19 20:08:22,874 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-19 20:08:22,882 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 7#L525true assume !(main_~length1~0 < 1); 12#L525-2true assume !(main_~length2~0 < 2); 24#L528-1true assume !(main_~length3~0 < 1); 15#L531-1true assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 9#L538-3true [2019-11-19 20:08:22,883 INFO L796 eck$LassoCheckResult]: Loop: 9#L538-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet13, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 6#L538-2true main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 9#L538-3true [2019-11-19 20:08:22,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:08:22,889 INFO L82 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2019-11-19 20:08:22,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:08:22,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047868632] [2019-11-19 20:08:22,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:08:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:23,085 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:08:23,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:08:23,087 INFO L82 PathProgramCache]: Analyzing trace with hash 2019, now seen corresponding path program 1 times [2019-11-19 20:08:23,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:08:23,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416046823] [2019-11-19 20:08:23,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:08:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:23,138 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:08:23,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:08:23,144 INFO L82 PathProgramCache]: Analyzing trace with hash 180553841, now seen corresponding path program 1 times [2019-11-19 20:08:23,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:08:23,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116613553] [2019-11-19 20:08:23,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:08:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:23,244 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:08:23,535 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-11-19 20:08:23,638 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 20:08:23,639 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 20:08:23,639 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 20:08:23,639 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 20:08:23,640 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 20:08:23,640 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:23,640 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 20:08:23,640 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 20:08:23,640 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcat-alloca-2.i_Iteration1_Lasso [2019-11-19 20:08:23,641 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 20:08:23,641 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 20:08:23,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:23,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:23,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:23,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:23,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:23,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:23,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:23,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:23,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:23,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:23,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:23,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:23,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:23,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:23,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:23,919 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-11-19 20:08:23,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:23,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:24,526 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-19 20:08:24,575 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 20:08:24,581 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 20:08:24,598 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 20:08:24,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:24,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:08:24,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:24,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:24,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:24,605 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:08:24,606 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:24,609 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 20:08:24,628 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-19 20:08:24,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:24,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:08:24,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:24,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:24,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:24,634 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:08:24,634 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:24,640 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:24,652 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-19 20:08:24,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:24,657 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:08:24,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:24,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:24,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:24,658 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:08:24,659 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:08:24,661 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:24,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 20:08:24,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:24,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:24,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:24,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:24,686 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:08:24,686 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 20:08:24,690 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:24,700 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-19 20:08:24,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:24,703 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:08:24,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:24,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:24,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:24,706 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:08:24,706 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:08:24,709 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 20:08:24,717 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-19 20:08:24,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:24,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:24,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:24,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:24,724 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:08:24,725 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:24,731 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 20:08:24,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 20:08:24,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:24,745 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:08:24,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:24,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:24,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:24,747 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:08:24,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:24,751 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 20:08:24,763 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-19 20:08:24,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:24,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:08:24,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:24,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:24,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:24,767 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:08:24,768 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:24,771 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:24,792 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-19 20:08:24,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:24,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:24,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:24,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:24,798 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:08:24,799 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 20:08:24,803 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 20:08:24,820 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-19 20:08:24,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:24,822 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:08:24,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:24,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:24,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:24,824 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:08:24,824 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:24,827 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:24,846 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-19 20:08:24,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:24,850 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:08:24,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:24,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:24,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:24,851 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:08:24,851 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:08:24,855 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 20:08:24,874 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-19 20:08:24,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:24,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:08:24,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:24,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:24,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:24,879 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:08:24,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:24,887 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:24,904 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-19 20:08:24,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:24,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:24,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:24,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:24,909 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:08:24,909 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 20:08:24,915 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:24,930 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-19 20:08:24,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:24,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:08:24,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:24,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:24,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:24,934 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:08:24,934 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:08:24,936 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 20:08:24,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 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:24,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:24,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:24,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:24,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:24,955 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:08:24,955 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 20:08:24,962 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:24,971 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-19 20:08:24,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:24,973 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:08:24,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:24,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:24,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:24,974 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:08:24,974 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:08:24,977 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:24,986 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-19 20:08:24,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:24,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:24,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:24,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:24,999 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:08:24,999 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 20:08:25,045 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 20:08:25,161 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-19 20:08:25,162 INFO L444 ModelExtractionUtils]: 18 out of 31 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 20:08:25,227 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:25,243 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 20:08:25,243 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 20:08:25,244 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~length1~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-19 20:08:25,266 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-19 20:08:25,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:08:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:08:25,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 20:08:25,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:08:25,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:08:25,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 20:08:25,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:08:25,351 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-19 20:08:25,368 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-19 20:08:25,370 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 3 states. [2019-11-19 20:08:25,434 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states.. Second operand 3 states. Result 55 states and 77 transitions. Complement of second has 7 states. [2019-11-19 20:08:25,434 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-19 20:08:25,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-19 20:08:25,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2019-11-19 20:08:25,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-19 20:08:25,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 20:08:25,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 8 letters. Loop has 2 letters. [2019-11-19 20:08:25,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 20:08:25,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-19 20:08:25,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 20:08:25,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 77 transitions. [2019-11-19 20:08:25,447 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-11-19 20:08:25,451 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 18 states and 25 transitions. [2019-11-19 20:08:25,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-19 20:08:25,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-19 20:08:25,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-11-19 20:08:25,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 20:08:25,454 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-19 20:08:25,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-11-19 20:08:25,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-19 20:08:25,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-19 20:08:25,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-11-19 20:08:25,480 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-19 20:08:25,480 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-19 20:08:25,480 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-19 20:08:25,480 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-11-19 20:08:25,481 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-11-19 20:08:25,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 20:08:25,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 20:08:25,482 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:08:25,482 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-19 20:08:25,482 INFO L794 eck$LassoCheckResult]: Stem: 166#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 165#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 158#L525 assume !(main_~length1~0 < 1); 159#L525-2 assume !(main_~length2~0 < 2); 164#L528-1 assume !(main_~length3~0 < 1); 167#L531-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 161#L538-3 assume !(main_~i~0 < main_~length1~0 - 1); 162#L538-4 main_~i~1 := 0; 163#L542-3 [2019-11-19 20:08:25,482 INFO L796 eck$LassoCheckResult]: Loop: 163#L542-3 assume !!(main_~i~1 < main_~length3~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 168#L542-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 163#L542-3 [2019-11-19 20:08:25,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:08:25,483 INFO L82 PathProgramCache]: Analyzing trace with hash 180553783, now seen corresponding path program 1 times [2019-11-19 20:08:25,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:08:25,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13294128] [2019-11-19 20:08:25,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:08:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:25,513 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:08:25,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:08:25,514 INFO L82 PathProgramCache]: Analyzing trace with hash 2467, now seen corresponding path program 1 times [2019-11-19 20:08:25,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:08:25,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927625341] [2019-11-19 20:08:25,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:08:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:25,526 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:08:25,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:08:25,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1713495129, now seen corresponding path program 1 times [2019-11-19 20:08:25,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:08:25,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516356656] [2019-11-19 20:08:25,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:08:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:25,560 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:08:25,806 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-11-19 20:08:25,901 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 20:08:25,901 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 20:08:25,901 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 20:08:25,901 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 20:08:25,901 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 20:08:25,901 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:25,902 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 20:08:25,903 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 20:08:25,903 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcat-alloca-2.i_Iteration2_Lasso [2019-11-19 20:08:25,903 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 20:08:25,903 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 20:08:25,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-19 20:08:25,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:26,078 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-11-19 20:08:26,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:26,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:26,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:26,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:26,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:26,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:26,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:26,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:26,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:26,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:26,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:26,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:26,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:26,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:26,624 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-19 20:08:26,686 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 20:08:26,687 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:26,697 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-19 20:08:26,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:26,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:08:26,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:26,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:26,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:26,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:08:26,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:08:26,702 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:26,717 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-19 20:08:26,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:26,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:26,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:26,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:26,729 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:08:26,729 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 20:08:26,737 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:26,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 20:08:26,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:26,757 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:08:26,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:26,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:26,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:26,759 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:08:26,759 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:08:26,761 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 20:08:26,771 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-19 20:08:26,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:26,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:26,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:26,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:26,782 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:08:26,783 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:26,801 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 20:08:26,849 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2019-11-19 20:08:26,849 INFO L444 ModelExtractionUtils]: 18 out of 34 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 20:08:26,857 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:26,860 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 20:08:26,860 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 20:08:26,861 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~length3~0) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~length3~0 Supporting invariants [] [2019-11-19 20:08:26,878 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-19 20:08:26,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:08:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:08:26,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 20:08:26,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:08:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:08:26,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 20:08:26,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:08:26,930 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-19 20:08:26,931 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-19 20:08:26,931 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-19 20:08:26,957 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 26 states and 38 transitions. Complement of second has 6 states. [2019-11-19 20:08:26,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-19 20:08:26,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-19 20:08:26,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2019-11-19 20:08:26,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 8 letters. Loop has 2 letters. [2019-11-19 20:08:26,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 20:08:26,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 10 letters. Loop has 2 letters. [2019-11-19 20:08:26,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 20:08:26,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 8 letters. Loop has 4 letters. [2019-11-19 20:08:26,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 20:08:26,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 38 transitions. [2019-11-19 20:08:26,962 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-19 20:08:26,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 19 states and 27 transitions. [2019-11-19 20:08:26,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-19 20:08:26,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-19 20:08:26,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 27 transitions. [2019-11-19 20:08:26,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 20:08:26,964 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-11-19 20:08:26,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 27 transitions. [2019-11-19 20:08:26,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-19 20:08:26,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-19 20:08:26,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2019-11-19 20:08:26,966 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-11-19 20:08:26,967 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-11-19 20:08:26,967 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-19 20:08:26,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2019-11-19 20:08:26,968 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-19 20:08:26,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 20:08:26,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 20:08:26,968 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:08:26,969 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 20:08:26,969 INFO L794 eck$LassoCheckResult]: Stem: 287#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 286#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 279#L525 assume !(main_~length1~0 < 1); 280#L525-2 assume !(main_~length2~0 < 2); 285#L528-1 assume !(main_~length3~0 < 1); 288#L531-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 282#L538-3 assume !(main_~i~0 < main_~length1~0 - 1); 283#L538-4 main_~i~1 := 0; 284#L542-3 assume !(main_~i~1 < main_~length3~0 - 1); 291#L542-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1), 1);cstrcat_#in~s.base, cstrcat_#in~s.offset, cstrcat_#in~append.base, cstrcat_#in~append.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~pre2.base, cstrcat_#t~pre2.offset, cstrcat_#t~mem3, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s.base, cstrcat_~s.offset, cstrcat_~append.base, cstrcat_~append.offset, cstrcat_~save~0.base, cstrcat_~save~0.offset;cstrcat_~s.base, cstrcat_~s.offset := cstrcat_#in~s.base, cstrcat_#in~s.offset;cstrcat_~append.base, cstrcat_~append.offset := cstrcat_#in~append.base, cstrcat_#in~append.offset;cstrcat_~save~0.base, cstrcat_~save~0.offset := cstrcat_~s.base, cstrcat_~s.offset; 281#L517-4 [2019-11-19 20:08:26,969 INFO L796 eck$LassoCheckResult]: Loop: 281#L517-4 call cstrcat_#t~mem3 := read~int(cstrcat_~s.base, cstrcat_~s.offset, 1); 273#L517-1 assume !!(0 != cstrcat_#t~mem3);havoc cstrcat_#t~mem3; 275#L517-3 cstrcat_#t~pre2.base, cstrcat_#t~pre2.offset := cstrcat_~s.base, 1 + cstrcat_~s.offset;cstrcat_~s.base, cstrcat_~s.offset := cstrcat_~s.base, 1 + cstrcat_~s.offset;havoc cstrcat_#t~pre2.base, cstrcat_#t~pre2.offset; 281#L517-4 [2019-11-19 20:08:26,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:08:26,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1713495071, now seen corresponding path program 1 times [2019-11-19 20:08:26,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:08:26,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138301655] [2019-11-19 20:08:26,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:08:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:27,003 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:08:27,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:08:27,003 INFO L82 PathProgramCache]: Analyzing trace with hash 86554, now seen corresponding path program 1 times [2019-11-19 20:08:27,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:08:27,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302896457] [2019-11-19 20:08:27,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:08:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:27,012 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:08:27,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:08:27,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1045403964, now seen corresponding path program 1 times [2019-11-19 20:08:27,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:08:27,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130715972] [2019-11-19 20:08:27,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:08:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:08:27,262 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-19 20:08:27,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130715972] [2019-11-19 20:08:27,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:08:27,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-19 20:08:27,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156027628] [2019-11-19 20:08:27,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:08:27,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 20:08:27,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-19 20:08:27,301 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. cyclomatic complexity: 12 Second operand 8 states. [2019-11-19 20:08:27,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:08:27,414 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-11-19 20:08:27,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 20:08:27,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2019-11-19 20:08:27,416 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-11-19 20:08:27,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 34 transitions. [2019-11-19 20:08:27,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-11-19 20:08:27,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-19 20:08:27,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2019-11-19 20:08:27,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 20:08:27,422 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-11-19 20:08:27,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2019-11-19 20:08:27,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2019-11-19 20:08:27,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-19 20:08:27,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2019-11-19 20:08:27,431 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-11-19 20:08:27,431 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-11-19 20:08:27,431 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-19 20:08:27,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2019-11-19 20:08:27,433 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-19 20:08:27,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 20:08:27,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 20:08:27,434 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:08:27,435 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-19 20:08:27,435 INFO L794 eck$LassoCheckResult]: Stem: 350#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 349#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 340#L525 assume !(main_~length1~0 < 1); 341#L525-2 assume !(main_~length2~0 < 2); 348#L528-1 assume !(main_~length3~0 < 1); 351#L531-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 344#L538-3 assume !(main_~i~0 < main_~length1~0 - 1); 345#L538-4 main_~i~1 := 0; 347#L542-3 assume !(main_~i~1 < main_~length3~0 - 1); 354#L542-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1), 1);cstrcat_#in~s.base, cstrcat_#in~s.offset, cstrcat_#in~append.base, cstrcat_#in~append.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~pre2.base, cstrcat_#t~pre2.offset, cstrcat_#t~mem3, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s.base, cstrcat_~s.offset, cstrcat_~append.base, cstrcat_~append.offset, cstrcat_~save~0.base, cstrcat_~save~0.offset;cstrcat_~s.base, cstrcat_~s.offset := cstrcat_#in~s.base, cstrcat_#in~s.offset;cstrcat_~append.base, cstrcat_~append.offset := cstrcat_#in~append.base, cstrcat_#in~append.offset;cstrcat_~save~0.base, cstrcat_~save~0.offset := cstrcat_~s.base, cstrcat_~s.offset; 346#L517-4 call cstrcat_#t~mem3 := read~int(cstrcat_~s.base, cstrcat_~s.offset, 1); 335#L517-1 assume !(0 != cstrcat_#t~mem3);havoc cstrcat_#t~mem3; 336#L518-2 [2019-11-19 20:08:27,436 INFO L796 eck$LassoCheckResult]: Loop: 336#L518-2 cstrcat_#t~post4.base, cstrcat_#t~post4.offset := cstrcat_~s.base, cstrcat_~s.offset;cstrcat_~s.base, cstrcat_~s.offset := cstrcat_#t~post4.base, 1 + cstrcat_#t~post4.offset;cstrcat_#t~post5.base, cstrcat_#t~post5.offset := cstrcat_~append.base, cstrcat_~append.offset;cstrcat_~append.base, cstrcat_~append.offset := cstrcat_#t~post5.base, 1 + cstrcat_#t~post5.offset;call cstrcat_#t~mem6 := read~int(cstrcat_#t~post5.base, cstrcat_#t~post5.offset, 1);call write~int(cstrcat_#t~mem6, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, 1); 337#L518 assume !!(0 != cstrcat_#t~mem6);havoc cstrcat_#t~post4.base, cstrcat_#t~post4.offset;havoc cstrcat_#t~mem6;havoc cstrcat_#t~post5.base, cstrcat_#t~post5.offset; 336#L518-2 [2019-11-19 20:08:27,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:08:27,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1696290690, now seen corresponding path program 1 times [2019-11-19 20:08:27,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:08:27,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485692919] [2019-11-19 20:08:27,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:08:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:27,510 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:08:27,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:08:27,511 INFO L82 PathProgramCache]: Analyzing trace with hash 3238, now seen corresponding path program 1 times [2019-11-19 20:08:27,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:08:27,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023270681] [2019-11-19 20:08:27,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:08:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:27,538 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:08:27,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:08:27,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1952217113, now seen corresponding path program 1 times [2019-11-19 20:08:27,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:08:27,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494876969] [2019-11-19 20:08:27,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:08:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:08:27,703 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-19 20:08:27,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494876969] [2019-11-19 20:08:27,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:08:27,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 20:08:27,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519378268] [2019-11-19 20:08:27,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:08:27,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 20:08:27,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-19 20:08:27,814 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-19 20:08:27,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:08:27,911 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2019-11-19 20:08:27,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 20:08:27,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 46 transitions. [2019-11-19 20:08:27,913 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-11-19 20:08:27,915 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 31 states and 40 transitions. [2019-11-19 20:08:27,915 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-19 20:08:27,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-19 20:08:27,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2019-11-19 20:08:27,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 20:08:27,916 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-11-19 20:08:27,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2019-11-19 20:08:27,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-11-19 20:08:27,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-19 20:08:27,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2019-11-19 20:08:27,919 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-11-19 20:08:27,919 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-11-19 20:08:27,919 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-19 20:08:27,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2019-11-19 20:08:27,920 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-11-19 20:08:27,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 20:08:27,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 20:08:27,921 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:08:27,921 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 20:08:27,921 INFO L794 eck$LassoCheckResult]: Stem: 427#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 426#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 415#L525 assume !(main_~length1~0 < 1); 416#L525-2 assume !(main_~length2~0 < 2); 425#L528-1 assume !(main_~length3~0 < 1); 428#L531-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 419#L538-3 assume !(main_~i~0 < main_~length1~0 - 1); 420#L538-4 main_~i~1 := 0; 438#L542-3 assume !!(main_~i~1 < main_~length3~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 436#L542-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 435#L542-3 assume !(main_~i~1 < main_~length3~0 - 1); 434#L542-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1), 1);cstrcat_#in~s.base, cstrcat_#in~s.offset, cstrcat_#in~append.base, cstrcat_#in~append.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~pre2.base, cstrcat_#t~pre2.offset, cstrcat_#t~mem3, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s.base, cstrcat_~s.offset, cstrcat_~append.base, cstrcat_~append.offset, cstrcat_~save~0.base, cstrcat_~save~0.offset;cstrcat_~s.base, cstrcat_~s.offset := cstrcat_#in~s.base, cstrcat_#in~s.offset;cstrcat_~append.base, cstrcat_~append.offset := cstrcat_#in~append.base, cstrcat_#in~append.offset;cstrcat_~save~0.base, cstrcat_~save~0.offset := cstrcat_~s.base, cstrcat_~s.offset; 433#L517-4 [2019-11-19 20:08:27,921 INFO L796 eck$LassoCheckResult]: Loop: 433#L517-4 call cstrcat_#t~mem3 := read~int(cstrcat_~s.base, cstrcat_~s.offset, 1); 409#L517-1 assume !!(0 != cstrcat_#t~mem3);havoc cstrcat_#t~mem3; 410#L517-3 cstrcat_#t~pre2.base, cstrcat_#t~pre2.offset := cstrcat_~s.base, 1 + cstrcat_~s.offset;cstrcat_~s.base, cstrcat_~s.offset := cstrcat_~s.base, 1 + cstrcat_~s.offset;havoc cstrcat_#t~pre2.base, cstrcat_#t~pre2.offset; 433#L517-4 [2019-11-19 20:08:27,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:08:27,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1696346049, now seen corresponding path program 1 times [2019-11-19 20:08:27,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:08:27,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642096777] [2019-11-19 20:08:27,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:08:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:27,947 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:08:27,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:08:27,948 INFO L82 PathProgramCache]: Analyzing trace with hash 86554, now seen corresponding path program 2 times [2019-11-19 20:08:27,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:08:27,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781222373] [2019-11-19 20:08:27,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:08:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:27,956 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:08:27,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:08:27,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1259997786, now seen corresponding path program 1 times [2019-11-19 20:08:27,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:08:27,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125230608] [2019-11-19 20:08:27,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:08:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:27,985 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:08:28,545 WARN L191 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 113 [2019-11-19 20:08:28,751 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-11-19 20:08:28,754 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 20:08:28,755 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 20:08:28,755 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 20:08:28,755 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 20:08:28,755 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 20:08:28,755 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:28,756 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 20:08:28,756 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 20:08:28,756 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcat-alloca-2.i_Iteration5_Lasso [2019-11-19 20:08:28,756 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 20:08:28,756 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 20:08:28,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:28,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:28,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:28,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:28,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:29,181 WARN L191 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-11-19 20:08:29,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:29,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:29,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:29,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:29,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:29,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:29,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:29,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:29,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:29,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:29,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:29,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:29,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:29,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:29,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:29,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:29,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:29,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:29,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:29,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:29,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:29,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:29,560 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-11-19 20:08:30,443 WARN L191 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-11-19 20:08:30,525 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 20:08:30,526 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:30,530 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-19 20:08:30,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:30,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:30,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:30,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:30,533 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:08:30,533 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 20:08:30,536 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:30,543 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-19 20:08:30,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:30,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:08:30,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:30,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:30,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:30,545 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:08:30,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:08:30,546 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:30,552 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-19 20:08:30,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:30,554 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:08:30,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:30,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:30,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:30,555 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:08:30,555 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:08:30,556 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:30,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 20:08:30,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:30,566 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:08:30,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:30,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:30,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:30,567 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:08:30,567 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:08:30,569 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:30,575 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-19 20:08:30,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:30,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:30,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:30,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:30,589 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:08:30,590 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 20:08:30,610 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 20:08:30,664 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2019-11-19 20:08:30,664 INFO L444 ModelExtractionUtils]: 23 out of 52 variables were initially zero. Simplification set additionally 26 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:30,667 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 20:08:30,669 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 20:08:30,670 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 20:08:30,670 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_3, ULTIMATE.start_cstrcat_~s.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_3 - 1*ULTIMATE.start_cstrcat_~s.offset Supporting invariants [] [2019-11-19 20:08:30,720 INFO L297 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2019-11-19 20:08:30,724 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-19 20:08:30,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:08:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:08:30,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 20:08:30,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:08:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:08:30,803 WARN L253 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 20:08:30,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:08:30,827 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-19 20:08:30,827 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-19 20:08:30,828 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-11-19 20:08:30,868 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 40 states and 52 transitions. Complement of second has 7 states. [2019-11-19 20:08:30,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-19 20:08:30,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-19 20:08:30,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2019-11-19 20:08:30,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 12 letters. Loop has 3 letters. [2019-11-19 20:08:30,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 20:08:30,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-19 20:08:30,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 20:08:30,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 12 letters. Loop has 6 letters. [2019-11-19 20:08:30,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 20:08:30,870 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 52 transitions. [2019-11-19 20:08:30,871 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-19 20:08:30,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 0 states and 0 transitions. [2019-11-19 20:08:30,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-19 20:08:30,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-19 20:08:30,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-19 20:08:30,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 20:08:30,872 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 20:08:30,872 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 20:08:30,872 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 20:08:30,872 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-19 20:08:30,872 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-19 20:08:30,872 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-19 20:08:30,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-19 20:08:30,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 08:08:30 BoogieIcfgContainer [2019-11-19 20:08:30,878 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-19 20:08:30,878 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 20:08:30,878 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 20:08:30,878 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 20:08:30,879 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:08:22" (3/4) ... [2019-11-19 20:08:30,882 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-19 20:08:30,883 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 20:08:30,885 INFO L168 Benchmark]: Toolchain (without parser) took 9236.08 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 311.4 MB). Free memory was 961.7 MB in the beginning and 922.8 MB in the end (delta: 38.9 MB). Peak memory consumption was 350.3 MB. Max. memory is 11.5 GB. [2019-11-19 20:08:30,885 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 20:08:30,886 INFO L168 Benchmark]: CACSL2BoogieTranslator took 622.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -162.5 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-19 20:08:30,887 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.71 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-19 20:08:30,887 INFO L168 Benchmark]: Boogie Preprocessor took 32.97 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-19 20:08:30,888 INFO L168 Benchmark]: RCFGBuilder took 410.85 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: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2019-11-19 20:08:30,889 INFO L168 Benchmark]: BuchiAutomizer took 8109.37 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 173.5 MB). Free memory was 1.1 GB in the beginning and 922.8 MB in the end (delta: 163.7 MB). Peak memory consumption was 337.2 MB. Max. memory is 11.5 GB. [2019-11-19 20:08:30,889 INFO L168 Benchmark]: Witness Printer took 4.71 ms. Allocated memory is still 1.3 GB. Free memory is still 922.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 20:08:30,892 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 622.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -162.5 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.71 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. * Boogie Preprocessor took 32.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 410.85 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: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8109.37 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 173.5 MB). Free memory was 1.1 GB in the beginning and 922.8 MB in the end (delta: 163.7 MB). Peak memory consumption was 337.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.71 ms. Allocated memory is still 1.3 GB. Free memory is still 922.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function length1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * i + length3 and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.0s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 7.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 30 states and ocurred in iteration 4. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 94 SDtfs, 166 SDslu, 139 SDs, 0 SdLazy, 95 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital180 mio100 ax110 hnf98 lsp83 ukn77 mio100 lsp57 div100 bol100 ite100 ukn100 eq167 hnf90 smp97 dnf146 smp95 tf100 neg94 sie122 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...