./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f 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/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f96fdc95fb6e9912f13e4890488921a4cb17c15a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 05:00:03,196 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 05:00:03,199 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 05:00:03,218 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 05:00:03,218 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 05:00:03,219 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 05:00:03,221 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 05:00:03,223 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 05:00:03,225 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 05:00:03,225 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 05:00:03,227 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 05:00:03,227 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 05:00:03,228 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 05:00:03,229 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 05:00:03,231 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 05:00:03,231 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 05:00:03,233 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 05:00:03,234 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 05:00:03,237 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 05:00:03,239 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 05:00:03,240 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 05:00:03,241 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 05:00:03,244 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 05:00:03,244 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 05:00:03,245 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 05:00:03,246 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 05:00:03,247 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 05:00:03,248 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 05:00:03,249 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 05:00:03,250 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 05:00:03,251 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 05:00:03,252 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 05:00:03,252 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 05:00:03,252 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 05:00:03,253 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 05:00:03,255 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 05:00:03,255 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 05:00:03,271 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 05:00:03,272 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 05:00:03,273 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 05:00:03,273 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 05:00:03,273 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 05:00:03,274 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 05:00:03,274 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 05:00:03,275 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 05:00:03,275 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 05:00:03,275 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 05:00:03,275 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 05:00:03,275 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 05:00:03,275 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 05:00:03,276 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 05:00:03,277 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 05:00:03,277 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 05:00:03,277 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 05:00:03,277 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 05:00:03,277 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 05:00:03,277 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 05:00:03,278 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 05:00:03,279 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 05:00:03,279 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 05:00:03,279 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 05:00:03,279 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 05:00:03,279 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 05:00:03,279 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 05:00:03,280 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 05:00:03,280 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 05:00:03,280 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 05:00:03,280 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 05:00:03,282 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 05:00:03,283 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f96fdc95fb6e9912f13e4890488921a4cb17c15a [2019-01-14 05:00:03,317 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 05:00:03,330 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 05:00:03,334 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 05:00:03,335 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 05:00:03,336 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 05:00:03,336 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i [2019-01-14 05:00:03,391 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8de2c16fa/93394e85792e45479650357e8e3ca5ef/FLAGad322be06 [2019-01-14 05:00:03,888 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 05:00:03,889 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i [2019-01-14 05:00:03,912 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8de2c16fa/93394e85792e45479650357e8e3ca5ef/FLAGad322be06 [2019-01-14 05:00:04,189 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8de2c16fa/93394e85792e45479650357e8e3ca5ef [2019-01-14 05:00:04,194 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 05:00:04,195 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 05:00:04,197 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 05:00:04,197 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 05:00:04,200 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 05:00:04,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 05:00:04" (1/1) ... [2019-01-14 05:00:04,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3015b02f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:00:04, skipping insertion in model container [2019-01-14 05:00:04,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 05:00:04" (1/1) ... [2019-01-14 05:00:04,212 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 05:00:04,277 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 05:00:04,732 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 05:00:04,760 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 05:00:04,915 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 05:00:05,009 INFO L195 MainTranslator]: Completed translation [2019-01-14 05:00:05,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:00:05 WrapperNode [2019-01-14 05:00:05,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 05:00:05,011 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 05:00:05,011 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 05:00:05,011 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 05:00:05,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:00:05" (1/1) ... [2019-01-14 05:00:05,045 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:00:05" (1/1) ... [2019-01-14 05:00:05,077 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 05:00:05,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 05:00:05,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 05:00:05,077 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 05:00:05,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:00:05" (1/1) ... [2019-01-14 05:00:05,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:00:05" (1/1) ... [2019-01-14 05:00:05,090 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:00:05" (1/1) ... [2019-01-14 05:00:05,090 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:00:05" (1/1) ... [2019-01-14 05:00:05,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:00:05" (1/1) ... [2019-01-14 05:00:05,113 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:00:05" (1/1) ... [2019-01-14 05:00:05,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:00:05" (1/1) ... [2019-01-14 05:00:05,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 05:00:05,118 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 05:00:05,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 05:00:05,119 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 05:00:05,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:00:05" (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-14 05:00:05,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 05:00:05,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 05:00:05,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 05:00:05,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 05:00:05,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 05:00:05,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-14 05:00:05,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 05:00:05,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 05:00:05,596 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 05:00:05,596 INFO L286 CfgBuilder]: Removed 12 assue(true) statements. [2019-01-14 05:00:05,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 05:00:05 BoogieIcfgContainer [2019-01-14 05:00:05,598 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 05:00:05,599 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 05:00:05,599 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 05:00:05,602 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 05:00:05,603 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 05:00:05,603 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 05:00:04" (1/3) ... [2019-01-14 05:00:05,604 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53c3b001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 05:00:05, skipping insertion in model container [2019-01-14 05:00:05,604 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 05:00:05,604 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:00:05" (2/3) ... [2019-01-14 05:00:05,605 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53c3b001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 05:00:05, skipping insertion in model container [2019-01-14 05:00:05,605 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 05:00:05,605 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 05:00:05" (3/3) ... [2019-01-14 05:00:05,606 INFO L375 chiAutomizerObserver]: Analyzing ICFG memleaks_test18_true-valid-memsafety_true-termination.i [2019-01-14 05:00:05,658 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 05:00:05,658 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 05:00:05,658 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 05:00:05,659 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 05:00:05,659 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 05:00:05,659 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 05:00:05,659 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 05:00:05,659 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 05:00:05,659 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 05:00:05,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-01-14 05:00:05,699 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-14 05:00:05,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 05:00:05,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 05:00:05,708 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 05:00:05,708 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 05:00:05,708 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 05:00:05,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-01-14 05:00:05,710 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-14 05:00:05,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 05:00:05,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 05:00:05,711 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 05:00:05,711 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 05:00:05,716 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 9#L-1true havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 16#L1073true assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 11#L1076true entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset; 5#L1441true assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 4#L1445-3true [2019-01-14 05:00:05,716 INFO L796 eck$LassoCheckResult]: Loop: 4#L1445-3true assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 18#L1073-1true assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 12#L1076-1true entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 15#L1447true assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 3#L1445-2true entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 4#L1445-3true [2019-01-14 05:00:05,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 05:00:05,722 INFO L82 PathProgramCache]: Analyzing trace with hash 28695751, now seen corresponding path program 1 times [2019-01-14 05:00:05,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 05:00:05,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 05:00:05,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:00:05,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 05:00:05,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:00:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 05:00:05,917 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-14 05:00:05,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 05:00:05,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 05:00:05,924 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 05:00:05,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 05:00:05,925 INFO L82 PathProgramCache]: Analyzing trace with hash 47811737, now seen corresponding path program 1 times [2019-01-14 05:00:05,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 05:00:05,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 05:00:05,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:00:05,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 05:00:05,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:00:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:00:05,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:00:06,822 WARN L181 SmtUtils]: Spent 828.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-01-14 05:00:07,040 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-01-14 05:00:07,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 05:00:07,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 05:00:07,057 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 4 states. [2019-01-14 05:00:07,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 05:00:07,234 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2019-01-14 05:00:07,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 05:00:07,239 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2019-01-14 05:00:07,241 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-01-14 05:00:07,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 20 states and 25 transitions. [2019-01-14 05:00:07,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-14 05:00:07,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-14 05:00:07,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2019-01-14 05:00:07,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 05:00:07,250 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-01-14 05:00:07,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2019-01-14 05:00:07,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2019-01-14 05:00:07,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 05:00:07,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2019-01-14 05:00:07,282 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-01-14 05:00:07,282 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-01-14 05:00:07,282 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 05:00:07,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2019-01-14 05:00:07,283 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-14 05:00:07,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 05:00:07,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 05:00:07,284 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 05:00:07,284 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 05:00:07,286 INFO L794 eck$LassoCheckResult]: Stem: 72#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 67#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 68#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 69#L1076 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset; 64#L1441 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 61#L1445-3 [2019-01-14 05:00:07,286 INFO L796 eck$LassoCheckResult]: Loop: 61#L1445-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 63#L1073-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 70#L1076-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 71#L1447 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 60#L1445-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 61#L1445-3 [2019-01-14 05:00:07,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 05:00:07,286 INFO L82 PathProgramCache]: Analyzing trace with hash 28693829, now seen corresponding path program 1 times [2019-01-14 05:00:07,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 05:00:07,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 05:00:07,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:00:07,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 05:00:07,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:00:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:00:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:00:07,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 05:00:07,320 INFO L82 PathProgramCache]: Analyzing trace with hash 47811737, now seen corresponding path program 2 times [2019-01-14 05:00:07,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 05:00:07,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 05:00:07,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:00:07,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 05:00:07,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:00:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:00:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:00:07,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 05:00:07,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1232444971, now seen corresponding path program 1 times [2019-01-14 05:00:07,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 05:00:07,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 05:00:07,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:00:07,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 05:00:07,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:00:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:00:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:00:07,999 WARN L181 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-01-14 05:00:08,378 WARN L181 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-01-14 05:00:08,558 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-01-14 05:00:08,571 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 05:00:08,573 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 05:00:08,573 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 05:00:08,573 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 05:00:08,573 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 05:00:08,573 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 05:00:08,574 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 05:00:08,574 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 05:00:08,574 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2019-01-14 05:00:08,574 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 05:00:08,574 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 05:00:08,601 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-14 05:00:08,610 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-14 05:00:08,615 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-14 05:00:08,637 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-14 05:00:08,922 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-01-14 05:00:09,038 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-14 05:00:09,045 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-14 05:00:09,048 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-14 05:00:09,080 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-14 05:00:09,083 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-14 05:00:09,086 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-14 05:00:09,096 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-14 05:00:09,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:00:09,106 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-14 05:00:09,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-14 05:00:09,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:00:09,115 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-14 05:00:09,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-14 05:00:09,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-14 05:00:09,828 WARN L181 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-01-14 05:00:10,104 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 05:00:10,109 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 05:00:10,112 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-14 05:00:10,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:00:10,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:00:10,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:00:10,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:00:10,118 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 05:00:10,118 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 05:00:10,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:00:10,126 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-14 05:00:10,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:00:10,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:00:10,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:00:10,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:00:10,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:00:10,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:00:10,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:00:10,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:00:10,132 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-14 05:00:10,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:00:10,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:00:10,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:00:10,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:00:10,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:00:10,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:00:10,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:00:10,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:00:10,139 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-14 05:00:10,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:00:10,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:00:10,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:00:10,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:00:10,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:00:10,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:00:10,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:00:10,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:00:10,143 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-14 05:00:10,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:00:10,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:00:10,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:00:10,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:00:10,150 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 05:00:10,150 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 05:00:10,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:00:10,169 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-14 05:00:10,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:00:10,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:00:10,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:00:10,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:00:10,180 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 05:00:10,180 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 05:00:10,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:00:10,196 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-14 05:00:10,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:00:10,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:00:10,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:00:10,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:00:10,202 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 05:00:10,202 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 05:00:10,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:00:10,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-14 05:00:10,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:00:10,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:00:10,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:00:10,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:00:10,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:00:10,227 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:00:10,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:00:10,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:00:10,228 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-14 05:00:10,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:00:10,229 INFO L205 nArgumentSynthesizer]: 3 stem disjuncts [2019-01-14 05:00:10,229 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 05:00:10,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:00:10,259 INFO L402 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2019-01-14 05:00:10,262 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 05:00:10,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:00:10,409 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-14 05:00:10,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:00:10,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:00:10,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:00:10,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:00:10,416 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 05:00:10,416 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 05:00:10,497 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 05:00:10,558 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 05:00:10,559 INFO L444 ModelExtractionUtils]: 35 out of 43 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-14 05:00:10,561 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 05:00:10,563 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 05:00:10,563 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 05:00:10,564 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~len~0, ULTIMATE.start_entry_point_~i~0) = 1*ULTIMATE.start_entry_point_~len~0 - 1*ULTIMATE.start_entry_point_~i~0 Supporting invariants [] [2019-01-14 05:00:10,663 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-01-14 05:00:10,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 05:00:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 05:00:10,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 05:00:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 05:00:10,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 05:00:10,825 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-14 05:00:10,829 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 05:00:10,829 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-14 05:00:10,917 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 27 states and 36 transitions. Complement of second has 6 states. [2019-01-14 05:00:10,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 05:00:10,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 05:00:10,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-01-14 05:00:10,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 5 letters. [2019-01-14 05:00:10,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 05:00:10,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 10 letters. Loop has 5 letters. [2019-01-14 05:00:10,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 05:00:10,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 10 letters. [2019-01-14 05:00:10,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 05:00:10,923 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2019-01-14 05:00:10,926 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 05:00:10,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 20 states and 26 transitions. [2019-01-14 05:00:10,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-14 05:00:10,927 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-14 05:00:10,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2019-01-14 05:00:10,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 05:00:10,928 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-01-14 05:00:10,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2019-01-14 05:00:10,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-01-14 05:00:10,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 05:00:10,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-01-14 05:00:10,930 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-01-14 05:00:10,930 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-01-14 05:00:10,930 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 05:00:10,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-01-14 05:00:10,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 05:00:10,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 05:00:10,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 05:00:10,932 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 05:00:10,932 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 05:00:10,932 INFO L794 eck$LassoCheckResult]: Stem: 189#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 182#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 183#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 184#L1076 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset; 179#L1441 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 175#L1445-3 assume !(entry_point_~i~0 < entry_point_~len~0); 176#L1450 entry_point_~j~0 := entry_point_~i~0 - 1; 181#L1452-3 [2019-01-14 05:00:10,932 INFO L796 eck$LassoCheckResult]: Loop: 181#L1452-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 180#L1452-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 181#L1452-3 [2019-01-14 05:00:10,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 05:00:10,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1804966489, now seen corresponding path program 1 times [2019-01-14 05:00:10,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 05:00:10,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 05:00:10,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:00:10,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 05:00:10,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:00:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 05:00:11,022 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-14 05:00:11,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 05:00:11,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 05:00:11,023 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 05:00:11,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 05:00:11,024 INFO L82 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 1 times [2019-01-14 05:00:11,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 05:00:11,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 05:00:11,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:00:11,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 05:00:11,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:00:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:00:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:00:11,226 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-01-14 05:00:11,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 05:00:11,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 05:00:11,227 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-01-14 05:00:11,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 05:00:11,257 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2019-01-14 05:00:11,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 05:00:11,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2019-01-14 05:00:11,260 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 05:00:11,261 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 34 transitions. [2019-01-14 05:00:11,261 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-14 05:00:11,262 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-01-14 05:00:11,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2019-01-14 05:00:11,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 05:00:11,262 INFO L706 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-01-14 05:00:11,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2019-01-14 05:00:11,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2019-01-14 05:00:11,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 05:00:11,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2019-01-14 05:00:11,265 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-01-14 05:00:11,265 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-01-14 05:00:11,265 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 05:00:11,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2019-01-14 05:00:11,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 05:00:11,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 05:00:11,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 05:00:11,266 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 05:00:11,266 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 05:00:11,267 INFO L794 eck$LassoCheckResult]: Stem: 240#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 233#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 234#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 235#L1076 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset; 230#L1441 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 226#L1445-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 228#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 236#L1076-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 237#L1447 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 229#L1450 entry_point_~j~0 := entry_point_~i~0 - 1; 231#L1452-3 [2019-01-14 05:00:11,267 INFO L796 eck$LassoCheckResult]: Loop: 231#L1452-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 232#L1452-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 231#L1452-3 [2019-01-14 05:00:11,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 05:00:11,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1232385447, now seen corresponding path program 1 times [2019-01-14 05:00:11,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 05:00:11,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 05:00:11,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:00:11,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 05:00:11,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:00:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:00:11,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:00:11,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 05:00:11,284 INFO L82 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 2 times [2019-01-14 05:00:11,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 05:00:11,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 05:00:11,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:00:11,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 05:00:11,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:00:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:00:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:00:11,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 05:00:11,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1088560603, now seen corresponding path program 1 times [2019-01-14 05:00:11,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 05:00:11,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 05:00:11,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:00:11,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 05:00:11,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:00:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 05:00:11,432 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-14 05:00:11,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 05:00:11,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 05:00:11,536 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-01-14 05:00:11,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 05:00:11,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 05:00:11,554 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-01-14 05:00:11,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 05:00:11,607 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2019-01-14 05:00:11,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 05:00:11,608 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2019-01-14 05:00:11,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 05:00:11,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 21 states and 26 transitions. [2019-01-14 05:00:11,611 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-14 05:00:11,611 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-01-14 05:00:11,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2019-01-14 05:00:11,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 05:00:11,611 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-01-14 05:00:11,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2019-01-14 05:00:11,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2019-01-14 05:00:11,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 05:00:11,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-01-14 05:00:11,614 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-01-14 05:00:11,614 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-01-14 05:00:11,614 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 05:00:11,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2019-01-14 05:00:11,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 05:00:11,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 05:00:11,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 05:00:11,616 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 05:00:11,616 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 05:00:11,616 INFO L794 eck$LassoCheckResult]: Stem: 294#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 287#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 288#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 289#L1076 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset; 284#L1441 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 280#L1445-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 281#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 292#L1076-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 293#L1447 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 278#L1445-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 279#L1445-3 assume !(entry_point_~i~0 < entry_point_~len~0); 282#L1450 entry_point_~j~0 := entry_point_~i~0 - 1; 285#L1452-3 [2019-01-14 05:00:11,616 INFO L796 eck$LassoCheckResult]: Loop: 285#L1452-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 286#L1452-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 285#L1452-3 [2019-01-14 05:00:11,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 05:00:11,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1088615463, now seen corresponding path program 1 times [2019-01-14 05:00:11,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 05:00:11,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 05:00:11,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:00:11,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 05:00:11,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:00:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 05:00:11,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 05:00:11,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 05:00:11,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 05:00:11,707 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 05:00:11,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 05:00:11,708 INFO L82 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 3 times [2019-01-14 05:00:11,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 05:00:11,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 05:00:11,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:00:11,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 05:00:11,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:00:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:00:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:00:11,910 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-01-14 05:00:11,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 05:00:11,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 05:00:11,945 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-01-14 05:00:12,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 05:00:12,046 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-01-14 05:00:12,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 05:00:12,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 30 transitions. [2019-01-14 05:00:12,049 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-01-14 05:00:12,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 28 transitions. [2019-01-14 05:00:12,051 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-14 05:00:12,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-14 05:00:12,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 28 transitions. [2019-01-14 05:00:12,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 05:00:12,052 INFO L706 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-01-14 05:00:12,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 28 transitions. [2019-01-14 05:00:12,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2019-01-14 05:00:12,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 05:00:12,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-01-14 05:00:12,055 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-01-14 05:00:12,055 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-01-14 05:00:12,056 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 05:00:12,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-01-14 05:00:12,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 05:00:12,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 05:00:12,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 05:00:12,058 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 05:00:12,058 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 05:00:12,058 INFO L794 eck$LassoCheckResult]: Stem: 347#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 340#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 341#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 342#L1076 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset; 337#L1441 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 333#L1445-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 334#L1073-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 345#L1076-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 346#L1447 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 331#L1445-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 332#L1445-3 assume !(entry_point_~i~0 < entry_point_~len~0); 335#L1450 entry_point_~j~0 := entry_point_~i~0 - 1; 339#L1452-3 [2019-01-14 05:00:12,058 INFO L796 eck$LassoCheckResult]: Loop: 339#L1452-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 338#L1452-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 339#L1452-3 [2019-01-14 05:00:12,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 05:00:12,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1031357161, now seen corresponding path program 1 times [2019-01-14 05:00:12,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 05:00:12,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 05:00:12,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:00:12,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 05:00:12,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:00:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 05:00:12,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 05:00:12,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 05:00:12,124 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 05:00:12,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 05:00:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 05:00:12,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 05:00:12,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 05:00:12,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 05:00:12,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-01-14 05:00:12,343 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 05:00:12,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 05:00:12,343 INFO L82 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 4 times [2019-01-14 05:00:12,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 05:00:12,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 05:00:12,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:00:12,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 05:00:12,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:00:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:00:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:00:12,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 05:00:12,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-14 05:00:12,456 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 7 states. [2019-01-14 05:00:12,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 05:00:12,535 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2019-01-14 05:00:12,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 05:00:12,536 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2019-01-14 05:00:12,538 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 05:00:12,539 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 37 transitions. [2019-01-14 05:00:12,539 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-14 05:00:12,539 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-01-14 05:00:12,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 37 transitions. [2019-01-14 05:00:12,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 05:00:12,540 INFO L706 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-01-14 05:00:12,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 37 transitions. [2019-01-14 05:00:12,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 22. [2019-01-14 05:00:12,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-14 05:00:12,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-01-14 05:00:12,545 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-01-14 05:00:12,545 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-01-14 05:00:12,545 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 05:00:12,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2019-01-14 05:00:12,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 05:00:12,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 05:00:12,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 05:00:12,548 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 05:00:12,549 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 05:00:12,549 INFO L794 eck$LassoCheckResult]: Stem: 440#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 433#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 434#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 435#L1076 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset; 429#L1441 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 425#L1445-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 426#L1073-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 444#L1076-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 441#L1447 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 423#L1445-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 424#L1445-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 427#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 436#L1076-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 437#L1447 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 430#L1450 entry_point_~j~0 := entry_point_~i~0 - 1; 431#L1452-3 [2019-01-14 05:00:12,549 INFO L796 eck$LassoCheckResult]: Loop: 431#L1452-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 432#L1452-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 431#L1452-3 [2019-01-14 05:00:12,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 05:00:12,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1033365559, now seen corresponding path program 1 times [2019-01-14 05:00:12,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 05:00:12,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 05:00:12,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:00:12,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 05:00:12,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:00:12,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:00:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:00:12,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 05:00:12,577 INFO L82 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 5 times [2019-01-14 05:00:12,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 05:00:12,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 05:00:12,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:00:12,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 05:00:12,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:00:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:00:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:00:12,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 05:00:12,586 INFO L82 PathProgramCache]: Analyzing trace with hash -926855349, now seen corresponding path program 1 times [2019-01-14 05:00:12,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 05:00:12,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 05:00:12,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:00:12,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 05:00:12,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 05:00:12,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:00:12,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 05:00:12,776 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-01-14 05:00:12,910 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-01-14 05:00:13,556 WARN L181 SmtUtils]: Spent 640.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 145 [2019-01-14 05:00:13,735 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-14 05:00:13,738 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 05:00:13,738 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 05:00:13,738 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 05:00:13,738 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 05:00:13,738 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 05:00:13,739 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 05:00:13,739 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 05:00:13,739 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 05:00:13,739 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_true-valid-memsafety_true-termination.i_Iteration7_Lasso [2019-01-14 05:00:13,739 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 05:00:13,739 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 05:00:13,746 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-14 05:00:13,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:00:13,772 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-14 05:00:13,774 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-14 05:00:13,776 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-14 05:00:13,781 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-14 05:00:13,783 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-14 05:00:13,784 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-14 05:00:13,785 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-14 05:00:13,787 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-14 05:00:13,790 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-14 05:00:13,792 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-14 05:00:13,793 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-14 05:00:13,796 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-14 05:00:14,031 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-01-14 05:00:14,066 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-14 05:00:14,072 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-14 05:00:14,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 05:00:14,078 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-14 05:00:14,082 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-14 05:00:14,084 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-14 05:00:14,088 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-14 05:00:14,094 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-14 05:00:14,395 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-01-14 05:00:14,836 WARN L181 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-01-14 05:00:14,869 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 05:00:14,869 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 05:00:14,870 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-14 05:00:14,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:00:14,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:00:14,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:00:14,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:00:14,872 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 05:00:14,872 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 05:00:14,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:00:14,875 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-14 05:00:14,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:00:14,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:00:14,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:00:14,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:00:14,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:00:14,876 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:00:14,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:00:14,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:00:14,877 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-14 05:00:14,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:00:14,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:00:14,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:00:14,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:00:14,879 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 05:00:14,879 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 05:00:14,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:00:14,880 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-14 05:00:14,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:00:14,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:00:14,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:00:14,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:00:14,882 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 05:00:14,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 05:00:14,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:00:14,884 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-14 05:00:14,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:00:14,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:00:14,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:00:14,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:00:14,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:00:14,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:00:14,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:00:14,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:00:14,886 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-14 05:00:14,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:00:14,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:00:14,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:00:14,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:00:14,888 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 05:00:14,888 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 05:00:14,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:00:14,891 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-14 05:00:14,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:00:14,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:00:14,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:00:14,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:00:14,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:00:14,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:00:14,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:00:14,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:00:14,894 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-14 05:00:14,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:00:14,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:00:14,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:00:14,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:00:14,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:00:14,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:00:14,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:00:14,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:00:14,897 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-14 05:00:14,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:00:14,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:00:14,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:00:14,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:00:14,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:00:14,900 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:00:14,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:00:14,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:00:14,901 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-14 05:00:14,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:00:14,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:00:14,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:00:14,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:00:14,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:00:14,902 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:00:14,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:00:14,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:00:14,903 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-14 05:00:14,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:00:14,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:00:14,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:00:14,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:00:14,905 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 05:00:14,905 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 05:00:14,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:00:14,907 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-14 05:00:14,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:00:14,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:00:14,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:00:14,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:00:14,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:00:14,909 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:00:14,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:00:14,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:00:14,910 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-14 05:00:14,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:00:14,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:00:14,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:00:14,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:00:14,911 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 05:00:14,911 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 05:00:14,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:00:14,913 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-14 05:00:14,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:00:14,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 05:00:14,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:00:14,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:00:14,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:00:14,914 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 05:00:14,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 05:00:14,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:00:14,922 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-14 05:00:14,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:00:14,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:00:14,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:00:14,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:00:14,925 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 05:00:14,925 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 05:00:14,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:00:14,927 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-14 05:00:14,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:00:14,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:00:14,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:00:14,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:00:14,929 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 05:00:14,929 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 05:00:14,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 05:00:14,933 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-14 05:00:14,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 05:00:14,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 05:00:14,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 05:00:14,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 05:00:14,942 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 05:00:14,942 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 05:00:14,964 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 05:00:14,987 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-01-14 05:00:14,988 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 05:00:14,988 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 05:00:14,989 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 05:00:14,989 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 05:00:14,990 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_entry_point_~array~0.base)_2, ULTIMATE.start_entry_point_~j~0) = 1*v_rep(select #length ULTIMATE.start_entry_point_~array~0.base)_2 + 8*ULTIMATE.start_entry_point_~j~0 Supporting invariants [] [2019-01-14 05:00:15,174 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-01-14 05:00:15,185 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 05:00:15,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 05:00:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 05:00:15,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 05:00:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 05:00:15,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 05:00:15,535 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-14 05:00:15,536 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 05:00:15,536 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-14 05:00:15,558 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 24 states and 29 transitions. Complement of second has 4 states. [2019-01-14 05:00:15,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 05:00:15,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 05:00:15,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-01-14 05:00:15,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2019-01-14 05:00:15,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 05:00:15,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2019-01-14 05:00:15,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 05:00:15,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2019-01-14 05:00:15,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 05:00:15,562 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2019-01-14 05:00:15,563 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 05:00:15,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2019-01-14 05:00:15,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 05:00:15,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 05:00:15,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 05:00:15,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 05:00:15,563 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 05:00:15,563 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 05:00:15,563 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 05:00:15,563 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 05:00:15,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 05:00:15,564 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 05:00:15,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 05:00:15,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 05:00:15 BoogieIcfgContainer [2019-01-14 05:00:15,571 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 05:00:15,571 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 05:00:15,571 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 05:00:15,571 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 05:00:15,572 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 05:00:05" (3/4) ... [2019-01-14 05:00:15,576 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 05:00:15,576 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 05:00:15,577 INFO L168 Benchmark]: Toolchain (without parser) took 11382.23 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 321.4 MB). Free memory was 946.0 MB in the beginning and 1.2 GB in the end (delta: -302.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-01-14 05:00:15,578 INFO L168 Benchmark]: CDTParser took 0.16 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-14 05:00:15,579 INFO L168 Benchmark]: CACSL2BoogieTranslator took 814.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -163.5 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2019-01-14 05:00:15,580 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.87 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-14 05:00:15,580 INFO L168 Benchmark]: Boogie Preprocessor took 40.80 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-14 05:00:15,581 INFO L168 Benchmark]: RCFGBuilder took 479.66 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: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2019-01-14 05:00:15,581 INFO L168 Benchmark]: BuchiAutomizer took 9972.38 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -164.4 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2019-01-14 05:00:15,582 INFO L168 Benchmark]: Witness Printer took 4.85 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 05:00:15,587 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.16 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 814.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -163.5 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.87 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 40.80 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 479.66 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: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9972.38 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -164.4 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.85 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (5 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function len + -1 * i and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[array] + 8 * j and consists of 3 locations. 5 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.9s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 8.6s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 42 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 22 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 115 SDtfs, 128 SDslu, 119 SDs, 0 SdLazy, 98 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU4 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital246 mio100 ax112 hnf101 lsp82 ukn55 mio100 lsp53 div100 bol100 ite100 ukn100 eq188 hnf89 smp100 dnf239 smp66 tf100 neg94 sie124 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 180ms VariablesStem: 7 VariablesLoop: 8 DisjunctsStem: 3 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 24 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...