./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-libowfat/strdup_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-libowfat/strdup_true-termination.c.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 eb36eb172eada83da57fd9fdc6a0c3dfe0bc61fe ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:41:42,140 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:41:42,143 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:41:42,160 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:41:42,160 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:41:42,162 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:41:42,166 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:41:42,168 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:41:42,171 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:41:42,172 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:41:42,172 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:41:42,174 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:41:42,175 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:41:42,177 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:41:42,178 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:41:42,179 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:41:42,180 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:41:42,182 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:41:42,184 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:41:42,186 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:41:42,187 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:41:42,188 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:41:42,191 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:41:42,192 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:41:42,192 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:41:42,193 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:41:42,196 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:41:42,197 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:41:42,200 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:41:42,201 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:41:42,201 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:41:42,202 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:41:42,202 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:41:42,202 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:41:42,208 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:41:42,208 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:41:42,209 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:41:42,243 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:41:42,243 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:41:42,244 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:41:42,245 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:41:42,245 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:41:42,245 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:41:42,245 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:41:42,247 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:41:42,247 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:41:42,247 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:41:42,247 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:41:42,247 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:41:42,248 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:41:42,248 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:41:42,248 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:41:42,248 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:41:42,248 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:41:42,248 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:41:42,249 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:41:42,249 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:41:42,249 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:41:42,249 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:41:42,249 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:41:42,249 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:41:42,253 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:41:42,253 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:41:42,253 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:41:42,253 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:41:42,254 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:41:42,255 INFO L133 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 -> eb36eb172eada83da57fd9fdc6a0c3dfe0bc61fe [2019-01-01 21:41:42,316 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:41:42,334 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:41:42,342 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:41:42,344 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:41:42,344 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:41:42,346 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-libowfat/strdup_true-termination.c.i [2019-01-01 21:41:42,407 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cda5decd6/74c47e93e0d44576a454701bde5390fa/FLAG70a7e8207 [2019-01-01 21:41:42,896 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:41:42,897 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-libowfat/strdup_true-termination.c.i [2019-01-01 21:41:42,912 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cda5decd6/74c47e93e0d44576a454701bde5390fa/FLAG70a7e8207 [2019-01-01 21:41:43,222 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cda5decd6/74c47e93e0d44576a454701bde5390fa [2019-01-01 21:41:43,226 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:41:43,228 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:41:43,229 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:41:43,229 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:41:43,234 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:41:43,235 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:41:43" (1/1) ... [2019-01-01 21:41:43,239 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a8e7523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:43, skipping insertion in model container [2019-01-01 21:41:43,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:41:43" (1/1) ... [2019-01-01 21:41:43,250 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:41:43,294 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:41:43,744 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:41:43,763 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:41:43,839 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:41:43,981 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:41:43,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:43 WrapperNode [2019-01-01 21:41:43,982 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:41:43,983 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:41:43,983 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:41:43,983 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:41:43,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:43" (1/1) ... [2019-01-01 21:41:44,011 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:43" (1/1) ... [2019-01-01 21:41:44,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:41:44,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:41:44,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:41:44,043 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:41:44,052 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:43" (1/1) ... [2019-01-01 21:41:44,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:43" (1/1) ... [2019-01-01 21:41:44,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:43" (1/1) ... [2019-01-01 21:41:44,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:43" (1/1) ... [2019-01-01 21:41:44,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:43" (1/1) ... [2019-01-01 21:41:44,075 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:43" (1/1) ... [2019-01-01 21:41:44,077 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:43" (1/1) ... [2019-01-01 21:41:44,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:41:44,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:41:44,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:41:44,081 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:41:44,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:41:44,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:41:44,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:41:44,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 21:41:44,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:41:44,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:41:44,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:41:44,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:41:44,586 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:41:44,587 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2019-01-01 21:41:44,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:41:44 BoogieIcfgContainer [2019-01-01 21:41:44,587 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:41:44,589 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:41:44,589 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:41:44,593 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:41:44,594 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:41:44,595 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:41:43" (1/3) ... [2019-01-01 21:41:44,596 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2cc2587c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:41:44, skipping insertion in model container [2019-01-01 21:41:44,596 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:41:44,596 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:43" (2/3) ... [2019-01-01 21:41:44,598 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2cc2587c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:41:44, skipping insertion in model container [2019-01-01 21:41:44,598 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:41:44,598 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:41:44" (3/3) ... [2019-01-01 21:41:44,601 INFO L375 chiAutomizerObserver]: Analyzing ICFG strdup_true-termination.c.i [2019-01-01 21:41:44,659 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:41:44,660 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:41:44,660 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:41:44,660 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:41:44,660 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:41:44,661 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:41:44,661 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:41:44,661 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:41:44,661 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:41:44,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-01 21:41:44,697 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-01 21:41:44,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:41:44,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:41:44,704 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:41:44,704 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:41:44,704 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:41:44,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-01 21:41:44,707 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-01 21:41:44,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:41:44,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:41:44,707 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:41:44,707 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:41:44,717 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset;main_~in_len~0 := main_#t~nondet12;havoc main_#t~nondet12; 19#L528true assume !(main_~in_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);strdup_#in~s.base, strdup_#in~s.offset := main_~in~0.base, main_~in~0.offset;havoc strdup_#res.base, strdup_#res.offset;havoc strdup_#t~ret9, strdup_#t~malloc10.base, strdup_#t~malloc10.offset, strdup_#t~ret11.base, strdup_#t~ret11.offset, strdup_~s.base, strdup_~s.offset, strdup_~l~0, strdup_~tmp~0.base, strdup_~tmp~0.offset;strdup_~s.base, strdup_~s.offset := strdup_#in~s.base, strdup_#in~s.offset;strlen_#in~s.base, strlen_#in~s.offset := strdup_~s.base, strdup_~s.offset;havoc strlen_#res;havoc strlen_#t~pre7, strlen_#t~pre6.base, strlen_#t~pre6.offset, strlen_#t~mem8, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 3#L516true assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 7#L517-4true [2019-01-01 21:41:44,717 INFO L796 eck$LassoCheckResult]: Loop: 7#L517-4true call strlen_#t~mem8 := read~int(strlen_~s.base, strlen_~s.offset, 1); 4#L517-1true assume !!(0 != strlen_#t~mem8);havoc strlen_#t~mem8;strlen_#t~pre7 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre7; 5#L517-3true strlen_#t~pre6.base, strlen_#t~pre6.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre6.base, strlen_#t~pre6.offset; 7#L517-4true [2019-01-01 21:41:44,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:44,727 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2019-01-01 21:41:44,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:44,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:44,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:44,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:41:44,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:44,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:44,893 INFO L82 PathProgramCache]: Analyzing trace with hash 45841, now seen corresponding path program 1 times [2019-01-01 21:41:44,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:44,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:44,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:44,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:41:44,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:44,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:44,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:44,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1806906826, now seen corresponding path program 1 times [2019-01-01 21:41:44,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:44,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:44,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:44,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:41:44,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:45,720 WARN L181 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2019-01-01 21:41:45,823 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-01-01 21:41:45,838 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:41:45,839 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:41:45,839 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:41:45,839 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:41:45,840 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:41:45,840 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:41:45,840 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:41:45,840 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:41:45,840 INFO L131 ssoRankerPreferences]: Filename of dumped script: strdup_true-termination.c.i_Iteration1_Lasso [2019-01-01 21:41:45,841 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:41:45,841 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:41:45,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:45,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:45,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:45,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:45,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:45,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:45,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:45,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:45,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:45,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:46,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:46,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:46,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:46,522 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-01-01 21:41:46,631 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-01-01 21:41:46,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:46,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:46,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:46,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:46,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:46,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:46,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:46,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:46,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:46,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:47,197 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-01 21:41:47,419 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:41:47,425 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:41:47,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:47,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:47,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:47,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:47,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:47,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:47,432 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:47,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:47,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:47,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:47,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:47,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:47,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:47,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:47,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:47,437 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:47,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:47,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:47,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:47,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:47,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:47,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:47,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:47,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:47,440 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:47,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:47,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:47,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:47,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:47,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:47,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:47,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:47,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:47,443 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:47,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:47,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:47,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:47,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:47,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:47,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:47,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:47,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:47,446 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:47,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:47,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:47,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:47,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:47,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:47,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:47,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:47,453 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:47,453 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:47,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:47,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:47,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:47,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:47,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:47,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:47,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:47,459 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:47,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:47,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:47,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:47,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:47,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:47,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:47,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:47,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:47,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:47,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:47,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:47,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:47,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:47,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:47,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:47,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:47,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:47,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:47,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:47,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:47,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:47,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:47,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:47,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:47,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:47,471 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:47,471 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:47,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:47,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:47,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:47,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:47,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:47,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:47,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:47,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:47,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:47,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:47,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:47,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:47,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:47,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:47,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:47,499 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:47,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:47,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:47,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:47,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:47,501 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:41:47,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:47,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:47,510 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 21:41:47,510 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:47,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:47,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:47,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:47,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:47,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:47,575 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:41:47,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:47,578 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:41:47,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:47,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:47,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:47,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:47,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:47,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:47,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:47,588 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:47,588 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:47,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:47,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:47,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:47,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:47,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:47,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:47,625 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:47,625 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:47,690 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:41:47,732 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:41:47,732 INFO L444 ModelExtractionUtils]: 27 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:41:47,736 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:41:47,738 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:41:47,739 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:41:47,739 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlen_~s.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1) = -1*ULTIMATE.start_strlen_~s.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1 Supporting invariants [] [2019-01-01 21:41:47,779 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2019-01-01 21:41:47,790 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:41:48,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:41:48,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:41:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:41:48,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:41:48,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:41:48,271 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:41:48,272 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 4 states. [2019-01-01 21:41:48,371 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 4 states. Result 45 states and 57 transitions. Complement of second has 7 states. [2019-01-01 21:41:48,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:41:48,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:41:48,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2019-01-01 21:41:48,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-01 21:41:48,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:41:48,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-01 21:41:48,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:41:48,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 6 letters. [2019-01-01 21:41:48,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:41:48,387 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 57 transitions. [2019-01-01 21:41:48,391 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 21:41:48,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 18 states and 21 transitions. [2019-01-01 21:41:48,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-01 21:41:48,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-01 21:41:48,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-01-01 21:41:48,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:41:48,399 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-01-01 21:41:48,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-01-01 21:41:48,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2019-01-01 21:41:48,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-01 21:41:48,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2019-01-01 21:41:48,425 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-01-01 21:41:48,425 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-01-01 21:41:48,425 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:41:48,425 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2019-01-01 21:41:48,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:41:48,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:41:48,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:41:48,427 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:41:48,427 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:41:48,427 INFO L794 eck$LassoCheckResult]: Stem: 143#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 136#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset;main_~in_len~0 := main_#t~nondet12;havoc main_#t~nondet12; 137#L528 assume !(main_~in_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);strdup_#in~s.base, strdup_#in~s.offset := main_~in~0.base, main_~in~0.offset;havoc strdup_#res.base, strdup_#res.offset;havoc strdup_#t~ret9, strdup_#t~malloc10.base, strdup_#t~malloc10.offset, strdup_#t~ret11.base, strdup_#t~ret11.offset, strdup_~s.base, strdup_~s.offset, strdup_~l~0, strdup_~tmp~0.base, strdup_~tmp~0.offset;strdup_~s.base, strdup_~s.offset := strdup_#in~s.base, strdup_#in~s.offset;strlen_#in~s.base, strlen_#in~s.offset := strdup_~s.base, strdup_~s.offset;havoc strlen_#res;havoc strlen_#t~pre7, strlen_#t~pre6.base, strlen_#t~pre6.offset, strlen_#t~mem8, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 138#L516 assume strlen_~s.base == 0 && strlen_~s.offset == 0;strlen_#res := 0; 139#L518 strdup_#t~ret9 := strlen_#res;strdup_~l~0 := 1 + strdup_#t~ret9;havoc strdup_#t~ret9;call strdup_#t~malloc10.base, strdup_#t~malloc10.offset := #Ultimate.allocOnHeap(strdup_~l~0);strdup_~tmp~0.base, strdup_~tmp~0.offset := strdup_#t~malloc10.base, strdup_#t~malloc10.offset; 145#L523 assume !(strdup_~tmp~0.base == 0 && strdup_~tmp~0.offset == 0);memcpy_#in~dst.base, memcpy_#in~dst.offset, memcpy_#in~src.base, memcpy_#in~src.offset, memcpy_#in~n := strdup_~tmp~0.base, strdup_~tmp~0.offset, strdup_~s.base, strdup_~s.offset, strdup_~l~0;havoc memcpy_#res.base, memcpy_#res.offset;havoc memcpy_#t~post3.base, memcpy_#t~post3.offset, memcpy_#t~post4.base, memcpy_#t~post4.offset, memcpy_#t~mem5, memcpy_#t~post2, memcpy_~dst.base, memcpy_~dst.offset, memcpy_~src.base, memcpy_~src.offset, memcpy_~n, memcpy_~res~0.base, memcpy_~res~0.offset, memcpy_~c1~0.base, memcpy_~c1~0.offset, memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~dst.base, memcpy_~dst.offset := memcpy_#in~dst.base, memcpy_#in~dst.offset;memcpy_~src.base, memcpy_~src.offset := memcpy_#in~src.base, memcpy_#in~src.offset;memcpy_~n := memcpy_#in~n;memcpy_~res~0.base, memcpy_~res~0.offset := memcpy_~dst.base, memcpy_~dst.offset;havoc memcpy_~c1~0.base, memcpy_~c1~0.offset;havoc memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~c1~0.base, memcpy_~c1~0.offset := memcpy_~dst.base, memcpy_~dst.offset;memcpy_~c2~0.base, memcpy_~c2~0.offset := memcpy_~src.base, memcpy_~src.offset; 142#L511-3 [2019-01-01 21:41:48,428 INFO L796 eck$LassoCheckResult]: Loop: 142#L511-3 memcpy_#t~post2 := memcpy_~n;memcpy_~n := memcpy_#t~post2 - 1; 141#L511-1 assume !!(0 != memcpy_#t~post2 % 4294967296);havoc memcpy_#t~post2;memcpy_#t~post3.base, memcpy_#t~post3.offset := memcpy_~c1~0.base, memcpy_~c1~0.offset;memcpy_~c1~0.base, memcpy_~c1~0.offset := memcpy_#t~post3.base, 1 + memcpy_#t~post3.offset;memcpy_#t~post4.base, memcpy_#t~post4.offset := memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~c2~0.base, memcpy_~c2~0.offset := memcpy_#t~post4.base, 1 + memcpy_#t~post4.offset;call memcpy_#t~mem5 := read~int(memcpy_#t~post4.base, memcpy_#t~post4.offset, 1);call write~int(memcpy_#t~mem5, memcpy_#t~post3.base, memcpy_#t~post3.offset, 1);havoc memcpy_#t~post4.base, memcpy_#t~post4.offset;havoc memcpy_#t~post3.base, memcpy_#t~post3.offset;havoc memcpy_#t~mem5; 142#L511-3 [2019-01-01 21:41:48,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:48,428 INFO L82 PathProgramCache]: Analyzing trace with hash 889569803, now seen corresponding path program 1 times [2019-01-01 21:41:48,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:48,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:48,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:48,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:41:48,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:41:48,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:41:48,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:41:48,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 21:41:48,520 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:41:48,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:48,520 INFO L82 PathProgramCache]: Analyzing trace with hash 2214, now seen corresponding path program 1 times [2019-01-01 21:41:48,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:48,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:48,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:48,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:41:48,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:48,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:41:48,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:41:48,683 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-01 21:41:48,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:41:48,694 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2019-01-01 21:41:48,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:41:48,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2019-01-01 21:41:48,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:41:48,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 16 transitions. [2019-01-01 21:41:48,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-01 21:41:48,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 21:41:48,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2019-01-01 21:41:48,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:41:48,698 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-01-01 21:41:48,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2019-01-01 21:41:48,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-01 21:41:48,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-01 21:41:48,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-01-01 21:41:48,702 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-01-01 21:41:48,702 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-01-01 21:41:48,702 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:41:48,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2019-01-01 21:41:48,703 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:41:48,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:41:48,703 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:41:48,704 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:41:48,704 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:41:48,704 INFO L794 eck$LassoCheckResult]: Stem: 176#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 166#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset;main_~in_len~0 := main_#t~nondet12;havoc main_#t~nondet12; 167#L528 assume !(main_~in_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);strdup_#in~s.base, strdup_#in~s.offset := main_~in~0.base, main_~in~0.offset;havoc strdup_#res.base, strdup_#res.offset;havoc strdup_#t~ret9, strdup_#t~malloc10.base, strdup_#t~malloc10.offset, strdup_#t~ret11.base, strdup_#t~ret11.offset, strdup_~s.base, strdup_~s.offset, strdup_~l~0, strdup_~tmp~0.base, strdup_~tmp~0.offset;strdup_~s.base, strdup_~s.offset := strdup_#in~s.base, strdup_#in~s.offset;strlen_#in~s.base, strlen_#in~s.offset := strdup_~s.base, strdup_~s.offset;havoc strlen_#res;havoc strlen_#t~pre7, strlen_#t~pre6.base, strlen_#t~pre6.offset, strlen_#t~mem8, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 168#L516 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 169#L517-4 call strlen_#t~mem8 := read~int(strlen_~s.base, strlen_~s.offset, 1); 170#L517-1 assume !(0 != strlen_#t~mem8);havoc strlen_#t~mem8; 171#L517-5 strlen_#res := strlen_~i~0; 178#L518 strdup_#t~ret9 := strlen_#res;strdup_~l~0 := 1 + strdup_#t~ret9;havoc strdup_#t~ret9;call strdup_#t~malloc10.base, strdup_#t~malloc10.offset := #Ultimate.allocOnHeap(strdup_~l~0);strdup_~tmp~0.base, strdup_~tmp~0.offset := strdup_#t~malloc10.base, strdup_#t~malloc10.offset; 179#L523 assume !(strdup_~tmp~0.base == 0 && strdup_~tmp~0.offset == 0);memcpy_#in~dst.base, memcpy_#in~dst.offset, memcpy_#in~src.base, memcpy_#in~src.offset, memcpy_#in~n := strdup_~tmp~0.base, strdup_~tmp~0.offset, strdup_~s.base, strdup_~s.offset, strdup_~l~0;havoc memcpy_#res.base, memcpy_#res.offset;havoc memcpy_#t~post3.base, memcpy_#t~post3.offset, memcpy_#t~post4.base, memcpy_#t~post4.offset, memcpy_#t~mem5, memcpy_#t~post2, memcpy_~dst.base, memcpy_~dst.offset, memcpy_~src.base, memcpy_~src.offset, memcpy_~n, memcpy_~res~0.base, memcpy_~res~0.offset, memcpy_~c1~0.base, memcpy_~c1~0.offset, memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~dst.base, memcpy_~dst.offset := memcpy_#in~dst.base, memcpy_#in~dst.offset;memcpy_~src.base, memcpy_~src.offset := memcpy_#in~src.base, memcpy_#in~src.offset;memcpy_~n := memcpy_#in~n;memcpy_~res~0.base, memcpy_~res~0.offset := memcpy_~dst.base, memcpy_~dst.offset;havoc memcpy_~c1~0.base, memcpy_~c1~0.offset;havoc memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~c1~0.base, memcpy_~c1~0.offset := memcpy_~dst.base, memcpy_~dst.offset;memcpy_~c2~0.base, memcpy_~c2~0.offset := memcpy_~src.base, memcpy_~src.offset; 175#L511-3 [2019-01-01 21:41:48,704 INFO L796 eck$LassoCheckResult]: Loop: 175#L511-3 memcpy_#t~post2 := memcpy_~n;memcpy_~n := memcpy_#t~post2 - 1; 174#L511-1 assume !!(0 != memcpy_#t~post2 % 4294967296);havoc memcpy_#t~post2;memcpy_#t~post3.base, memcpy_#t~post3.offset := memcpy_~c1~0.base, memcpy_~c1~0.offset;memcpy_~c1~0.base, memcpy_~c1~0.offset := memcpy_#t~post3.base, 1 + memcpy_#t~post3.offset;memcpy_#t~post4.base, memcpy_#t~post4.offset := memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~c2~0.base, memcpy_~c2~0.offset := memcpy_#t~post4.base, 1 + memcpy_#t~post4.offset;call memcpy_#t~mem5 := read~int(memcpy_#t~post4.base, memcpy_#t~post4.offset, 1);call write~int(memcpy_#t~mem5, memcpy_#t~post3.base, memcpy_#t~post3.offset, 1);havoc memcpy_#t~post4.base, memcpy_#t~post4.offset;havoc memcpy_#t~post3.base, memcpy_#t~post3.offset;havoc memcpy_#t~mem5; 175#L511-3 [2019-01-01 21:41:48,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:48,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1270617397, now seen corresponding path program 1 times [2019-01-01 21:41:48,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:48,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:48,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:48,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:41:48,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:48,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:48,765 INFO L82 PathProgramCache]: Analyzing trace with hash 2214, now seen corresponding path program 2 times [2019-01-01 21:41:48,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:48,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:48,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:48,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:41:48,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:48,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:48,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:48,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1292607706, now seen corresponding path program 1 times [2019-01-01 21:41:48,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:48,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:48,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:48,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:41:48,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:49,859 WARN L181 SmtUtils]: Spent 832.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 126 [2019-01-01 21:41:50,043 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-01-01 21:41:50,062 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:41:50,062 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:41:50,062 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:41:50,062 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:41:50,062 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:41:50,064 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:41:50,064 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:41:50,064 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:41:50,064 INFO L131 ssoRankerPreferences]: Filename of dumped script: strdup_true-termination.c.i_Iteration3_Lasso [2019-01-01 21:41:50,064 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:41:50,064 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:41:50,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:50,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:50,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:50,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:50,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:50,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:50,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:50,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:50,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:50,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:50,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:50,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:50,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:50,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:50,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:50,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:50,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:50,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:50,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:50,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:50,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:50,919 WARN L181 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 109 [2019-01-01 21:41:51,136 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-01-01 21:41:51,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:51,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:51,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:51,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:51,588 WARN L181 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-01-01 21:41:51,752 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-01-01 21:41:51,866 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-01-01 21:41:52,359 WARN L181 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-01-01 21:41:53,085 WARN L181 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-01-01 21:41:53,178 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:41:53,178 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:41:53,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:53,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:53,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:53,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:53,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:53,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:53,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:53,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:53,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:53,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:53,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:53,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:53,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:53,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:53,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:53,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:53,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:53,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:53,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:53,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:53,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:53,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:53,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:53,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:53,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:53,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:53,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:53,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:53,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:53,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:53,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:53,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:53,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:53,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:53,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:53,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:53,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:53,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:53,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:53,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:53,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:53,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:53,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:53,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:53,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:53,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:53,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:53,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:53,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:53,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:53,205 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:53,205 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:53,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:53,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:53,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:53,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:53,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:53,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:53,209 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:53,209 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:53,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:53,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:53,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:53,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:53,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:53,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:53,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:53,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:53,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:53,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:53,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:53,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:53,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:53,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:53,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:53,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:53,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:53,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:53,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:53,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:53,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:53,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:53,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:53,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:53,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:53,229 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:53,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:53,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:53,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:53,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:53,232 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:53,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:53,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:53,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:53,235 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:53,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:53,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:53,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:53,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:53,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:53,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:53,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:53,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:53,240 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:53,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:53,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:53,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:53,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:53,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:53,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:53,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:53,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:53,247 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:53,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:53,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:53,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:53,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:53,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:53,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:53,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:53,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:53,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:53,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:53,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:53,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:53,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:53,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:53,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:53,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:53,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:53,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:53,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:53,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:53,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:53,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:53,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:53,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:53,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:53,260 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:53,260 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:53,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:53,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:53,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:53,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:53,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:53,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:53,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:53,267 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:53,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:53,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:53,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:53,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:53,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:53,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:53,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:53,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:53,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:53,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:53,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:53,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:53,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:53,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:53,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:53,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:53,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:53,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:53,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:53,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:53,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:53,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:53,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:53,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:53,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:53,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:53,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:53,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:53,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:53,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:53,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:53,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:53,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:53,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:53,289 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:53,289 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:53,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:53,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:53,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:53,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:53,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:53,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:53,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:53,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:53,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:53,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:53,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:53,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:53,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:53,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:53,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:53,332 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:53,332 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:53,409 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:41:53,507 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-01 21:41:53,507 INFO L444 ModelExtractionUtils]: 69 out of 76 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 21:41:53,508 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:41:53,509 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 21:41:53,511 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:41:53,511 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_memcpy_~c1~0.offset) = -2*ULTIMATE.start_memcpy_~c1~0.offset + 1 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_strdup_#t~malloc10.base)_1 + 1 >= 0] [2019-01-01 21:41:53,859 INFO L297 tatePredicateManager]: 19 out of 21 supporting invariants were superfluous and have been removed [2019-01-01 21:41:53,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:41:53,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:41:54,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 21:41:54,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 21:41:54,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:41:54,118 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:10 [2019-01-01 21:41:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:41:54,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:41:54,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:41:54,289 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 1 loop predicates [2019-01-01 21:41:54,289 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand 6 states. [2019-01-01 21:41:54,543 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 4. Second operand 6 states. Result 25 states and 28 transitions. Complement of second has 9 states. [2019-01-01 21:41:54,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 1 non-accepting loop states 2 accepting loop states [2019-01-01 21:41:54,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:41:54,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2019-01-01 21:41:54,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-01 21:41:54,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:41:54,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-01 21:41:54,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:41:54,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 9 letters. Loop has 4 letters. [2019-01-01 21:41:54,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:41:54,549 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 28 transitions. [2019-01-01 21:41:54,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:41:54,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 17 states and 18 transitions. [2019-01-01 21:41:54,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-01 21:41:54,551 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-01 21:41:54,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2019-01-01 21:41:54,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:41:54,552 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-01 21:41:54,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2019-01-01 21:41:54,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2019-01-01 21:41:54,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-01 21:41:54,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-01-01 21:41:54,556 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-01-01 21:41:54,556 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-01-01 21:41:54,556 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:41:54,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 15 transitions. [2019-01-01 21:41:54,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:41:54,557 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:41:54,557 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:41:54,560 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:41:54,560 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:41:54,561 INFO L794 eck$LassoCheckResult]: Stem: 373#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 367#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset;main_~in_len~0 := main_#t~nondet12;havoc main_#t~nondet12; 368#L528 assume !(main_~in_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);strdup_#in~s.base, strdup_#in~s.offset := main_~in~0.base, main_~in~0.offset;havoc strdup_#res.base, strdup_#res.offset;havoc strdup_#t~ret9, strdup_#t~malloc10.base, strdup_#t~malloc10.offset, strdup_#t~ret11.base, strdup_#t~ret11.offset, strdup_~s.base, strdup_~s.offset, strdup_~l~0, strdup_~tmp~0.base, strdup_~tmp~0.offset;strdup_~s.base, strdup_~s.offset := strdup_#in~s.base, strdup_#in~s.offset;strlen_#in~s.base, strlen_#in~s.offset := strdup_~s.base, strdup_~s.offset;havoc strlen_#res;havoc strlen_#t~pre7, strlen_#t~pre6.base, strlen_#t~pre6.offset, strlen_#t~mem8, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 369#L516 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 370#L517-4 call strlen_#t~mem8 := read~int(strlen_~s.base, strlen_~s.offset, 1); 365#L517-1 assume !!(0 != strlen_#t~mem8);havoc strlen_#t~mem8;strlen_#t~pre7 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre7; 366#L517-3 strlen_#t~pre6.base, strlen_#t~pre6.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre6.base, strlen_#t~pre6.offset; 374#L517-4 call strlen_#t~mem8 := read~int(strlen_~s.base, strlen_~s.offset, 1); 363#L517-1 assume !(0 != strlen_#t~mem8);havoc strlen_#t~mem8; 364#L517-5 strlen_#res := strlen_~i~0; 375#L518 strdup_#t~ret9 := strlen_#res;strdup_~l~0 := 1 + strdup_#t~ret9;havoc strdup_#t~ret9;call strdup_#t~malloc10.base, strdup_#t~malloc10.offset := #Ultimate.allocOnHeap(strdup_~l~0);strdup_~tmp~0.base, strdup_~tmp~0.offset := strdup_#t~malloc10.base, strdup_#t~malloc10.offset; 376#L523 assume !(strdup_~tmp~0.base == 0 && strdup_~tmp~0.offset == 0);memcpy_#in~dst.base, memcpy_#in~dst.offset, memcpy_#in~src.base, memcpy_#in~src.offset, memcpy_#in~n := strdup_~tmp~0.base, strdup_~tmp~0.offset, strdup_~s.base, strdup_~s.offset, strdup_~l~0;havoc memcpy_#res.base, memcpy_#res.offset;havoc memcpy_#t~post3.base, memcpy_#t~post3.offset, memcpy_#t~post4.base, memcpy_#t~post4.offset, memcpy_#t~mem5, memcpy_#t~post2, memcpy_~dst.base, memcpy_~dst.offset, memcpy_~src.base, memcpy_~src.offset, memcpy_~n, memcpy_~res~0.base, memcpy_~res~0.offset, memcpy_~c1~0.base, memcpy_~c1~0.offset, memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~dst.base, memcpy_~dst.offset := memcpy_#in~dst.base, memcpy_#in~dst.offset;memcpy_~src.base, memcpy_~src.offset := memcpy_#in~src.base, memcpy_#in~src.offset;memcpy_~n := memcpy_#in~n;memcpy_~res~0.base, memcpy_~res~0.offset := memcpy_~dst.base, memcpy_~dst.offset;havoc memcpy_~c1~0.base, memcpy_~c1~0.offset;havoc memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~c1~0.base, memcpy_~c1~0.offset := memcpy_~dst.base, memcpy_~dst.offset;memcpy_~c2~0.base, memcpy_~c2~0.offset := memcpy_~src.base, memcpy_~src.offset; 372#L511-3 [2019-01-01 21:41:54,561 INFO L796 eck$LassoCheckResult]: Loop: 372#L511-3 memcpy_#t~post2 := memcpy_~n;memcpy_~n := memcpy_#t~post2 - 1; 371#L511-1 assume !!(0 != memcpy_#t~post2 % 4294967296);havoc memcpy_#t~post2;memcpy_#t~post3.base, memcpy_#t~post3.offset := memcpy_~c1~0.base, memcpy_~c1~0.offset;memcpy_~c1~0.base, memcpy_~c1~0.offset := memcpy_#t~post3.base, 1 + memcpy_#t~post3.offset;memcpy_#t~post4.base, memcpy_#t~post4.offset := memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~c2~0.base, memcpy_~c2~0.offset := memcpy_#t~post4.base, 1 + memcpy_#t~post4.offset;call memcpy_#t~mem5 := read~int(memcpy_#t~post4.base, memcpy_#t~post4.offset, 1);call write~int(memcpy_#t~mem5, memcpy_#t~post3.base, memcpy_#t~post3.offset, 1);havoc memcpy_#t~post4.base, memcpy_#t~post4.offset;havoc memcpy_#t~post3.base, memcpy_#t~post3.offset;havoc memcpy_#t~mem5; 372#L511-3 [2019-01-01 21:41:54,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:54,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1230807917, now seen corresponding path program 1 times [2019-01-01 21:41:54,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:54,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:54,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:54,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:41:54,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:54,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:54,589 INFO L82 PathProgramCache]: Analyzing trace with hash 2214, now seen corresponding path program 3 times [2019-01-01 21:41:54,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:54,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:54,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:54,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:41:54,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:54,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:54,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:54,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1690400584, now seen corresponding path program 1 times [2019-01-01 21:41:54,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:54,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:54,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:54,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:41:54,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:54,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:54,748 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-01-01 21:41:55,298 WARN L181 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 136 [2019-01-01 21:41:55,508 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-01-01 21:41:55,513 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:41:55,513 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:41:55,513 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:41:55,513 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:41:55,513 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:41:55,513 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:41:55,513 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:41:55,513 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:41:55,513 INFO L131 ssoRankerPreferences]: Filename of dumped script: strdup_true-termination.c.i_Iteration4_Lasso [2019-01-01 21:41:55,514 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:41:55,514 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:41:55,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:55,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:55,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:55,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:56,221 WARN L181 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 109 [2019-01-01 21:41:56,439 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-01-01 21:41:56,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:56,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:56,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:56,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:56,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:56,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:56,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:56,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:56,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:56,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:56,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:56,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:56,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:56,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:56,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:56,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:56,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:56,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:56,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:56,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:56,716 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-01-01 21:41:56,910 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-01-01 21:41:57,319 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-01-01 21:41:58,037 WARN L181 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-01-01 21:41:58,171 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:41:58,171 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:41:58,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:58,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:58,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:58,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:58,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:58,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:58,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:58,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:58,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:58,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:58,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:58,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:58,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:58,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:58,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:58,183 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:58,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:58,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:58,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:58,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:58,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:58,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:58,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:58,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:58,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:58,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:58,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:58,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:58,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:58,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:58,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:58,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:58,199 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:58,200 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:58,247 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:41:58,327 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:41:58,328 INFO L444 ModelExtractionUtils]: 68 out of 73 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 21:41:58,328 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:41:58,329 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:41:58,329 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:41:58,329 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strdup_#t~malloc10.base)_2, ULTIMATE.start_memcpy_~c1~0.offset) = 1*v_rep(select #length ULTIMATE.start_strdup_#t~malloc10.base)_2 - 1*ULTIMATE.start_memcpy_~c1~0.offset Supporting invariants [] [2019-01-01 21:41:58,882 INFO L297 tatePredicateManager]: 21 out of 22 supporting invariants were superfluous and have been removed [2019-01-01 21:41:58,904 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:41:59,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:41:59,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:41:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:41:59,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:41:59,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:41:59,133 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2019-01-01 21:41:59,133 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 15 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-01-01 21:41:59,192 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 15 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 16 states and 18 transitions. Complement of second has 5 states. [2019-01-01 21:41:59,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:41:59,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:41:59,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-01-01 21:41:59,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 12 letters. Loop has 2 letters. [2019-01-01 21:41:59,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:41:59,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 14 letters. Loop has 2 letters. [2019-01-01 21:41:59,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:41:59,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 12 letters. Loop has 4 letters. [2019-01-01 21:41:59,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:41:59,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 18 transitions. [2019-01-01 21:41:59,196 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:41:59,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2019-01-01 21:41:59,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:41:59,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:41:59,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:41:59,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:41:59,197 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:41:59,197 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:41:59,197 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:41:59,197 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:41:59,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:41:59,197 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:41:59,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:41:59,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:41:59 BoogieIcfgContainer [2019-01-01 21:41:59,205 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:41:59,205 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:41:59,205 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:41:59,205 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:41:59,206 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:41:44" (3/4) ... [2019-01-01 21:41:59,210 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:41:59,210 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:41:59,211 INFO L168 Benchmark]: Toolchain (without parser) took 15983.93 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 331.9 MB). Free memory was 951.4 MB in the beginning and 886.3 MB in the end (delta: 65.0 MB). Peak memory consumption was 396.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:41:59,212 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:41:59,212 INFO L168 Benchmark]: CACSL2BoogieTranslator took 753.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -181.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:41:59,213 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:41:59,215 INFO L168 Benchmark]: Boogie Preprocessor took 37.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:41:59,216 INFO L168 Benchmark]: RCFGBuilder took 507.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:41:59,216 INFO L168 Benchmark]: BuchiAutomizer took 14615.81 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 186.1 MB). Free memory was 1.1 GB in the beginning and 886.3 MB in the end (delta: 214.2 MB). Peak memory consumption was 400.3 MB. Max. memory is 11.5 GB. [2019-01-01 21:41:59,218 INFO L168 Benchmark]: Witness Printer took 4.72 ms. Allocated memory is still 1.4 GB. Free memory is still 886.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:41:59,224 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 753.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -181.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.35 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 507.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 14615.81 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 186.1 MB). Free memory was 1.1 GB in the beginning and 886.3 MB in the end (delta: 214.2 MB). Peak memory consumption was 400.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.72 ms. Allocated memory is still 1.4 GB. Free memory is still 886.3 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 (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (in_len)] and consists of 5 locations. One deterministic module has affine ranking function -2 * c1 + 1 and consists of 7 locations. One deterministic module has affine ranking function unknown-#length-unknown[malloc(l)] + -1 * c1 and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.5s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 12.8s. Construction of modules took 0.1s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 46 SDtfs, 57 SDslu, 37 SDs, 0 SdLazy, 35 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital225 mio100 ax100 hnf99 lsp94 ukn95 mio100 lsp48 div120 bol100 ite100 ukn100 eq190 hnf81 smp95 dnf156 smp83 tf100 neg98 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 72ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...