./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc2.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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/termination-recursive-malloc/rec_strcopy_malloc2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash f9e8d57988f982ece26fd7a4aa6d80b7a8ef76d2 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:41:31,436 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:41:31,439 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:41:31,451 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:41:31,451 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:41:31,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:41:31,454 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:41:31,456 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:41:31,458 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:41:31,459 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:41:31,460 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:41:31,461 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:41:31,462 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:41:31,463 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:41:31,464 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:41:31,465 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:41:31,466 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:41:31,467 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:41:31,469 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:41:31,471 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:41:31,472 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:41:31,474 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:41:31,475 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:41:31,476 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:41:31,478 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:41:31,478 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:41:31,479 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:41:31,480 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:41:31,480 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:41:31,481 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:41:31,482 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:41:31,482 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:41:31,483 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:41:31,484 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:41:31,485 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:41:31,486 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:41:31,487 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:41:31,487 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:41:31,487 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:41:31,488 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:41:31,489 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:41:31,490 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:41:31,506 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:41:31,506 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:41:31,507 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:41:31,508 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:41:31,508 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:41:31,508 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:41:31,509 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:41:31,509 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:41:31,509 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:41:31,510 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:41:31,510 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:41:31,510 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:41:31,510 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:41:31,511 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:41:31,511 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:41:31,511 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:41:31,511 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:41:31,512 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:41:31,512 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:41:31,512 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:41:31,513 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:41:31,513 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:41:31,513 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:41:31,513 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:41:31,514 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:41:31,514 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:41:31,514 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:41:31,515 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:41:31,515 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:41:31,516 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:41:31,516 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f9e8d57988f982ece26fd7a4aa6d80b7a8ef76d2 [2020-07-29 01:41:31,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:41:31,831 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:41:31,835 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:41:31,836 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:41:31,837 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:41:31,838 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc2.i [2020-07-29 01:41:31,911 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97501c0da/a27afc9c3a00472f930eec3b617f5231/FLAG7af654e79 [2020-07-29 01:41:32,388 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:41:32,389 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc2.i [2020-07-29 01:41:32,401 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97501c0da/a27afc9c3a00472f930eec3b617f5231/FLAG7af654e79 [2020-07-29 01:41:32,731 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97501c0da/a27afc9c3a00472f930eec3b617f5231 [2020-07-29 01:41:32,734 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:41:32,737 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:41:32,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:41:32,738 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:41:32,742 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:41:32,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:41:32" (1/1) ... [2020-07-29 01:41:32,747 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@287afa32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:32, skipping insertion in model container [2020-07-29 01:41:32,747 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:41:32" (1/1) ... [2020-07-29 01:41:32,755 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:41:32,778 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:41:32,988 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:41:33,002 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:41:33,025 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:41:33,043 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:41:33,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:33 WrapperNode [2020-07-29 01:41:33,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:41:33,044 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:41:33,044 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:41:33,045 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:41:33,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:33" (1/1) ... [2020-07-29 01:41:33,120 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:33" (1/1) ... [2020-07-29 01:41:33,146 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:41:33,146 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:41:33,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:41:33,147 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:41:33,157 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:33" (1/1) ... [2020-07-29 01:41:33,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:33" (1/1) ... [2020-07-29 01:41:33,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:33" (1/1) ... [2020-07-29 01:41:33,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:33" (1/1) ... [2020-07-29 01:41:33,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:33" (1/1) ... [2020-07-29 01:41:33,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:33" (1/1) ... [2020-07-29 01:41:33,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:33" (1/1) ... [2020-07-29 01:41:33,177 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:41:33,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:41:33,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:41:33,178 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:41:33,179 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:33" (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 [2020-07-29 01:41:33,263 INFO L130 BoogieDeclarations]: Found specification of procedure rec_strcopy_helper [2020-07-29 01:41:33,264 INFO L138 BoogieDeclarations]: Found implementation of procedure rec_strcopy_helper [2020-07-29 01:41:33,265 INFO L130 BoogieDeclarations]: Found specification of procedure rec_cstrlen [2020-07-29 01:41:33,266 INFO L138 BoogieDeclarations]: Found implementation of procedure rec_cstrlen [2020-07-29 01:41:33,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:41:33,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 01:41:33,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:41:33,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:41:33,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:41:33,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:41:33,724 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:41:33,725 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-29 01:41:33,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:41:33 BoogieIcfgContainer [2020-07-29 01:41:33,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:41:33,730 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:41:33,730 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:41:33,733 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:41:33,734 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:41:33,734 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:41:32" (1/3) ... [2020-07-29 01:41:33,736 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ce124a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:41:33, skipping insertion in model container [2020-07-29 01:41:33,736 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:41:33,736 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:33" (2/3) ... [2020-07-29 01:41:33,737 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ce124a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:41:33, skipping insertion in model container [2020-07-29 01:41:33,737 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:41:33,737 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:41:33" (3/3) ... [2020-07-29 01:41:33,739 INFO L371 chiAutomizerObserver]: Analyzing ICFG rec_strcopy_malloc2.i [2020-07-29 01:41:33,794 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:41:33,794 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:41:33,794 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:41:33,794 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:41:33,794 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:41:33,794 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:41:33,794 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:41:33,795 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:41:33,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2020-07-29 01:41:33,843 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:41:33,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:33,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:33,849 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:41:33,849 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:41:33,849 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:41:33,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2020-07-29 01:41:33,857 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:41:33,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:33,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:33,858 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:41:33,858 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:41:33,864 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 13#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length~1, main_~original~0.base, main_~original~0.offset, main_~res~0.base, main_~res~0.offset;main_~length~1 := main_#t~nondet8;havoc main_#t~nondet8; 16#L43true assume main_~length~1 < 1;main_~length~1 := 1; 11#L43-2true build_nondet_String_#in~length := main_~length~1;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length := build_nondet_String_#in~length;call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 20#L12true main_#t~ret9.base, main_#t~ret9.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;main_~original~0.base, main_~original~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset := main_~original~0.base, main_~original~0.offset;havoc rec_strcopy_#res.base, rec_strcopy_#res.offset;havoc rec_strcopy_#t~ret6, rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset, rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~length~0, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset;rec_strcopy_~source.base, rec_strcopy_~source.offset := rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset; 22#L34true call rec_strcopy_#t~ret6 := rec_cstrlen(rec_strcopy_~source.base, rec_strcopy_~source.offset);< 6#rec_cstrlenENTRYtrue [2020-07-29 01:41:33,865 INFO L796 eck$LassoCheckResult]: Loop: 6#rec_cstrlenENTRYtrue ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); 8#L17true assume !(0 == #t~mem2);havoc #t~mem2; 14#L20true call #t~ret3 := rec_cstrlen(~s.base, 1 + ~s.offset);< 6#rec_cstrlenENTRYtrue [2020-07-29 01:41:33,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:33,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1155759803, now seen corresponding path program 1 times [2020-07-29 01:41:33,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:33,880 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382277212] [2020-07-29 01:41:33,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:33,998 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:34,023 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:34,047 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:41:34,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:34,049 INFO L82 PathProgramCache]: Analyzing trace with hash 59719, now seen corresponding path program 1 times [2020-07-29 01:41:34,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:34,050 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837037964] [2020-07-29 01:41:34,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:34,057 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:34,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:34,063 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:34,066 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:41:34,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:34,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1512490931, now seen corresponding path program 1 times [2020-07-29 01:41:34,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:34,069 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147812654] [2020-07-29 01:41:34,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:34,398 INFO L280 TraceCheckUtils]: 0: Hoare triple {32#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {32#true} is VALID [2020-07-29 01:41:34,399 INFO L280 TraceCheckUtils]: 1: Hoare triple {32#true} havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length~1, main_~original~0.base, main_~original~0.offset, main_~res~0.base, main_~res~0.offset;main_~length~1 := main_#t~nondet8;havoc main_#t~nondet8; {32#true} is VALID [2020-07-29 01:41:34,400 INFO L280 TraceCheckUtils]: 2: Hoare triple {32#true} assume main_~length~1 < 1;main_~length~1 := 1; {34#(<= ULTIMATE.start_main_~length~1 1)} is VALID [2020-07-29 01:41:34,403 INFO L280 TraceCheckUtils]: 3: Hoare triple {34#(<= ULTIMATE.start_main_~length~1 1)} build_nondet_String_#in~length := main_~length~1;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length := build_nondet_String_#in~length;call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; {35#(and (= 0 (select (select |#memory_int| |ULTIMATE.start_build_nondet_String_#res.base|) 0)) (<= (select |#length| |ULTIMATE.start_build_nondet_String_#res.base|) 1))} is VALID [2020-07-29 01:41:34,405 INFO L280 TraceCheckUtils]: 4: Hoare triple {35#(and (= 0 (select (select |#memory_int| |ULTIMATE.start_build_nondet_String_#res.base|) 0)) (<= (select |#length| |ULTIMATE.start_build_nondet_String_#res.base|) 1))} main_#t~ret9.base, main_#t~ret9.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;main_~original~0.base, main_~original~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset := main_~original~0.base, main_~original~0.offset;havoc rec_strcopy_#res.base, rec_strcopy_#res.offset;havoc rec_strcopy_#t~ret6, rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset, rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~length~0, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset;rec_strcopy_~source.base, rec_strcopy_~source.offset := rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset; {36#(or (and (<= (select |#length| ULTIMATE.start_rec_strcopy_~source.base) 1) (not (= ULTIMATE.start_rec_strcopy_~source.offset 0))) (= 0 (select (select |#memory_int| ULTIMATE.start_rec_strcopy_~source.base) ULTIMATE.start_rec_strcopy_~source.offset)))} is VALID [2020-07-29 01:41:34,407 INFO L263 TraceCheckUtils]: 5: Hoare triple {36#(or (and (<= (select |#length| ULTIMATE.start_rec_strcopy_~source.base) 1) (not (= ULTIMATE.start_rec_strcopy_~source.offset 0))) (= 0 (select (select |#memory_int| ULTIMATE.start_rec_strcopy_~source.base) ULTIMATE.start_rec_strcopy_~source.offset)))} call rec_strcopy_#t~ret6 := rec_cstrlen(rec_strcopy_~source.base, rec_strcopy_~source.offset); {37#(or (and (not (= 0 |rec_cstrlen_#in~s.offset|)) (<= (select |#length| |rec_cstrlen_#in~s.base|) 1)) (= 0 (select (select |#memory_int| |rec_cstrlen_#in~s.base|) |rec_cstrlen_#in~s.offset|)))} is VALID [2020-07-29 01:41:34,409 INFO L280 TraceCheckUtils]: 6: Hoare triple {37#(or (and (not (= 0 |rec_cstrlen_#in~s.offset|)) (<= (select |#length| |rec_cstrlen_#in~s.base|) 1)) (= 0 (select (select |#memory_int| |rec_cstrlen_#in~s.base|) |rec_cstrlen_#in~s.offset|)))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); {38#(= 0 |rec_cstrlen_#t~mem2|)} is VALID [2020-07-29 01:41:34,410 INFO L280 TraceCheckUtils]: 7: Hoare triple {38#(= 0 |rec_cstrlen_#t~mem2|)} assume !(0 == #t~mem2);havoc #t~mem2; {33#false} is VALID [2020-07-29 01:41:34,410 INFO L263 TraceCheckUtils]: 8: Hoare triple {33#false} call #t~ret3 := rec_cstrlen(~s.base, 1 + ~s.offset); {33#false} is VALID [2020-07-29 01:41:34,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:41:34,414 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147812654] [2020-07-29 01:41:34,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:41:34,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-29 01:41:34,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659800189] [2020-07-29 01:41:34,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:41:34,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:41:34,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:41:34,683 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 7 states. [2020-07-29 01:41:35,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:41:35,252 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-29 01:41:35,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:41:35,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:41:35,277 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:41:35,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 42 transitions. [2020-07-29 01:41:35,288 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:41:35,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 26 states and 29 transitions. [2020-07-29 01:41:35,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2020-07-29 01:41:35,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2020-07-29 01:41:35,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 29 transitions. [2020-07-29 01:41:35,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:41:35,303 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 29 transitions. [2020-07-29 01:41:35,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 29 transitions. [2020-07-29 01:41:35,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2020-07-29 01:41:35,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:41:35,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states and 29 transitions. Second operand 24 states. [2020-07-29 01:41:35,338 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states and 29 transitions. Second operand 24 states. [2020-07-29 01:41:35,340 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 24 states. [2020-07-29 01:41:35,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:41:35,344 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2020-07-29 01:41:35,345 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-07-29 01:41:35,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:41:35,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:41:35,347 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states and 29 transitions. [2020-07-29 01:41:35,347 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states and 29 transitions. [2020-07-29 01:41:35,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:41:35,351 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2020-07-29 01:41:35,352 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-07-29 01:41:35,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:41:35,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:41:35,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:41:35,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:41:35,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-29 01:41:35,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2020-07-29 01:41:35,361 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2020-07-29 01:41:35,361 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2020-07-29 01:41:35,361 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:41:35,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2020-07-29 01:41:35,363 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:41:35,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:35,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:35,364 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:41:35,364 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:41:35,365 INFO L794 eck$LassoCheckResult]: Stem: 101#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 98#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length~1, main_~original~0.base, main_~original~0.offset, main_~res~0.base, main_~res~0.offset;main_~length~1 := main_#t~nondet8;havoc main_#t~nondet8; 99#L43 assume !(main_~length~1 < 1); 102#L43-2 build_nondet_String_#in~length := main_~length~1;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length := build_nondet_String_#in~length;call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 106#L12 main_#t~ret9.base, main_#t~ret9.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;main_~original~0.base, main_~original~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset := main_~original~0.base, main_~original~0.offset;havoc rec_strcopy_#res.base, rec_strcopy_#res.offset;havoc rec_strcopy_#t~ret6, rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset, rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~length~0, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset;rec_strcopy_~source.base, rec_strcopy_~source.offset := rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset; 93#L34 call rec_strcopy_#t~ret6 := rec_cstrlen(rec_strcopy_~source.base, rec_strcopy_~source.offset);< 100#rec_cstrlenENTRY [2020-07-29 01:41:35,365 INFO L796 eck$LassoCheckResult]: Loop: 100#rec_cstrlenENTRY ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); 104#L17 assume !(0 == #t~mem2);havoc #t~mem2; 94#L20 call #t~ret3 := rec_cstrlen(~s.base, 1 + ~s.offset);< 100#rec_cstrlenENTRY [2020-07-29 01:41:35,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:35,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1155819385, now seen corresponding path program 1 times [2020-07-29 01:41:35,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:35,367 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316207068] [2020-07-29 01:41:35,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:35,382 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:35,397 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:35,403 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:41:35,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:35,404 INFO L82 PathProgramCache]: Analyzing trace with hash 59719, now seen corresponding path program 2 times [2020-07-29 01:41:35,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:35,405 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515655870] [2020-07-29 01:41:35,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:35,412 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:35,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:35,417 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:35,420 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:41:35,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:35,421 INFO L82 PathProgramCache]: Analyzing trace with hash 262516431, now seen corresponding path program 1 times [2020-07-29 01:41:35,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:35,422 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360871947] [2020-07-29 01:41:35,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:35,446 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:35,489 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:35,505 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:41:35,856 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2020-07-29 01:41:36,423 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:41:36,424 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:41:36,424 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:41:36,424 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:41:36,424 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:41:36,425 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:36,425 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:41:36,425 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:41:36,425 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_strcopy_malloc2.i_Iteration2_Lasso [2020-07-29 01:41:36,426 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:41:36,426 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:41:36,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,626 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:41:36,627 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:41:36,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:36,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:37,544 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:41:37,550 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:37,556 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 [2020-07-29 01:41:37,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:37,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:41:37,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:37,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:37,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:37,566 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:41:37,567 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:41:37,570 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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:37,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:41:37,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:37,623 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:41:37,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:37,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:37,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:37,626 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:41:37,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:41:37,635 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 [2020-07-29 01:41:37,669 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 [2020-07-29 01:41:37,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:37,672 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:41:37,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:37,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:37,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:37,673 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:41:37,673 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:41:37,674 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 [2020-07-29 01:41:37,704 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 [2020-07-29 01:41:37,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:37,706 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:41:37,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:37,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:37,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:37,707 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:41:37,707 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:41:37,713 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 [2020-07-29 01:41:37,737 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 [2020-07-29 01:41:37,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:37,738 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:41:37,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:37,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:37,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:37,739 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:41:37,739 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:41:37,742 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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:37,777 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 [2020-07-29 01:41:37,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:37,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:41:37,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:37,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:37,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:37,779 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:41:37,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:41:37,781 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) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:37,805 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 [2020-07-29 01:41:37,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:37,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:37,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:37,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:37,809 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:41:37,810 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:41:37,813 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) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:37,843 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 [2020-07-29 01:41:37,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:37,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:41:37,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:37,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:37,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:37,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:41:37,846 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:41:37,847 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 [2020-07-29 01:41:37,876 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 [2020-07-29 01:41:37,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:37,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:41:37,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:37,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:37,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:37,878 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:41:37,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:41:37,881 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) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:37,909 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 [2020-07-29 01:41:37,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:37,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:41:37,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:37,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:37,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:37,911 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:41:37,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:41:37,919 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 [2020-07-29 01:41:37,953 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 [2020-07-29 01:41:37,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:37,955 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:41:37,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:37,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:37,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:37,957 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:41:37,957 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:41:37,963 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) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:37,987 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 [2020-07-29 01:41:37,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:37,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:41:37,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:37,989 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:41:37,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:37,990 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-07-29 01:41:37,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:41:37,995 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 [2020-07-29 01:41:38,018 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 [2020-07-29 01:41:38,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:38,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:38,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:38,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:38,025 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:41:38,025 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:41:38,039 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:41:38,166 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-07-29 01:41:38,167 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. 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 [2020-07-29 01:41:38,203 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:41:38,212 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:41:38,212 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:41:38,213 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec_cstrlen_#in~s.offset, v_rep(select #length rec_cstrlen_#in~s.base)_1) = -1*rec_cstrlen_#in~s.offset + 1*v_rep(select #length rec_cstrlen_#in~s.base)_1 Supporting invariants [] [2020-07-29 01:41:38,244 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2020-07-29 01:41:38,249 INFO L393 LassoCheck]: Loop: "~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1);" "assume !(0 == #t~mem2);havoc #t~mem2;" "call #t~ret3 := rec_cstrlen(~s.base, 1 + ~s.offset);"< [2020-07-29 01:41:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:38,264 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:41:38,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:38,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:41:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:38,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:41:38,330 INFO L280 TraceCheckUtils]: 0: Hoare triple {168#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {168#unseeded} is VALID [2020-07-29 01:41:38,331 INFO L280 TraceCheckUtils]: 1: Hoare triple {168#unseeded} havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length~1, main_~original~0.base, main_~original~0.offset, main_~res~0.base, main_~res~0.offset;main_~length~1 := main_#t~nondet8;havoc main_#t~nondet8; {168#unseeded} is VALID [2020-07-29 01:41:38,332 INFO L280 TraceCheckUtils]: 2: Hoare triple {168#unseeded} assume !(main_~length~1 < 1); {168#unseeded} is VALID [2020-07-29 01:41:38,333 INFO L280 TraceCheckUtils]: 3: Hoare triple {168#unseeded} build_nondet_String_#in~length := main_~length~1;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length := build_nondet_String_#in~length;call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; {168#unseeded} is VALID [2020-07-29 01:41:38,333 INFO L280 TraceCheckUtils]: 4: Hoare triple {168#unseeded} main_#t~ret9.base, main_#t~ret9.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;main_~original~0.base, main_~original~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset := main_~original~0.base, main_~original~0.offset;havoc rec_strcopy_#res.base, rec_strcopy_#res.offset;havoc rec_strcopy_#t~ret6, rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset, rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~length~0, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset;rec_strcopy_~source.base, rec_strcopy_~source.offset := rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset; {168#unseeded} is VALID [2020-07-29 01:41:38,334 INFO L263 TraceCheckUtils]: 5: Hoare triple {168#unseeded} call rec_strcopy_#t~ret6 := rec_cstrlen(rec_strcopy_~source.base, rec_strcopy_~source.offset); {168#unseeded} is VALID [2020-07-29 01:41:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:38,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:41:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:38,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:41:38,413 INFO L280 TraceCheckUtils]: 0: Hoare triple {171#(>= oldRank0 (+ (* (- 1) |rec_cstrlen_#in~s.offset|) (select |#length| |rec_cstrlen_#in~s.base|)))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); {206#(and (<= (+ rec_cstrlen_~s.offset 1) (select |#length| rec_cstrlen_~s.base)) (<= (select |#length| rec_cstrlen_~s.base) (+ rec_cstrlen_~s.offset oldRank0)))} is VALID [2020-07-29 01:41:38,413 INFO L280 TraceCheckUtils]: 1: Hoare triple {206#(and (<= (+ rec_cstrlen_~s.offset 1) (select |#length| rec_cstrlen_~s.base)) (<= (select |#length| rec_cstrlen_~s.base) (+ rec_cstrlen_~s.offset oldRank0)))} assume !(0 == #t~mem2);havoc #t~mem2; {206#(and (<= (+ rec_cstrlen_~s.offset 1) (select |#length| rec_cstrlen_~s.base)) (<= (select |#length| rec_cstrlen_~s.base) (+ rec_cstrlen_~s.offset oldRank0)))} is VALID [2020-07-29 01:41:38,415 INFO L263 TraceCheckUtils]: 2: Hoare triple {206#(and (<= (+ rec_cstrlen_~s.offset 1) (select |#length| rec_cstrlen_~s.base)) (<= (select |#length| rec_cstrlen_~s.base) (+ rec_cstrlen_~s.offset oldRank0)))} call #t~ret3 := rec_cstrlen(~s.base, 1 + ~s.offset); {186#(or (and (> oldRank0 (+ (* (- 1) |rec_cstrlen_#in~s.offset|) (select |#length| |rec_cstrlen_#in~s.base|))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:41:38,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:41:38,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:41:38,428 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:41:38,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:41:38,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,433 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 [2020-07-29 01:41:38,434 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-29 01:41:38,560 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 42 states and 48 transitions. Complement of second has 8 states. [2020-07-29 01:41:38,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:41:38,560 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:41:38,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. cyclomatic complexity: 5 [2020-07-29 01:41:38,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:38,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:38,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:41:38,565 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:41:38,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:38,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:38,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 48 transitions. [2020-07-29 01:41:38,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:41:38,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:38,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:38,571 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 27 transitions. cyclomatic complexity: 5 [2020-07-29 01:41:38,573 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:41:38,574 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:41:38,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:41:38,575 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:41:38,576 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 42 states and 48 transitions. cyclomatic complexity: 8 [2020-07-29 01:41:38,577 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:41:38,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:41:38,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:41:38,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:41:38,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:41:38,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:41:38,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:41:38,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:41:38,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:41:38,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:41:38,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 5 Stem has 42 letters. Loop has 42 letters. [2020-07-29 01:41:38,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 42 letters. Loop has 42 letters. [2020-07-29 01:41:38,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 8 Stem has 42 letters. Loop has 42 letters. [2020-07-29 01:41:38,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 5 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:41:38,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:41:38,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 8 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:41:38,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:41:38,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:41:38,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:41:38,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:41:38,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:41:38,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:41:38,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:41:38,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:41:38,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:41:38,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:41:38,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:41:38,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:41:38,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:41:38,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:41:38,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:41:38,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:41:38,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:41:38,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:41:38,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:41:38,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:41:38,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:41:38,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:41:38,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:41:38,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:41:38,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:41:38,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:41:38,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:41:38,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:41:38,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:41:38,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:41:38,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:41:38,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:41:38,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:41:38,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,603 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:41:38,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:41:38,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2020-07-29 01:41:38,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:41:38,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:41:38,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:41:38,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:38,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 48 transitions. cyclomatic complexity: 8 [2020-07-29 01:41:38,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:41:38,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 33 states and 39 transitions. [2020-07-29 01:41:38,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2020-07-29 01:41:38,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-07-29 01:41:38,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2020-07-29 01:41:38,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:41:38,623 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2020-07-29 01:41:38,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2020-07-29 01:41:38,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2020-07-29 01:41:38,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:41:38,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states and 39 transitions. Second operand 31 states. [2020-07-29 01:41:38,628 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states and 39 transitions. Second operand 31 states. [2020-07-29 01:41:38,628 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 31 states. [2020-07-29 01:41:38,629 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:41:38,636 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-07-29 01:41:38,637 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2020-07-29 01:41:38,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:41:38,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:41:38,638 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 33 states and 39 transitions. [2020-07-29 01:41:38,638 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 33 states and 39 transitions. [2020-07-29 01:41:38,639 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:41:38,646 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2020-07-29 01:41:38,646 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2020-07-29 01:41:38,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:41:38,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:41:38,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:41:38,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:41:38,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-29 01:41:38,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-07-29 01:41:38,651 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-07-29 01:41:38,651 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-07-29 01:41:38,651 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:41:38,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2020-07-29 01:41:38,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:41:38,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:38,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:38,654 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:41:38,654 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:41:38,654 INFO L794 eck$LassoCheckResult]: Stem: 285#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 283#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length~1, main_~original~0.base, main_~original~0.offset, main_~res~0.base, main_~res~0.offset;main_~length~1 := main_#t~nondet8;havoc main_#t~nondet8; 284#L43 assume !(main_~length~1 < 1); 286#L43-2 build_nondet_String_#in~length := main_~length~1;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length := build_nondet_String_#in~length;call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 292#L12 main_#t~ret9.base, main_#t~ret9.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;main_~original~0.base, main_~original~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset := main_~original~0.base, main_~original~0.offset;havoc rec_strcopy_#res.base, rec_strcopy_#res.offset;havoc rec_strcopy_#t~ret6, rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset, rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~length~0, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset;rec_strcopy_~source.base, rec_strcopy_~source.offset := rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset; 271#L34 call rec_strcopy_#t~ret6 := rec_cstrlen(rec_strcopy_~source.base, rec_strcopy_~source.offset);< 273#rec_cstrlenENTRY ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); 275#L17 assume 0 == #t~mem2;havoc #t~mem2;#res := 0; 270#rec_cstrlenFINAL assume true; 272#rec_cstrlenEXIT >#41#return; 287#L34-1 rec_strcopy_~length~0 := rec_strcopy_#t~ret6;havoc rec_strcopy_#t~ret6;call rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset := #Ultimate.allocOnHeap(1 + rec_strcopy_~length~0);rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset := rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset; 267#L36 call rec_strcopy_helper(rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset);< 268#rec_strcopy_helperENTRY [2020-07-29 01:41:38,655 INFO L796 eck$LassoCheckResult]: Loop: 268#rec_strcopy_helperENTRY ~source.base, ~source.offset := #in~source.base, #in~source.offset;~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;call #t~mem4 := read~int(~source.base, ~source.offset, 1);call write~int(#t~mem4, ~dest.base, ~dest.offset, 1);havoc #t~mem4;call #t~mem5 := read~int(~source.base, ~source.offset, 1); 269#L28 assume 0 != #t~mem5;havoc #t~mem5; 266#L29 call rec_strcopy_helper(~source.base, 1 + ~source.offset, ~dest.base, 1 + ~dest.offset);< 268#rec_strcopy_helperENTRY [2020-07-29 01:41:38,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:38,655 INFO L82 PathProgramCache]: Analyzing trace with hash -509542028, now seen corresponding path program 1 times [2020-07-29 01:41:38,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:38,656 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324547710] [2020-07-29 01:41:38,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:38,675 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:38,711 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:38,723 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:41:38,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:38,727 INFO L82 PathProgramCache]: Analyzing trace with hash 29922, now seen corresponding path program 1 times [2020-07-29 01:41:38,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:38,728 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807290283] [2020-07-29 01:41:38,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:38,745 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:38,758 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:38,763 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:41:38,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:38,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1352131953, now seen corresponding path program 1 times [2020-07-29 01:41:38,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:38,765 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198244137] [2020-07-29 01:41:38,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:38,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:38,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-07-29 01:41:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:39,007 INFO L280 TraceCheckUtils]: 0: Hoare triple {499#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); {511#(= (select (select |#memory_int| |rec_cstrlen_#in~s.base|) |rec_cstrlen_#in~s.offset|) |rec_cstrlen_#t~mem2|)} is VALID [2020-07-29 01:41:39,008 INFO L280 TraceCheckUtils]: 1: Hoare triple {511#(= (select (select |#memory_int| |rec_cstrlen_#in~s.base|) |rec_cstrlen_#in~s.offset|) |rec_cstrlen_#t~mem2|)} assume 0 == #t~mem2;havoc #t~mem2;#res := 0; {512#(= 0 (select (select |#memory_int| |rec_cstrlen_#in~s.base|) |rec_cstrlen_#in~s.offset|))} is VALID [2020-07-29 01:41:39,009 INFO L280 TraceCheckUtils]: 2: Hoare triple {512#(= 0 (select (select |#memory_int| |rec_cstrlen_#in~s.base|) |rec_cstrlen_#in~s.offset|))} assume true; {512#(= 0 (select (select |#memory_int| |rec_cstrlen_#in~s.base|) |rec_cstrlen_#in~s.offset|))} is VALID [2020-07-29 01:41:39,011 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {512#(= 0 (select (select |#memory_int| |rec_cstrlen_#in~s.base|) |rec_cstrlen_#in~s.offset|))} {502#(= 1 (select |#valid| ULTIMATE.start_rec_strcopy_~source.base))} #41#return; {507#(and (= 0 (select (select |#memory_int| ULTIMATE.start_rec_strcopy_~source.base) ULTIMATE.start_rec_strcopy_~source.offset)) (= 1 (select |#valid| ULTIMATE.start_rec_strcopy_~source.base)))} is VALID [2020-07-29 01:41:39,011 INFO L280 TraceCheckUtils]: 0: Hoare triple {499#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {499#true} is VALID [2020-07-29 01:41:39,012 INFO L280 TraceCheckUtils]: 1: Hoare triple {499#true} havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length~1, main_~original~0.base, main_~original~0.offset, main_~res~0.base, main_~res~0.offset;main_~length~1 := main_#t~nondet8;havoc main_#t~nondet8; {499#true} is VALID [2020-07-29 01:41:39,012 INFO L280 TraceCheckUtils]: 2: Hoare triple {499#true} assume !(main_~length~1 < 1); {499#true} is VALID [2020-07-29 01:41:39,014 INFO L280 TraceCheckUtils]: 3: Hoare triple {499#true} build_nondet_String_#in~length := main_~length~1;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length := build_nondet_String_#in~length;call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; {501#(= 1 (select |#valid| |ULTIMATE.start_build_nondet_String_#res.base|))} is VALID [2020-07-29 01:41:39,015 INFO L280 TraceCheckUtils]: 4: Hoare triple {501#(= 1 (select |#valid| |ULTIMATE.start_build_nondet_String_#res.base|))} main_#t~ret9.base, main_#t~ret9.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;main_~original~0.base, main_~original~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset := main_~original~0.base, main_~original~0.offset;havoc rec_strcopy_#res.base, rec_strcopy_#res.offset;havoc rec_strcopy_#t~ret6, rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset, rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~length~0, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset;rec_strcopy_~source.base, rec_strcopy_~source.offset := rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset; {502#(= 1 (select |#valid| ULTIMATE.start_rec_strcopy_~source.base))} is VALID [2020-07-29 01:41:39,015 INFO L263 TraceCheckUtils]: 5: Hoare triple {502#(= 1 (select |#valid| ULTIMATE.start_rec_strcopy_~source.base))} call rec_strcopy_#t~ret6 := rec_cstrlen(rec_strcopy_~source.base, rec_strcopy_~source.offset); {499#true} is VALID [2020-07-29 01:41:39,017 INFO L280 TraceCheckUtils]: 6: Hoare triple {499#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); {511#(= (select (select |#memory_int| |rec_cstrlen_#in~s.base|) |rec_cstrlen_#in~s.offset|) |rec_cstrlen_#t~mem2|)} is VALID [2020-07-29 01:41:39,018 INFO L280 TraceCheckUtils]: 7: Hoare triple {511#(= (select (select |#memory_int| |rec_cstrlen_#in~s.base|) |rec_cstrlen_#in~s.offset|) |rec_cstrlen_#t~mem2|)} assume 0 == #t~mem2;havoc #t~mem2;#res := 0; {512#(= 0 (select (select |#memory_int| |rec_cstrlen_#in~s.base|) |rec_cstrlen_#in~s.offset|))} is VALID [2020-07-29 01:41:39,018 INFO L280 TraceCheckUtils]: 8: Hoare triple {512#(= 0 (select (select |#memory_int| |rec_cstrlen_#in~s.base|) |rec_cstrlen_#in~s.offset|))} assume true; {512#(= 0 (select (select |#memory_int| |rec_cstrlen_#in~s.base|) |rec_cstrlen_#in~s.offset|))} is VALID [2020-07-29 01:41:39,020 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {512#(= 0 (select (select |#memory_int| |rec_cstrlen_#in~s.base|) |rec_cstrlen_#in~s.offset|))} {502#(= 1 (select |#valid| ULTIMATE.start_rec_strcopy_~source.base))} #41#return; {507#(and (= 0 (select (select |#memory_int| ULTIMATE.start_rec_strcopy_~source.base) ULTIMATE.start_rec_strcopy_~source.offset)) (= 1 (select |#valid| ULTIMATE.start_rec_strcopy_~source.base)))} is VALID [2020-07-29 01:41:39,022 INFO L280 TraceCheckUtils]: 10: Hoare triple {507#(and (= 0 (select (select |#memory_int| ULTIMATE.start_rec_strcopy_~source.base) ULTIMATE.start_rec_strcopy_~source.offset)) (= 1 (select |#valid| ULTIMATE.start_rec_strcopy_~source.base)))} rec_strcopy_~length~0 := rec_strcopy_#t~ret6;havoc rec_strcopy_#t~ret6;call rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset := #Ultimate.allocOnHeap(1 + rec_strcopy_~length~0);rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset := rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset; {508#(and (not (= ULTIMATE.start_rec_strcopy_~copyAlloc~0.base ULTIMATE.start_rec_strcopy_~source.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_rec_strcopy_~source.base) ULTIMATE.start_rec_strcopy_~source.offset)))} is VALID [2020-07-29 01:41:39,024 INFO L263 TraceCheckUtils]: 11: Hoare triple {508#(and (not (= ULTIMATE.start_rec_strcopy_~copyAlloc~0.base ULTIMATE.start_rec_strcopy_~source.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_rec_strcopy_~source.base) ULTIMATE.start_rec_strcopy_~source.offset)))} call rec_strcopy_helper(rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset); {509#(and (= 0 (select (select |#memory_int| |rec_strcopy_helper_#in~source.base|) |rec_strcopy_helper_#in~source.offset|)) (not (= |rec_strcopy_helper_#in~source.base| |rec_strcopy_helper_#in~dest.base|)))} is VALID [2020-07-29 01:41:39,026 INFO L280 TraceCheckUtils]: 12: Hoare triple {509#(and (= 0 (select (select |#memory_int| |rec_strcopy_helper_#in~source.base|) |rec_strcopy_helper_#in~source.offset|)) (not (= |rec_strcopy_helper_#in~source.base| |rec_strcopy_helper_#in~dest.base|)))} ~source.base, ~source.offset := #in~source.base, #in~source.offset;~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;call #t~mem4 := read~int(~source.base, ~source.offset, 1);call write~int(#t~mem4, ~dest.base, ~dest.offset, 1);havoc #t~mem4;call #t~mem5 := read~int(~source.base, ~source.offset, 1); {510#(= |rec_strcopy_helper_#t~mem5| 0)} is VALID [2020-07-29 01:41:39,027 INFO L280 TraceCheckUtils]: 13: Hoare triple {510#(= |rec_strcopy_helper_#t~mem5| 0)} assume 0 != #t~mem5;havoc #t~mem5; {500#false} is VALID [2020-07-29 01:41:39,027 INFO L263 TraceCheckUtils]: 14: Hoare triple {500#false} call rec_strcopy_helper(~source.base, 1 + ~source.offset, ~dest.base, 1 + ~dest.offset); {500#false} is VALID [2020-07-29 01:41:39,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:41:39,029 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198244137] [2020-07-29 01:41:39,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:41:39,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-29 01:41:39,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412676867] [2020-07-29 01:41:39,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:41:39,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 01:41:39,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:41:39,310 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. cyclomatic complexity: 6 Second operand 10 states. [2020-07-29 01:41:39,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:41:39,732 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2020-07-29 01:41:39,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 01:41:39,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 01:41:39,761 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:41:39,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 38 transitions. [2020-07-29 01:41:39,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:41:39,768 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 21 states and 23 transitions. [2020-07-29 01:41:39,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-07-29 01:41:39,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-07-29 01:41:39,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2020-07-29 01:41:39,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:41:39,768 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2020-07-29 01:41:39,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2020-07-29 01:41:39,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-29 01:41:39,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:41:39,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 23 transitions. Second operand 21 states. [2020-07-29 01:41:39,771 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 23 transitions. Second operand 21 states. [2020-07-29 01:41:39,771 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 21 states. [2020-07-29 01:41:39,771 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:41:39,779 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2020-07-29 01:41:39,779 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2020-07-29 01:41:39,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:41:39,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:41:39,780 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states and 23 transitions. [2020-07-29 01:41:39,780 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states and 23 transitions. [2020-07-29 01:41:39,781 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:41:39,785 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2020-07-29 01:41:39,785 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2020-07-29 01:41:39,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:41:39,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:41:39,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:41:39,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:41:39,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-29 01:41:39,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2020-07-29 01:41:39,788 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2020-07-29 01:41:39,788 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2020-07-29 01:41:39,788 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:41:39,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2020-07-29 01:41:39,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:41:39,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:39,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:39,790 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:41:39,790 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:41:39,790 INFO L794 eck$LassoCheckResult]: Stem: 574#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 572#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length~1, main_~original~0.base, main_~original~0.offset, main_~res~0.base, main_~res~0.offset;main_~length~1 := main_#t~nondet8;havoc main_#t~nondet8; 573#L43 assume !(main_~length~1 < 1); 570#L43-2 build_nondet_String_#in~length := main_~length~1;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length := build_nondet_String_#in~length;call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 571#L12 main_#t~ret9.base, main_#t~ret9.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;main_~original~0.base, main_~original~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset := main_~original~0.base, main_~original~0.offset;havoc rec_strcopy_#res.base, rec_strcopy_#res.offset;havoc rec_strcopy_#t~ret6, rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset, rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~length~0, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset;rec_strcopy_~source.base, rec_strcopy_~source.offset := rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset; 564#L34 call rec_strcopy_#t~ret6 := rec_cstrlen(rec_strcopy_~source.base, rec_strcopy_~source.offset);< 563#rec_cstrlenENTRY ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); 565#L17 assume !(0 == #t~mem2);havoc #t~mem2; 561#L20 call #t~ret3 := rec_cstrlen(~s.base, 1 + ~s.offset);< 566#rec_cstrlenENTRY ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); 567#L17 assume 0 == #t~mem2;havoc #t~mem2;#res := 0; 560#rec_cstrlenFINAL assume true; 562#rec_cstrlenEXIT >#45#return; 568#L20-1 #res := 1 + #t~ret3;havoc #t~ret3; 569#rec_cstrlenFINAL assume true; 576#rec_cstrlenEXIT >#41#return; 575#L34-1 rec_strcopy_~length~0 := rec_strcopy_#t~ret6;havoc rec_strcopy_#t~ret6;call rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset := #Ultimate.allocOnHeap(1 + rec_strcopy_~length~0);rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset := rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset; 557#L36 call rec_strcopy_helper(rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset);< 558#rec_strcopy_helperENTRY [2020-07-29 01:41:39,790 INFO L796 eck$LassoCheckResult]: Loop: 558#rec_strcopy_helperENTRY ~source.base, ~source.offset := #in~source.base, #in~source.offset;~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;call #t~mem4 := read~int(~source.base, ~source.offset, 1);call write~int(#t~mem4, ~dest.base, ~dest.offset, 1);havoc #t~mem4;call #t~mem5 := read~int(~source.base, ~source.offset, 1); 559#L28 assume 0 != #t~mem5;havoc #t~mem5; 556#L29 call rec_strcopy_helper(~source.base, 1 + ~source.offset, ~dest.base, 1 + ~dest.offset);< 558#rec_strcopy_helperENTRY [2020-07-29 01:41:39,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:39,791 INFO L82 PathProgramCache]: Analyzing trace with hash -462834206, now seen corresponding path program 1 times [2020-07-29 01:41:39,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:39,791 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878372981] [2020-07-29 01:41:39,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:39,810 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:39,826 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:39,832 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:41:39,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:39,832 INFO L82 PathProgramCache]: Analyzing trace with hash 29922, now seen corresponding path program 2 times [2020-07-29 01:41:39,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:39,833 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233148669] [2020-07-29 01:41:39,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:39,837 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:39,841 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:39,843 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:41:39,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:39,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1448810655, now seen corresponding path program 1 times [2020-07-29 01:41:39,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:39,844 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720168805] [2020-07-29 01:41:39,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:39,866 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:39,886 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:39,892 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:41:40,887 WARN L193 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 121 [2020-07-29 01:41:41,096 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-07-29 01:41:41,270 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-07-29 01:41:41,627 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:41:41,627 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:41:41,627 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:41:41,628 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:41:41,628 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:41:41,628 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:41,628 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:41:41,628 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:41:41,629 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_strcopy_malloc2.i_Iteration4_Lasso [2020-07-29 01:41:41,629 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:41:41,629 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:41:41,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:41,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:41,851 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2020-07-29 01:41:42,024 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2020-07-29 01:41:42,027 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:41:42,027 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:41:42,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:42,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:43,279 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:41:43,280 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:43,285 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 [2020-07-29 01:41:43,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:43,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:41:43,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:43,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:43,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:43,288 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:41:43,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:41:43,289 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 [2020-07-29 01:41:43,313 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 [2020-07-29 01:41:43,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:43,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:43,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:43,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:43,329 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:41:43,329 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:41:43,340 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:41:43,372 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-07-29 01:41:43,372 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. 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) [2020-07-29 01:41:43,375 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:43,380 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:41:43,380 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:41:43,380 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length rec_strcopy_helper_#in~dest.base)_1, rec_strcopy_helper_#in~dest.offset) = 1*v_rep(select #length rec_strcopy_helper_#in~dest.base)_1 - 1*rec_strcopy_helper_#in~dest.offset Supporting invariants [] [2020-07-29 01:41:43,453 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2020-07-29 01:41:43,457 INFO L393 LassoCheck]: Loop: "~source.base, ~source.offset := #in~source.base, #in~source.offset;~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;call #t~mem4 := read~int(~source.base, ~source.offset, 1);call write~int(#t~mem4, ~dest.base, ~dest.offset, 1);havoc #t~mem4;call #t~mem5 := read~int(~source.base, ~source.offset, 1);" "assume 0 != #t~mem5;havoc #t~mem5;" "call rec_strcopy_helper(~source.base, 1 + ~source.offset, ~dest.base, 1 + ~dest.offset);"< [2020-07-29 01:41:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:43,464 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:41:43,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:43,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:41:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:43,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:41:43,574 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:41:43,587 INFO L280 TraceCheckUtils]: 0: Hoare triple {724#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {724#unseeded} is VALID [2020-07-29 01:41:43,588 INFO L280 TraceCheckUtils]: 1: Hoare triple {724#unseeded} havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length~1, main_~original~0.base, main_~original~0.offset, main_~res~0.base, main_~res~0.offset;main_~length~1 := main_#t~nondet8;havoc main_#t~nondet8; {724#unseeded} is VALID [2020-07-29 01:41:43,588 INFO L280 TraceCheckUtils]: 2: Hoare triple {724#unseeded} assume !(main_~length~1 < 1); {724#unseeded} is VALID [2020-07-29 01:41:43,589 INFO L280 TraceCheckUtils]: 3: Hoare triple {724#unseeded} build_nondet_String_#in~length := main_~length~1;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length := build_nondet_String_#in~length;call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; {724#unseeded} is VALID [2020-07-29 01:41:43,590 INFO L280 TraceCheckUtils]: 4: Hoare triple {724#unseeded} main_#t~ret9.base, main_#t~ret9.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;main_~original~0.base, main_~original~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset;rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset := main_~original~0.base, main_~original~0.offset;havoc rec_strcopy_#res.base, rec_strcopy_#res.offset;havoc rec_strcopy_#t~ret6, rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset, rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~length~0, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset;rec_strcopy_~source.base, rec_strcopy_~source.offset := rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset; {724#unseeded} is VALID [2020-07-29 01:41:43,591 INFO L263 TraceCheckUtils]: 5: Hoare triple {724#unseeded} call rec_strcopy_#t~ret6 := rec_cstrlen(rec_strcopy_~source.base, rec_strcopy_~source.offset); {802#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:43,592 INFO L280 TraceCheckUtils]: 6: Hoare triple {802#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); {802#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:43,592 INFO L280 TraceCheckUtils]: 7: Hoare triple {802#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(0 == #t~mem2);havoc #t~mem2; {802#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:43,593 INFO L263 TraceCheckUtils]: 8: Hoare triple {802#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret3 := rec_cstrlen(~s.base, 1 + ~s.offset); {802#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:43,594 INFO L280 TraceCheckUtils]: 9: Hoare triple {802#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;call #t~mem2 := read~int(~s.base, ~s.offset, 1); {802#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:43,595 INFO L280 TraceCheckUtils]: 10: Hoare triple {802#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 0 == #t~mem2;havoc #t~mem2;#res := 0; {802#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:43,596 INFO L280 TraceCheckUtils]: 11: Hoare triple {802#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {802#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:43,598 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {802#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {802#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #45#return; {802#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:43,599 INFO L280 TraceCheckUtils]: 13: Hoare triple {802#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := 1 + #t~ret3;havoc #t~ret3; {802#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:43,603 INFO L280 TraceCheckUtils]: 14: Hoare triple {802#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {802#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:43,605 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {802#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {724#unseeded} #41#return; {724#unseeded} is VALID [2020-07-29 01:41:43,605 INFO L280 TraceCheckUtils]: 16: Hoare triple {724#unseeded} rec_strcopy_~length~0 := rec_strcopy_#t~ret6;havoc rec_strcopy_#t~ret6;call rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset := #Ultimate.allocOnHeap(1 + rec_strcopy_~length~0);rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset := rec_strcopy_#t~malloc7.base, rec_strcopy_#t~malloc7.offset; {724#unseeded} is VALID [2020-07-29 01:41:43,607 INFO L263 TraceCheckUtils]: 17: Hoare triple {724#unseeded} call rec_strcopy_helper(rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset); {724#unseeded} is VALID [2020-07-29 01:41:43,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:43,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:41:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:43,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:41:43,680 INFO L280 TraceCheckUtils]: 0: Hoare triple {727#(>= oldRank0 (+ (select |#length| |rec_strcopy_helper_#in~dest.base|) (* (- 1) |rec_strcopy_helper_#in~dest.offset|)))} ~source.base, ~source.offset := #in~source.base, #in~source.offset;~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;call #t~mem4 := read~int(~source.base, ~source.offset, 1);call write~int(#t~mem4, ~dest.base, ~dest.offset, 1);havoc #t~mem4;call #t~mem5 := read~int(~source.base, ~source.offset, 1); {839#(and (<= (+ rec_strcopy_helper_~dest.offset 1) (select |#length| rec_strcopy_helper_~dest.base)) (<= (select |#length| rec_strcopy_helper_~dest.base) (+ oldRank0 rec_strcopy_helper_~dest.offset)))} is VALID [2020-07-29 01:41:43,681 INFO L280 TraceCheckUtils]: 1: Hoare triple {839#(and (<= (+ rec_strcopy_helper_~dest.offset 1) (select |#length| rec_strcopy_helper_~dest.base)) (<= (select |#length| rec_strcopy_helper_~dest.base) (+ oldRank0 rec_strcopy_helper_~dest.offset)))} assume 0 != #t~mem5;havoc #t~mem5; {839#(and (<= (+ rec_strcopy_helper_~dest.offset 1) (select |#length| rec_strcopy_helper_~dest.base)) (<= (select |#length| rec_strcopy_helper_~dest.base) (+ oldRank0 rec_strcopy_helper_~dest.offset)))} is VALID [2020-07-29 01:41:43,683 INFO L263 TraceCheckUtils]: 2: Hoare triple {839#(and (<= (+ rec_strcopy_helper_~dest.offset 1) (select |#length| rec_strcopy_helper_~dest.base)) (<= (select |#length| rec_strcopy_helper_~dest.base) (+ oldRank0 rec_strcopy_helper_~dest.offset)))} call rec_strcopy_helper(~source.base, 1 + ~source.offset, ~dest.base, 1 + ~dest.offset); {782#(or (and (> oldRank0 (+ (select |#length| |rec_strcopy_helper_#in~dest.base|) (* (- 1) |rec_strcopy_helper_#in~dest.offset|))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:41:43,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:41:43,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:41:43,711 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:41:43,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:41:43,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:43,712 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 [2020-07-29 01:41:43,712 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 4 Second operand 4 states. [2020-07-29 01:41:43,832 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 33 states and 36 transitions. Complement of second has 9 states. [2020-07-29 01:41:43,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:41:43,832 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:41:43,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. cyclomatic complexity: 4 [2020-07-29 01:41:43,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:43,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:43,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:41:43,835 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:41:43,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:43,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:43,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 36 transitions. [2020-07-29 01:41:43,836 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:41:43,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:41:43,837 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 23 transitions. cyclomatic complexity: 4 [2020-07-29 01:41:43,839 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:41:43,839 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:41:43,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:41:43,841 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:41:43,841 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 33 states and 36 transitions. cyclomatic complexity: 5 [2020-07-29 01:41:43,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 36 transitions. cyclomatic complexity: 5 [2020-07-29 01:41:43,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:41:43,842 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:41:43,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 23 transitions. cyclomatic complexity: 4 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:41:43,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:43,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:41:43,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:43,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 36 transitions. cyclomatic complexity: 5 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:41:43,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:43,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 23 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:41:43,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:43,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:41:43,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:43,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 36 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:41:43,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:43,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 23 transitions. cyclomatic complexity: 4 Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:41:43,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:43,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:41:43,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:43,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 36 transitions. cyclomatic complexity: 5 Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:41:43,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:43,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 23 transitions. cyclomatic complexity: 4 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:41:43,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:43,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:41:43,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:43,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 36 transitions. cyclomatic complexity: 5 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:41:43,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:43,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 23 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:41:43,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:43,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:41:43,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:43,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 36 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:41:43,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:43,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 23 transitions. cyclomatic complexity: 4 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:41:43,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:43,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:41:43,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:43,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 36 transitions. cyclomatic complexity: 5 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:41:43,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:43,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 23 transitions. cyclomatic complexity: 4 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:41:43,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:43,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:41:43,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:43,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 36 transitions. cyclomatic complexity: 5 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:41:43,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:43,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 23 transitions. cyclomatic complexity: 4 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:41:43,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:43,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:41:43,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:43,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 36 transitions. cyclomatic complexity: 5 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:41:43,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:43,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 23 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:41:43,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:43,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:41:43,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:43,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 36 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:41:43,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:43,851 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:41:43,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:41:43,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2020-07-29 01:41:43,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:41:43,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:43,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:41:43,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:43,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 18 letters. Loop has 6 letters. [2020-07-29 01:41:43,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:43,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. cyclomatic complexity: 5 [2020-07-29 01:41:43,857 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:41:43,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 0 states and 0 transitions. [2020-07-29 01:41:43,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:41:43,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:41:43,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:41:43,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:41:43,858 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:41:43,858 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:41:43,858 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:41:43,858 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:41:43,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:41:43,859 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:41:43,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:41:43,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:41:43 BoogieIcfgContainer [2020-07-29 01:41:43,866 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:41:43,866 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:41:43,866 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:41:43,866 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:41:43,867 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:41:33" (3/4) ... [2020-07-29 01:41:43,870 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:41:43,870 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:41:43,873 INFO L168 Benchmark]: Toolchain (without parser) took 11137.05 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 320.9 MB). Free memory was 960.2 MB in the beginning and 948.8 MB in the end (delta: 11.4 MB). Peak memory consumption was 332.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:41:43,874 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:41:43,875 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.95 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:41:43,875 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -184.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:41:43,876 INFO L168 Benchmark]: Boogie Preprocessor took 30.62 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. [2020-07-29 01:41:43,877 INFO L168 Benchmark]: RCFGBuilder took 551.97 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: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:41:43,878 INFO L168 Benchmark]: BuchiAutomizer took 10135.86 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 177.2 MB). Free memory was 1.1 GB in the beginning and 948.8 MB in the end (delta: 153.7 MB). Peak memory consumption was 330.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:41:43,878 INFO L168 Benchmark]: Witness Printer took 4.62 ms. Allocated memory is still 1.4 GB. Free memory is still 948.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:41:43,882 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 305.95 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 101.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -184.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.62 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 551.97 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: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10135.86 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 177.2 MB). Free memory was 1.1 GB in the beginning and 948.8 MB in the end (delta: 153.7 MB). Peak memory consumption was 330.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.62 ms. Allocated memory is still 1.4 GB. Free memory is still 948.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 - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[dest] + -1 * dest and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.0s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 8.0s. Construction of modules took 0.3s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 76 SDtfs, 43 SDslu, 221 SDs, 0 SdLazy, 141 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital139 mio100 ax100 hnf99 lsp95 ukn70 mio100 lsp43 div100 bol100 ite100 ukn100 eq173 hnf83 smp100 dnf105 smp95 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms 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...