./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/ldv-memsafety/memleaks_test18_1_false-valid-memtrack_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e 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_1_false-valid-memtrack_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 1e7b1c8d88255aaa07a4a2fabadf999511fb9c76 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-29 00:12:14,154 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:12:14,156 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:12:14,175 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:12:14,176 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:12:14,178 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:12:14,179 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:12:14,182 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:12:14,184 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:12:14,188 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:12:14,191 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:12:14,192 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:12:14,193 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:12:14,194 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:12:14,195 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:12:14,199 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:12:14,200 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:12:14,211 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:12:14,213 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:12:14,219 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:12:14,223 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:12:14,224 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:12:14,229 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:12:14,230 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:12:14,230 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:12:14,232 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:12:14,233 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:12:14,233 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:12:14,237 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:12:14,238 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:12:14,238 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:12:14,243 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:12:14,243 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:12:14,243 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:12:14,244 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:12:14,246 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:12:14,248 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:12:14,269 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:12:14,270 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:12:14,271 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:12:14,271 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:12:14,271 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:12:14,272 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:12:14,272 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:12:14,272 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:12:14,272 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:12:14,272 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:12:14,272 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:12:14,273 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:12:14,273 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:12:14,273 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:12:14,273 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:12:14,273 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:12:14,273 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:12:14,274 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:12:14,274 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:12:14,274 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:12:14,274 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:12:14,274 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:12:14,274 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:12:14,275 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:12:14,275 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:12:14,275 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:12:14,275 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:12:14,275 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:12:14,276 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:12:14,276 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:12:14,276 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:12:14,277 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:12:14,277 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 -> 1e7b1c8d88255aaa07a4a2fabadf999511fb9c76 [2018-11-29 00:12:14,320 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:12:14,342 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:12:14,346 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:12:14,351 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:12:14,352 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:12:14,353 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-memsafety/memleaks_test18_1_false-valid-memtrack_true-termination.i [2018-11-29 00:12:14,433 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18b96a144/1fe38fa19f864bb1b7a74782a30226f2/FLAGa082b6511 [2018-11-29 00:12:15,008 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:12:15,008 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety/memleaks_test18_1_false-valid-memtrack_true-termination.i [2018-11-29 00:12:15,025 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18b96a144/1fe38fa19f864bb1b7a74782a30226f2/FLAGa082b6511 [2018-11-29 00:12:15,279 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18b96a144/1fe38fa19f864bb1b7a74782a30226f2 [2018-11-29 00:12:15,283 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:12:15,285 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:12:15,287 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:12:15,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:12:15,292 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:12:15,293 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:12:15" (1/1) ... [2018-11-29 00:12:15,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4572ea82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:15, skipping insertion in model container [2018-11-29 00:12:15,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:12:15" (1/1) ... [2018-11-29 00:12:15,307 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:12:15,389 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:12:15,925 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:12:15,955 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:12:16,115 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:12:16,216 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:12:16,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:16 WrapperNode [2018-11-29 00:12:16,217 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:12:16,218 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:12:16,218 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:12:16,218 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:12:16,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:16" (1/1) ... [2018-11-29 00:12:16,260 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:16" (1/1) ... [2018-11-29 00:12:16,300 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:12:16,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:12:16,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:12:16,301 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:12:16,309 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:16" (1/1) ... [2018-11-29 00:12:16,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:16" (1/1) ... [2018-11-29 00:12:16,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:16" (1/1) ... [2018-11-29 00:12:16,313 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:16" (1/1) ... [2018-11-29 00:12:16,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:16" (1/1) ... [2018-11-29 00:12:16,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:16" (1/1) ... [2018-11-29 00:12:16,338 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:16" (1/1) ... [2018-11-29 00:12:16,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:12:16,350 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:12:16,350 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:12:16,350 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:12:16,351 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:16" (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 [2018-11-29 00:12:16,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-29 00:12:16,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-29 00:12:16,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-29 00:12:16,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-29 00:12:16,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-29 00:12:16,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:12:16,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:12:16,899 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:12:16,899 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-11-29 00:12:16,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:12:16 BoogieIcfgContainer [2018-11-29 00:12:16,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:12:16,900 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:12:16,901 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:12:16,904 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:12:16,906 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:12:16,906 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:12:15" (1/3) ... [2018-11-29 00:12:16,907 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@784cfd2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:12:16, skipping insertion in model container [2018-11-29 00:12:16,907 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:12:16,907 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:16" (2/3) ... [2018-11-29 00:12:16,908 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@784cfd2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:12:16, skipping insertion in model container [2018-11-29 00:12:16,908 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:12:16,908 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:12:16" (3/3) ... [2018-11-29 00:12:16,910 INFO L375 chiAutomizerObserver]: Analyzing ICFG memleaks_test18_1_false-valid-memtrack_true-termination.i [2018-11-29 00:12:16,965 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:12:16,966 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:12:16,966 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:12:16,966 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:12:16,966 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:12:16,966 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:12:16,967 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:12:16,967 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:12:16,967 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:12:16,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-29 00:12:17,000 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-29 00:12:17,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:12:17,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:12:17,007 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:12:17,007 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-29 00:12:17,008 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:12:17,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-29 00:12:17,009 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-29 00:12:17,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:12:17,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:12:17,010 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:12:17,010 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-29 00:12:17,016 INFO L794 eck$LassoCheckResult]: Stem: 12#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.alloc(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); 8#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_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;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; 15#L1073true assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 10#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;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 3#L1444true assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 5#L1445-3true [2018-11-29 00:12:17,017 INFO L796 eck$LassoCheckResult]: Loop: 5#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; 17#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.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 11#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; 14#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); 4#L1445-2true entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 5#L1445-3true [2018-11-29 00:12:17,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:17,023 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-11-29 00:12:17,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:12:17,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:12:17,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:17,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:12:17,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:12:17,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:12:17,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:12:17,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:12:17,269 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:12:17,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:17,270 INFO L82 PathProgramCache]: Analyzing trace with hash 49720347, now seen corresponding path program 1 times [2018-11-29 00:12:17,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:12:17,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:12:17,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:17,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:12:17,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:17,947 WARN L180 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2018-11-29 00:12:18,169 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-11-29 00:12:18,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-29 00:12:18,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-29 00:12:18,189 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 4 states. [2018-11-29 00:12:18,428 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-29 00:12:18,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:12:18,621 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-11-29 00:12:18,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-29 00:12:18,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2018-11-29 00:12:18,627 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-29 00:12:18,632 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 20 states and 25 transitions. [2018-11-29 00:12:18,633 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-29 00:12:18,633 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-29 00:12:18,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2018-11-29 00:12:18,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:12:18,635 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-29 00:12:18,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2018-11-29 00:12:18,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2018-11-29 00:12:18,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-29 00:12:18,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-11-29 00:12:18,669 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-29 00:12:18,669 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-29 00:12:18,669 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:12:18,669 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2018-11-29 00:12:18,670 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-29 00:12:18,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:12:18,670 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:12:18,671 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:12:18,671 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-29 00:12:18,671 INFO L794 eck$LassoCheckResult]: Stem: 69#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.alloc(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); 64#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_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;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; 65#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 66#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;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 57#L1444 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 58#L1445-3 [2018-11-29 00:12:18,671 INFO L796 eck$LassoCheckResult]: Loop: 58#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; 61#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.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 67#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; 68#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); 59#L1445-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 58#L1445-3 [2018-11-29 00:12:18,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:18,672 INFO L82 PathProgramCache]: Analyzing trace with hash 28693831, now seen corresponding path program 1 times [2018-11-29 00:12:18,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:12:18,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:12:18,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:18,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:12:18,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:18,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:18,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:18,721 INFO L82 PathProgramCache]: Analyzing trace with hash 49720347, now seen corresponding path program 2 times [2018-11-29 00:12:18,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:12:18,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:12:18,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:18,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:12:18,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:18,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:18,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1173278059, now seen corresponding path program 1 times [2018-11-29 00:12:18,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:12:18,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:12:18,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:18,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:12:18,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:18,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:19,206 WARN L180 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2018-11-29 00:12:19,877 WARN L180 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2018-11-29 00:12:20,013 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-11-29 00:12:20,026 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:12:20,027 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:12:20,027 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:12:20,028 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:12:20,028 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:12:20,028 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:12:20,028 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:12:20,028 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:12:20,028 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_1_false-valid-memtrack_true-termination.i_Iteration2_Lasso [2018-11-29 00:12:20,029 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:12:20,029 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:12:20,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:20,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:20,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:20,409 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2018-11-29 00:12:20,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:20,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:20,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:20,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:20,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:20,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:20,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:20,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:20,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:20,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:20,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:20,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:20,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:20,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:20,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:20,760 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-29 00:12:21,376 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:12:21,383 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:12:21,386 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 [2018-11-29 00:12:21,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:21,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:21,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:21,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:21,394 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:21,394 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:21,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:21,400 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 [2018-11-29 00:12:21,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:21,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:21,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:21,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:21,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:21,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:21,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:21,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:21,404 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 [2018-11-29 00:12:21,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:21,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:21,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:21,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:21,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:21,406 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:21,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:21,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:21,408 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 [2018-11-29 00:12:21,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:21,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:21,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:21,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:21,421 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:21,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:21,595 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:12:21,653 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-29 00:12:21,653 INFO L444 ModelExtractionUtils]: 39 out of 43 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:12:21,657 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:12:21,660 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:12:21,660 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:12:21,661 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 [] [2018-11-29 00:12:21,733 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-11-29 00:12:21,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:21,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:12:21,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:12:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:12:21,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:12:21,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:12:21,859 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 [2018-11-29 00:12:21,860 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-29 00:12:21,942 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. [2018-11-29 00:12:21,943 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 [2018-11-29 00:12:21,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:12:21,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-29 00:12:21,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 5 letters. [2018-11-29 00:12:21,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:12:21,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 10 letters. Loop has 5 letters. [2018-11-29 00:12:21,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:12:21,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-29 00:12:21,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:12:21,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2018-11-29 00:12:21,951 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-29 00:12:21,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 20 states and 26 transitions. [2018-11-29 00:12:21,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-29 00:12:21,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-29 00:12:21,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2018-11-29 00:12:21,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:12:21,953 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-29 00:12:21,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2018-11-29 00:12:21,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-11-29 00:12:21,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-29 00:12:21,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2018-11-29 00:12:21,955 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-29 00:12:21,955 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-29 00:12:21,955 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:12:21,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2018-11-29 00:12:21,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-29 00:12:21,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:12:21,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:12:21,957 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:12:21,957 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:12:21,957 INFO L794 eck$LassoCheckResult]: Stem: 186#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.alloc(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); 179#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_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;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; 180#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 181#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;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 170#L1444 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 171#L1445-3 assume !(entry_point_~i~0 < entry_point_~len~0); 174#L1450 entry_point_~j~0 := entry_point_~i~0 - 1; 177#L1452-3 [2018-11-29 00:12:21,957 INFO L796 eck$LassoCheckResult]: Loop: 177#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; 178#L1452-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 177#L1452-3 [2018-11-29 00:12:21,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:21,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1804968475, now seen corresponding path program 1 times [2018-11-29 00:12:21,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:12:21,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:12:21,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:21,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:12:21,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:12:22,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:12:22,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:12:22,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-29 00:12:22,082 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:12:22,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:22,082 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 1 times [2018-11-29 00:12:22,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:12:22,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:12:22,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:22,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:12:22,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:22,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-29 00:12:22,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-29 00:12:22,162 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-29 00:12:22,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:12:22,192 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2018-11-29 00:12:22,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-29 00:12:22,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2018-11-29 00:12:22,195 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-29 00:12:22,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 34 transitions. [2018-11-29 00:12:22,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-29 00:12:22,197 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-29 00:12:22,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2018-11-29 00:12:22,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:12:22,197 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2018-11-29 00:12:22,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2018-11-29 00:12:22,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2018-11-29 00:12:22,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-29 00:12:22,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2018-11-29 00:12:22,200 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-29 00:12:22,200 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-29 00:12:22,200 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:12:22,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2018-11-29 00:12:22,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-29 00:12:22,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:12:22,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:12:22,202 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:12:22,202 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:12:22,202 INFO L794 eck$LassoCheckResult]: Stem: 237#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.alloc(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); 230#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_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;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; 231#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 232#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;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 221#L1444 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 222#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; 225#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 233#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; 234#L1447 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 227#L1450 entry_point_~j~0 := entry_point_~i~0 - 1; 228#L1452-3 [2018-11-29 00:12:22,202 INFO L796 eck$LassoCheckResult]: Loop: 228#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; 229#L1452-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 228#L1452-3 [2018-11-29 00:12:22,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:22,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1173218535, now seen corresponding path program 1 times [2018-11-29 00:12:22,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:12:22,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:12:22,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:22,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:12:22,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:22,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:22,224 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 2 times [2018-11-29 00:12:22,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:12:22,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:12:22,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:22,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:12:22,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:22,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:22,237 INFO L82 PathProgramCache]: Analyzing trace with hash 2113388251, now seen corresponding path program 1 times [2018-11-29 00:12:22,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:12:22,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:12:22,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:22,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:12:22,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:12:22,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:12:22,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:12:22,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-29 00:12:22,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-29 00:12:22,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-29 00:12:22,454 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-29 00:12:22,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:12:22,502 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2018-11-29 00:12:22,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-29 00:12:22,503 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2018-11-29 00:12:22,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-29 00:12:22,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 21 states and 26 transitions. [2018-11-29 00:12:22,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-29 00:12:22,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-29 00:12:22,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2018-11-29 00:12:22,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:12:22,508 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2018-11-29 00:12:22,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2018-11-29 00:12:22,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2018-11-29 00:12:22,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-29 00:12:22,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-11-29 00:12:22,510 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-29 00:12:22,510 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-29 00:12:22,510 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-29 00:12:22,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2018-11-29 00:12:22,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-29 00:12:22,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:12:22,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:12:22,511 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:12:22,512 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:12:22,512 INFO L794 eck$LassoCheckResult]: Stem: 291#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.alloc(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); 284#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_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;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; 285#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 286#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;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 275#L1444 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 276#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; 279#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 289#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; 290#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); 277#L1445-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 278#L1445-3 assume !(entry_point_~i~0 < entry_point_~len~0); 280#L1450 entry_point_~j~0 := entry_point_~i~0 - 1; 282#L1452-3 [2018-11-29 00:12:22,512 INFO L796 eck$LassoCheckResult]: Loop: 282#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; 283#L1452-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 282#L1452-3 [2018-11-29 00:12:22,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:22,512 INFO L82 PathProgramCache]: Analyzing trace with hash 2113443111, now seen corresponding path program 1 times [2018-11-29 00:12:22,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:12:22,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:12:22,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:22,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:12:22,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:12:22,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:12:22,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:12:22,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-29 00:12:22,644 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:12:22,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:22,644 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 3 times [2018-11-29 00:12:22,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:12:22,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:12:22,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:22,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:12:22,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:22,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-29 00:12:22,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-29 00:12:22,694 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-29 00:12:22,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:12:22,744 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-29 00:12:22,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-29 00:12:22,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 30 transitions. [2018-11-29 00:12:22,746 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-29 00:12:22,747 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 28 transitions. [2018-11-29 00:12:22,747 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-29 00:12:22,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-29 00:12:22,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 28 transitions. [2018-11-29 00:12:22,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:12:22,748 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-29 00:12:22,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 28 transitions. [2018-11-29 00:12:22,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2018-11-29 00:12:22,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-29 00:12:22,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-11-29 00:12:22,750 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-29 00:12:22,750 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-29 00:12:22,750 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-29 00:12:22,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2018-11-29 00:12:22,751 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-29 00:12:22,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:12:22,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:12:22,752 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:12:22,752 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:12:22,752 INFO L794 eck$LassoCheckResult]: Stem: 344#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.alloc(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); 337#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_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;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; 338#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 339#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;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 328#L1444 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 329#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; 332#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.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 342#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; 343#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); 330#L1445-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 331#L1445-3 assume !(entry_point_~i~0 < entry_point_~len~0); 333#L1450 entry_point_~j~0 := entry_point_~i~0 - 1; 335#L1452-3 [2018-11-29 00:12:22,752 INFO L796 eck$LassoCheckResult]: Loop: 335#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; 336#L1452-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 335#L1452-3 [2018-11-29 00:12:22,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:22,752 INFO L82 PathProgramCache]: Analyzing trace with hash 2056184809, now seen corresponding path program 1 times [2018-11-29 00:12:22,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:12:22,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:12:22,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:22,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:12:22,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:12:22,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:12:22,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:12:22,819 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 [2018-11-29 00:12:22,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:12:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:12:22,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:12:22,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:12:22,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:12:22,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-29 00:12:22,937 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:12:22,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:22,938 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 4 times [2018-11-29 00:12:22,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:12:22,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:12:22,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:22,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:12:22,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:23,124 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-29 00:12:23,311 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-29 00:12:23,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-29 00:12:23,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-29 00:12:23,312 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 7 states. [2018-11-29 00:12:23,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:12:23,442 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-11-29 00:12:23,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-29 00:12:23,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2018-11-29 00:12:23,445 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-29 00:12:23,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 37 transitions. [2018-11-29 00:12:23,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-29 00:12:23,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-29 00:12:23,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 37 transitions. [2018-11-29 00:12:23,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:12:23,446 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-29 00:12:23,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 37 transitions. [2018-11-29 00:12:23,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 22. [2018-11-29 00:12:23,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-29 00:12:23,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-11-29 00:12:23,449 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-29 00:12:23,449 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-29 00:12:23,449 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-29 00:12:23,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2018-11-29 00:12:23,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-29 00:12:23,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:12:23,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:12:23,451 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:12:23,451 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:12:23,451 INFO L794 eck$LassoCheckResult]: Stem: 438#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.alloc(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); 431#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_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;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; 432#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 433#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;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 420#L1444 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 421#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; 424#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.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 441#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; 440#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); 439#L1445-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 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; 427#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 434#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; 435#L1447 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 428#L1450 entry_point_~j~0 := entry_point_~i~0 - 1; 429#L1452-3 [2018-11-29 00:12:23,451 INFO L796 eck$LassoCheckResult]: Loop: 429#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; 430#L1452-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 429#L1452-3 [2018-11-29 00:12:23,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:23,451 INFO L82 PathProgramCache]: Analyzing trace with hash 979558027, now seen corresponding path program 1 times [2018-11-29 00:12:23,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:12:23,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:12:23,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:23,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:12:23,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:23,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:23,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:23,475 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 5 times [2018-11-29 00:12:23,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:12:23,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:12:23,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:23,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:12:23,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:23,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:23,482 INFO L82 PathProgramCache]: Analyzing trace with hash 757427661, now seen corresponding path program 1 times [2018-11-29 00:12:23,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:12:23,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:12:23,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:23,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:12:23,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:23,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:24,212 WARN L180 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 141 [2018-11-29 00:12:24,327 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-11-29 00:12:24,330 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:12:24,330 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:12:24,330 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:12:24,330 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:12:24,330 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:12:24,331 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:12:24,331 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:12:24,331 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:12:24,331 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_1_false-valid-memtrack_true-termination.i_Iteration7_Lasso [2018-11-29 00:12:24,331 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:12:24,331 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:12:24,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:24,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:24,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:24,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:24,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:24,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:24,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:24,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:24,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:24,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:24,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:24,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:24,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:24,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:24,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:24,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:24,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:24,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:24,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:24,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:24,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:24,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:25,123 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:12:25,123 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:12:25,124 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 [2018-11-29 00:12:25,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:25,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:25,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:25,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:25,129 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:25,131 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:25,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:25,137 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 [2018-11-29 00:12:25,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:25,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:25,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:25,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:25,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:25,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:25,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:25,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:25,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 [2018-11-29 00:12:25,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:25,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:25,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:25,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:25,152 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:25,153 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:25,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:25,157 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 [2018-11-29 00:12:25,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:25,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:25,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:25,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:25,163 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:25,163 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:25,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:25,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 [2018-11-29 00:12:25,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:25,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:25,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:25,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:25,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:25,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:25,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:25,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:25,174 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 [2018-11-29 00:12:25,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:25,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:25,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:25,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:25,180 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:25,180 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:25,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:25,194 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 [2018-11-29 00:12:25,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:25,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:25,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:25,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:25,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:25,198 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:25,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:25,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:25,200 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 [2018-11-29 00:12:25,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:25,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:25,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:25,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:25,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:25,204 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:25,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:25,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:25,210 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 [2018-11-29 00:12:25,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:25,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:25,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:25,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:25,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:25,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:25,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:25,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:25,216 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 [2018-11-29 00:12:25,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:25,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:25,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:25,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:25,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:25,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:25,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:25,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:25,225 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 [2018-11-29 00:12:25,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:25,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:25,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:25,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:25,227 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:25,227 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:25,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:25,235 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 [2018-11-29 00:12:25,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:25,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:25,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:25,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:25,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:25,240 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:25,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:25,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:25,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:12:25,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:25,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:25,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:25,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:25,250 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:25,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:25,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:25,252 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 [2018-11-29 00:12:25,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:25,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:25,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:25,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:25,258 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:25,258 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:25,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:25,265 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 [2018-11-29 00:12:25,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:25,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:25,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:25,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:25,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:25,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:25,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:25,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:25,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:12:25,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:25,274 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:12:25,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:25,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:25,277 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:12:25,278 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:25,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:25,283 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 [2018-11-29 00:12:25,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:25,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:25,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:25,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:25,288 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:25,288 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:25,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:25,293 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 [2018-11-29 00:12:25,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:25,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:25,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:25,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:25,296 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:25,296 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:25,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:25,307 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 [2018-11-29 00:12:25,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:25,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:25,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:25,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:25,313 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:25,313 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:25,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:25,320 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 [2018-11-29 00:12:25,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:25,327 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:12:25,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:25,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:25,328 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:12:25,329 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:25,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:25,331 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 [2018-11-29 00:12:25,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:25,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:25,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:25,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:25,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:25,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:25,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:25,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:25,334 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 [2018-11-29 00:12:25,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:25,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:25,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:25,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:25,336 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:25,336 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:25,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:25,339 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 [2018-11-29 00:12:25,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:25,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:25,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:25,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:25,342 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:25,346 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:25,362 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:12:25,381 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-29 00:12:25,385 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-29 00:12:25,386 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:12:25,388 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:12:25,389 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:12:25,389 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~j~0) = 2*ULTIMATE.start_entry_point_~j~0 + 1 Supporting invariants [] [2018-11-29 00:12:25,465 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-11-29 00:12:25,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:12:25,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:12:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:12:25,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:12:25,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:12:25,629 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 [2018-11-29 00:12:25,629 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-29 00:12:25,668 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. [2018-11-29 00:12:25,673 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 [2018-11-29 00:12:25,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:12:25,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-11-29 00:12:25,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2018-11-29 00:12:25,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:12:25,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2018-11-29 00:12:25,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:12:25,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-29 00:12:25,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:12:25,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2018-11-29 00:12:25,676 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:12:25,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2018-11-29 00:12:25,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:12:25,676 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:12:25,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:12:25,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:12:25,678 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:12:25,678 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:12:25,678 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:12:25,678 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-29 00:12:25,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-29 00:12:25,678 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:12:25,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-29 00:12:25,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:12:25 BoogieIcfgContainer [2018-11-29 00:12:25,687 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:12:25,687 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:12:25,687 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:12:25,687 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:12:25,689 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:12:16" (3/4) ... [2018-11-29 00:12:25,693 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-29 00:12:25,693 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:12:25,694 INFO L168 Benchmark]: Toolchain (without parser) took 10410.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.8 MB). Free memory was 940.6 MB in the beginning and 829.9 MB in the end (delta: 110.7 MB). Peak memory consumption was 322.5 MB. Max. memory is 11.5 GB. [2018-11-29 00:12:25,696 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:12:25,697 INFO L168 Benchmark]: CACSL2BoogieTranslator took 930.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -174.7 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. [2018-11-29 00:12:25,698 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-29 00:12:25,699 INFO L168 Benchmark]: Boogie Preprocessor took 48.74 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. [2018-11-29 00:12:25,700 INFO L168 Benchmark]: RCFGBuilder took 550.32 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: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-11-29 00:12:25,700 INFO L168 Benchmark]: BuchiAutomizer took 8786.21 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.8 MB). Free memory was 1.1 GB in the beginning and 829.9 MB in the end (delta: 261.0 MB). Peak memory consumption was 331.8 MB. Max. memory is 11.5 GB. [2018-11-29 00:12:25,701 INFO L168 Benchmark]: Witness Printer took 6.22 ms. Allocated memory is still 1.2 GB. Free memory is still 829.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:12:25,708 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 930.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -174.7 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.74 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 550.32 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: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8786.21 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.8 MB). Free memory was 1.1 GB in the beginning and 829.9 MB in the end (delta: 261.0 MB). Peak memory consumption was 331.8 MB. Max. memory is 11.5 GB. * Witness Printer took 6.22 ms. Allocated memory is still 1.2 GB. Free memory is still 829.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * 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 2 * j + 1 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 8.7s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 7.4s. Construction of modules took 0.5s. Büchi inclusion checks took 0.6s. 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: 113 SDtfs, 146 SDslu, 108 SDs, 0 SdLazy, 92 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU4 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital237 mio100 ax112 hnf101 lsp81 ukn54 mio100 lsp59 div100 bol100 ite100 ukn100 eq189 hnf90 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...