./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test18_1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test18_1.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 bb53649e57c73811eb036860baf1102917fa8259 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 03:27:17,282 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:27:17,284 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:27:17,302 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:27:17,302 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:27:17,304 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:27:17,306 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:27:17,316 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:27:17,321 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:27:17,325 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:27:17,326 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:27:17,328 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:27:17,328 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:27:17,331 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:27:17,333 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:27:17,334 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:27:17,336 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:27:17,337 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:27:17,339 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:27:17,343 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:27:17,348 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:27:17,351 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:27:17,353 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:27:17,354 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:27:17,356 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:27:17,357 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:27:17,357 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:27:17,358 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:27:17,359 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:27:17,360 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:27:17,360 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:27:17,361 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:27:17,362 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:27:17,362 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:27:17,364 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:27:17,364 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:27:17,365 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:27:17,365 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:27:17,365 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:27:17,366 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:27:17,367 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:27:17,368 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 03:27:17,407 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:27:17,410 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:27:17,411 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:27:17,412 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:27:17,412 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:27:17,412 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:27:17,412 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:27:17,413 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:27:17,413 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:27:17,413 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:27:17,413 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:27:17,413 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:27:17,414 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:27:17,414 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:27:17,414 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:27:17,414 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:27:17,414 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:27:17,415 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:27:17,415 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:27:17,415 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:27:17,416 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:27:17,416 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:27:17,416 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:27:17,416 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:27:17,417 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:27:17,417 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:27:17,417 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:27:17,417 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:27:17,417 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:27:17,418 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:27:17,418 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:27:17,418 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:27:17,420 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:27:17,421 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bb53649e57c73811eb036860baf1102917fa8259 [2020-07-29 03:27:17,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:27:17,737 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:27:17,741 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:27:17,743 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:27:17,743 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:27:17,744 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test18_1.i [2020-07-29 03:27:17,821 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9156f38f2/973ad76036b04f6b80e86d720d8f01b8/FLAG0a1fb0eb8 [2020-07-29 03:27:18,363 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:27:18,364 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test18_1.i [2020-07-29 03:27:18,380 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9156f38f2/973ad76036b04f6b80e86d720d8f01b8/FLAG0a1fb0eb8 [2020-07-29 03:27:18,584 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9156f38f2/973ad76036b04f6b80e86d720d8f01b8 [2020-07-29 03:27:18,588 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:27:18,591 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:27:18,592 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:27:18,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:27:18,596 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:27:18,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:27:18" (1/1) ... [2020-07-29 03:27:18,600 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e4d67f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:18, skipping insertion in model container [2020-07-29 03:27:18,601 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:27:18" (1/1) ... [2020-07-29 03:27:18,609 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:27:18,666 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:27:19,253 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:27:19,277 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:27:19,350 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:27:19,447 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:27:19,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:19 WrapperNode [2020-07-29 03:27:19,449 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:27:19,450 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:27:19,450 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:27:19,451 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:27:19,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:19" (1/1) ... [2020-07-29 03:27:19,501 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:19" (1/1) ... [2020-07-29 03:27:19,528 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:27:19,529 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:27:19,529 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:27:19,529 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:27:19,540 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:19" (1/1) ... [2020-07-29 03:27:19,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:19" (1/1) ... [2020-07-29 03:27:19,543 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:19" (1/1) ... [2020-07-29 03:27:19,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:19" (1/1) ... [2020-07-29 03:27:19,556 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:19" (1/1) ... [2020-07-29 03:27:19,561 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:19" (1/1) ... [2020-07-29 03:27:19,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:19" (1/1) ... [2020-07-29 03:27:19,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:27:19,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:27:19,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:27:19,567 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:27:19,568 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:19,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 03:27:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-29 03:27:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 03:27:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-29 03:27:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 03:27:19,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-07-29 03:27:19,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:27:19,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:27:20,066 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:27:20,066 INFO L295 CfgBuilder]: Removed 12 assume(true) statements. [2020-07-29 03:27:20,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:27:20 BoogieIcfgContainer [2020-07-29 03:27:20,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:27:20,070 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:27:20,070 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:27:20,074 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:27:20,075 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:27:20,075 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:27:18" (1/3) ... [2020-07-29 03:27:20,076 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43c3b773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:27:20, skipping insertion in model container [2020-07-29 03:27:20,076 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:27:20,077 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:19" (2/3) ... [2020-07-29 03:27:20,077 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43c3b773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:27:20, skipping insertion in model container [2020-07-29 03:27:20,077 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:27:20,078 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:27:20" (3/3) ... [2020-07-29 03:27:20,079 INFO L371 chiAutomizerObserver]: Analyzing ICFG memleaks_test18_1.i [2020-07-29 03:27:20,122 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:27:20,122 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:27:20,122 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:27:20,123 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:27:20,123 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:27:20,123 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:27:20,123 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:27:20,123 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:27:20,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-29 03:27:20,158 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 03:27:20,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:20,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:20,165 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 03:27:20,165 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 03:27:20,165 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:27:20,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-29 03:27:20,169 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 03:27:20,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:20,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:20,169 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 03:27:20,170 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 03:27:20,175 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 10#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; 4#L526true assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 16#L529true 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; 11#L766true assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 14#L767-3true [2020-07-29 03:27:20,175 INFO L796 eck$LassoCheckResult]: Loop: 14#L767-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; 6#L526-1true assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 17#L529-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; 9#L769true 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); 13#L767-2true entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 14#L767-3true [2020-07-29 03:27:20,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:20,181 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2020-07-29 03:27:20,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:20,191 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846650092] [2020-07-29 03:27:20,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:20,407 INFO L280 TraceCheckUtils]: 0: Hoare triple {19#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); {19#true} is VALID [2020-07-29 03:27:20,407 INFO L280 TraceCheckUtils]: 1: Hoare triple {19#true} 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; {19#true} is VALID [2020-07-29 03:27:20,409 INFO L280 TraceCheckUtils]: 2: Hoare triple {19#true} assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; {21#(and (= 0 |ULTIMATE.start_ldv_malloc_#res.base|) (= 0 |ULTIMATE.start_ldv_malloc_#res.offset|))} is VALID [2020-07-29 03:27:20,410 INFO L280 TraceCheckUtils]: 3: Hoare triple {21#(and (= 0 |ULTIMATE.start_ldv_malloc_#res.base|) (= 0 |ULTIMATE.start_ldv_malloc_#res.offset|))} 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; {22#(and (= ULTIMATE.start_entry_point_~array~0.base 0) (= 0 ULTIMATE.start_entry_point_~array~0.offset))} is VALID [2020-07-29 03:27:20,411 INFO L280 TraceCheckUtils]: 4: Hoare triple {22#(and (= ULTIMATE.start_entry_point_~array~0.base 0) (= 0 ULTIMATE.start_entry_point_~array~0.offset))} assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); {20#false} is VALID [2020-07-29 03:27:20,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:27:20,415 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846650092] [2020-07-29 03:27:20,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:27:20,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:27:20,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115115642] [2020-07-29 03:27:20,422 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:27:20,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:20,423 INFO L82 PathProgramCache]: Analyzing trace with hash 49720347, now seen corresponding path program 1 times [2020-07-29 03:27:20,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:20,423 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474021062] [2020-07-29 03:27:20,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:20,443 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:20,466 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:20,499 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:20,726 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2020-07-29 03:27:20,892 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-07-29 03:27:20,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:27:20,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 03:27:20,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 03:27:20,915 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 4 states. [2020-07-29 03:27:21,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:27:21,113 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2020-07-29 03:27:21,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:27:21,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:27:21,127 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:27:21,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2020-07-29 03:27:21,134 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2020-07-29 03:27:21,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 20 states and 25 transitions. [2020-07-29 03:27:21,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-07-29 03:27:21,145 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-07-29 03:27:21,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2020-07-29 03:27:21,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:27:21,146 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2020-07-29 03:27:21,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2020-07-29 03:27:21,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2020-07-29 03:27:21,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:27:21,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 25 transitions. Second operand 13 states. [2020-07-29 03:27:21,176 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 25 transitions. Second operand 13 states. [2020-07-29 03:27:21,178 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand 13 states. [2020-07-29 03:27:21,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:27:21,185 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2020-07-29 03:27:21,186 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2020-07-29 03:27:21,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:21,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:21,187 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 20 states and 25 transitions. [2020-07-29 03:27:21,188 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 20 states and 25 transitions. [2020-07-29 03:27:21,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:27:21,195 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2020-07-29 03:27:21,196 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2020-07-29 03:27:21,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:21,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:21,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:27:21,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:27:21,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 03:27:21,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2020-07-29 03:27:21,206 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2020-07-29 03:27:21,207 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2020-07-29 03:27:21,207 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:27:21,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2020-07-29 03:27:21,208 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 03:27:21,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:21,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:21,213 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 03:27:21,213 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 03:27:21,214 INFO L794 eck$LassoCheckResult]: Stem: 69#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 66#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; 59#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 60#L529 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; 67#L766 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 68#L767-3 [2020-07-29 03:27:21,214 INFO L796 eck$LassoCheckResult]: Loop: 68#L767-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; 62#L526-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 63#L529-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; 64#L769 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); 65#L767-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 68#L767-3 [2020-07-29 03:27:21,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:21,215 INFO L82 PathProgramCache]: Analyzing trace with hash 28693831, now seen corresponding path program 1 times [2020-07-29 03:27:21,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:21,216 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480693992] [2020-07-29 03:27:21,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:21,258 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:21,283 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:21,293 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:21,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:21,294 INFO L82 PathProgramCache]: Analyzing trace with hash 49720347, now seen corresponding path program 2 times [2020-07-29 03:27:21,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:21,299 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459647716] [2020-07-29 03:27:21,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:21,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:21,329 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:21,355 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:21,362 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:21,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:21,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1173278059, now seen corresponding path program 1 times [2020-07-29 03:27:21,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:21,366 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874730320] [2020-07-29 03:27:21,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:21,410 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:21,453 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:21,461 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:21,641 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2020-07-29 03:27:22,011 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2020-07-29 03:27:22,157 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:27:22,158 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:27:22,158 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:27:22,158 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:27:22,159 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:27:22,159 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:22,159 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:27:22,159 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:27:22,159 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_1.i_Iteration2_Lasso [2020-07-29 03:27:22,159 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:27:22,160 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:27:22,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:22,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:22,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:22,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:22,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:22,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:22,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:22,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:22,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:22,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:22,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:22,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:22,575 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2020-07-29 03:27:22,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:22,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:22,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:22,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:22,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:22,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:23,657 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2020-07-29 03:27:23,860 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:27:23,866 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:23,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:27:23,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:23,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:23,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:23,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:23,886 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:23,886 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:23,895 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:23,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:27:23,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:23,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:23,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:23,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:23,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:23,926 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:23,927 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:23,929 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:23,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:27:23,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:23,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:23,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:23,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:23,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:23,958 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:23,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:23,960 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:27:23,995 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:27:23,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:23,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:23,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:23,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:23,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:23,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:23,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:24,000 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:24,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:27:24,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:24,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:24,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:24,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:24,030 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:24,030 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:24,036 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:24,079 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:27:24,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:24,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:24,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:24,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:24,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:24,083 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:24,083 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:24,085 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:24,109 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:27:24,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:24,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:24,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:24,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:24,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:24,112 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:24,113 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:24,114 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:24,158 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:27:24,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:24,160 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:24,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:24,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:24,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:24,161 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:24,161 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:24,163 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:24,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:27:24,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:24,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:24,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:24,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:24,198 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:24,198 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:24,202 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:24,227 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:27:24,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:24,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:24,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:24,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:24,232 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:24,232 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:24,236 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:24,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:27:24,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:24,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:24,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:24,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:24,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:24,263 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:24,263 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:24,265 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:24,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:27:24,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:24,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:24,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:24,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:24,291 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:24,291 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:24,295 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:24,318 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:27:24,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:24,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:24,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:24,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:24,332 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:24,333 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:24,356 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:27:24,445 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2020-07-29 03:27:24,445 INFO L444 ModelExtractionUtils]: 9 out of 34 variables were initially zero. Simplification set additionally 22 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:24,457 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:27:24,460 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:27:24,461 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:27:24,462 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~i~0, ULTIMATE.start_entry_point_~len~0) = -1*ULTIMATE.start_entry_point_~i~0 + 1*ULTIMATE.start_entry_point_~len~0 Supporting invariants [] [2020-07-29 03:27:24,531 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2020-07-29 03:27:24,537 INFO L393 LassoCheck]: Loop: "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;" "assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;" "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;" "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);" "entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39;" [2020-07-29 03:27:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:24,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:24,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:27:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:24,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:27:24,627 INFO L280 TraceCheckUtils]: 0: Hoare triple {119#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); {119#unseeded} is VALID [2020-07-29 03:27:24,629 INFO L280 TraceCheckUtils]: 1: Hoare triple {119#unseeded} 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; {119#unseeded} is VALID [2020-07-29 03:27:24,630 INFO L280 TraceCheckUtils]: 2: Hoare triple {119#unseeded} assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; {119#unseeded} is VALID [2020-07-29 03:27:24,631 INFO L280 TraceCheckUtils]: 3: Hoare triple {119#unseeded} 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; {119#unseeded} is VALID [2020-07-29 03:27:24,633 INFO L280 TraceCheckUtils]: 4: Hoare triple {119#unseeded} assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); {119#unseeded} is VALID [2020-07-29 03:27:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:24,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:27:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:24,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:27:24,700 INFO L280 TraceCheckUtils]: 0: Hoare triple {122#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_entry_point_~i~0) ULTIMATE.start_entry_point_~len~0))} 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; {174#(and (< ULTIMATE.start_entry_point_~i~0 ULTIMATE.start_entry_point_~len~0) (<= ULTIMATE.start_entry_point_~len~0 (+ ULTIMATE.start_entry_point_~i~0 oldRank0)))} is VALID [2020-07-29 03:27:24,701 INFO L280 TraceCheckUtils]: 1: Hoare triple {174#(and (< ULTIMATE.start_entry_point_~i~0 ULTIMATE.start_entry_point_~len~0) (<= ULTIMATE.start_entry_point_~len~0 (+ ULTIMATE.start_entry_point_~i~0 oldRank0)))} assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; {174#(and (< ULTIMATE.start_entry_point_~i~0 ULTIMATE.start_entry_point_~len~0) (<= ULTIMATE.start_entry_point_~len~0 (+ ULTIMATE.start_entry_point_~i~0 oldRank0)))} is VALID [2020-07-29 03:27:24,702 INFO L280 TraceCheckUtils]: 2: Hoare triple {174#(and (< ULTIMATE.start_entry_point_~i~0 ULTIMATE.start_entry_point_~len~0) (<= ULTIMATE.start_entry_point_~len~0 (+ ULTIMATE.start_entry_point_~i~0 oldRank0)))} 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; {174#(and (< ULTIMATE.start_entry_point_~i~0 ULTIMATE.start_entry_point_~len~0) (<= ULTIMATE.start_entry_point_~len~0 (+ ULTIMATE.start_entry_point_~i~0 oldRank0)))} is VALID [2020-07-29 03:27:24,704 INFO L280 TraceCheckUtils]: 3: Hoare triple {174#(and (< ULTIMATE.start_entry_point_~i~0 ULTIMATE.start_entry_point_~len~0) (<= ULTIMATE.start_entry_point_~len~0 (+ ULTIMATE.start_entry_point_~i~0 oldRank0)))} 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); {174#(and (< ULTIMATE.start_entry_point_~i~0 ULTIMATE.start_entry_point_~len~0) (<= ULTIMATE.start_entry_point_~len~0 (+ ULTIMATE.start_entry_point_~i~0 oldRank0)))} is VALID [2020-07-29 03:27:24,705 INFO L280 TraceCheckUtils]: 4: Hoare triple {174#(and (< ULTIMATE.start_entry_point_~i~0 ULTIMATE.start_entry_point_~len~0) (<= ULTIMATE.start_entry_point_~len~0 (+ ULTIMATE.start_entry_point_~i~0 oldRank0)))} entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; {157#(or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_entry_point_~i~0) ULTIMATE.start_entry_point_~len~0)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:27:24,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:27:24,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:27:24,718 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:27:24,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:27:24,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,728 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 03:27:24,729 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-29 03:27:24,851 INFO L75 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. [2020-07-29 03:27:24,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:27:24,851 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:27:24,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. cyclomatic complexity: 5 [2020-07-29 03:27:24,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:24,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:24,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:27:24,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:27:24,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:24,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:24,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2020-07-29 03:27:24,859 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 03:27:24,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:24,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:24,861 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 16 transitions. cyclomatic complexity: 5 [2020-07-29 03:27:24,864 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 03:27:24,864 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:27:24,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:27:24,866 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:27:24,867 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 36 transitions. cyclomatic complexity: 14 [2020-07-29 03:27:24,868 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 03:27:24,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:27:24,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:27:24,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:27:24,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:27:24,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:27:24,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:27:24,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:27:24,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:27:24,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:27:24,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 27 letters. Loop has 27 letters. [2020-07-29 03:27:24,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 03:27:24,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 14 Stem has 27 letters. Loop has 27 letters. [2020-07-29 03:27:24,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 13 letters. [2020-07-29 03:27:24,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 03:27:24,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 14 Stem has 13 letters. Loop has 13 letters. [2020-07-29 03:27:24,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:27:24,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:27:24,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:27:24,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:27:24,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:27:24,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:27:24,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:27:24,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:27:24,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:27:24,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 5 letters. [2020-07-29 03:27:24,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 5 letters. [2020-07-29 03:27:24,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 5 letters. [2020-07-29 03:27:24,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 5 letters. [2020-07-29 03:27:24,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 5 letters. [2020-07-29 03:27:24,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 5 letters. [2020-07-29 03:27:24,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:27:24,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:27:24,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:27:24,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 5 letters. [2020-07-29 03:27:24,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 03:27:24,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 5 letters. [2020-07-29 03:27:24,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 5 letters. [2020-07-29 03:27:24,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 5 letters. [2020-07-29 03:27:24,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 5 letters. [2020-07-29 03:27:24,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:27:24,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:27:24,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:27:24,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:27:24,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:27:24,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:27:24,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:27:24,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:27:24,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 14 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:27:24,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:27:24,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:27:24,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:27:24,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:27:24,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:27:24,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:27:24,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,897 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:27:24,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:27:24,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2020-07-29 03:27:24,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:27:24,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 10 letters. Loop has 5 letters. [2020-07-29 03:27:24,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 10 letters. [2020-07-29 03:27:24,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:24,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. cyclomatic complexity: 14 [2020-07-29 03:27:24,904 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 03:27:24,905 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 20 states and 26 transitions. [2020-07-29 03:27:24,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 03:27:24,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-07-29 03:27:24,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2020-07-29 03:27:24,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:27:24,907 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-07-29 03:27:24,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2020-07-29 03:27:24,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2020-07-29 03:27:24,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:27:24,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 26 transitions. Second operand 17 states. [2020-07-29 03:27:24,909 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 26 transitions. Second operand 17 states. [2020-07-29 03:27:24,909 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand 17 states. [2020-07-29 03:27:24,910 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:24,913 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-07-29 03:27:24,914 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2020-07-29 03:27:24,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:24,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:24,915 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 20 states and 26 transitions. [2020-07-29 03:27:24,915 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 20 states and 26 transitions. [2020-07-29 03:27:24,916 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:24,918 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-07-29 03:27:24,918 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2020-07-29 03:27:24,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:24,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:24,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:27:24,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:27:24,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 03:27:24,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2020-07-29 03:27:24,921 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-07-29 03:27:24,921 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-07-29 03:27:24,921 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:27:24,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2020-07-29 03:27:24,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:27:24,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:24,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:24,923 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:27:24,923 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:27:24,924 INFO L794 eck$LassoCheckResult]: Stem: 238#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 235#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; 225#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 226#L529 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; 236#L766 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 237#L767-3 assume !(entry_point_~i~0 < entry_point_~len~0); 223#L772 entry_point_~j~0 := entry_point_~i~0 - 1; 224#L773-3 [2020-07-29 03:27:24,924 INFO L796 eck$LassoCheckResult]: Loop: 224#L773-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; 227#L773-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 224#L773-3 [2020-07-29 03:27:24,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:24,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1804968475, now seen corresponding path program 1 times [2020-07-29 03:27:24,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:24,925 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392967520] [2020-07-29 03:27:24,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:25,002 INFO L280 TraceCheckUtils]: 0: Hoare triple {332#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); {332#true} is VALID [2020-07-29 03:27:25,004 INFO L280 TraceCheckUtils]: 1: Hoare triple {332#true} 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; {334#(<= 10 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:25,005 INFO L280 TraceCheckUtils]: 2: Hoare triple {334#(<= 10 ULTIMATE.start_entry_point_~len~0)} assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; {334#(<= 10 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:25,006 INFO L280 TraceCheckUtils]: 3: Hoare triple {334#(<= 10 ULTIMATE.start_entry_point_~len~0)} 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; {335#(and (<= 10 ULTIMATE.start_entry_point_~len~0) (= ULTIMATE.start_entry_point_~i~0 0))} is VALID [2020-07-29 03:27:25,008 INFO L280 TraceCheckUtils]: 4: Hoare triple {335#(and (<= 10 ULTIMATE.start_entry_point_~len~0) (= ULTIMATE.start_entry_point_~i~0 0))} assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); {335#(and (<= 10 ULTIMATE.start_entry_point_~len~0) (= ULTIMATE.start_entry_point_~i~0 0))} is VALID [2020-07-29 03:27:25,009 INFO L280 TraceCheckUtils]: 5: Hoare triple {335#(and (<= 10 ULTIMATE.start_entry_point_~len~0) (= ULTIMATE.start_entry_point_~i~0 0))} assume !(entry_point_~i~0 < entry_point_~len~0); {333#false} is VALID [2020-07-29 03:27:25,009 INFO L280 TraceCheckUtils]: 6: Hoare triple {333#false} entry_point_~j~0 := entry_point_~i~0 - 1; {333#false} is VALID [2020-07-29 03:27:25,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:27:25,010 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392967520] [2020-07-29 03:27:25,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:27:25,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 03:27:25,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095730060] [2020-07-29 03:27:25,012 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:27:25,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:25,012 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 1 times [2020-07-29 03:27:25,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:25,013 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65737013] [2020-07-29 03:27:25,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:25,028 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:25,036 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:25,040 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:25,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:27:25,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 03:27:25,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 03:27:25,098 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-07-29 03:27:25,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:27:25,188 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2020-07-29 03:27:25,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 03:27:25,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:27:25,202 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:27:25,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2020-07-29 03:27:25,205 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 03:27:25,208 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 34 transitions. [2020-07-29 03:27:25,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-07-29 03:27:25,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-07-29 03:27:25,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2020-07-29 03:27:25,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:27:25,209 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-07-29 03:27:25,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2020-07-29 03:27:25,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2020-07-29 03:27:25,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:27:25,212 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states and 34 transitions. Second operand 17 states. [2020-07-29 03:27:25,212 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states and 34 transitions. Second operand 17 states. [2020-07-29 03:27:25,213 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand 17 states. [2020-07-29 03:27:25,213 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:25,216 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2020-07-29 03:27:25,216 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2020-07-29 03:27:25,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:25,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:25,218 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 27 states and 34 transitions. [2020-07-29 03:27:25,218 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 27 states and 34 transitions. [2020-07-29 03:27:25,219 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:25,226 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2020-07-29 03:27:25,226 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2020-07-29 03:27:25,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:25,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:25,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:27:25,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:27:25,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 03:27:25,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2020-07-29 03:27:25,229 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2020-07-29 03:27:25,230 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2020-07-29 03:27:25,230 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:27:25,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2020-07-29 03:27:25,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:27:25,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:25,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:25,233 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:27:25,233 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:27:25,233 INFO L794 eck$LassoCheckResult]: Stem: 380#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 377#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; 367#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 368#L529 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; 378#L766 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 379#L767-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; 370#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 371#L529-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; 374#L769 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 365#L772 entry_point_~j~0 := entry_point_~i~0 - 1; 366#L773-3 [2020-07-29 03:27:25,234 INFO L796 eck$LassoCheckResult]: Loop: 366#L773-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; 369#L773-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 366#L773-3 [2020-07-29 03:27:25,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:25,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1173218535, now seen corresponding path program 1 times [2020-07-29 03:27:25,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:25,235 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916014539] [2020-07-29 03:27:25,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:25,272 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:25,285 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:25,290 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:25,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:25,291 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 2 times [2020-07-29 03:27:25,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:25,291 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681535380] [2020-07-29 03:27:25,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:25,297 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:25,300 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:25,303 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:25,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:25,303 INFO L82 PathProgramCache]: Analyzing trace with hash 2113388251, now seen corresponding path program 1 times [2020-07-29 03:27:25,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:25,304 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474900772] [2020-07-29 03:27:25,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:25,352 INFO L280 TraceCheckUtils]: 0: Hoare triple {494#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); {494#true} is VALID [2020-07-29 03:27:25,352 INFO L280 TraceCheckUtils]: 1: Hoare triple {494#true} 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; {494#true} is VALID [2020-07-29 03:27:25,353 INFO L280 TraceCheckUtils]: 2: Hoare triple {494#true} assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; {494#true} is VALID [2020-07-29 03:27:25,354 INFO L280 TraceCheckUtils]: 3: Hoare triple {494#true} 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; {496#(= ULTIMATE.start_entry_point_~i~0 0)} is VALID [2020-07-29 03:27:25,355 INFO L280 TraceCheckUtils]: 4: Hoare triple {496#(= ULTIMATE.start_entry_point_~i~0 0)} assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); {496#(= ULTIMATE.start_entry_point_~i~0 0)} is VALID [2020-07-29 03:27:25,356 INFO L280 TraceCheckUtils]: 5: Hoare triple {496#(= ULTIMATE.start_entry_point_~i~0 0)} 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; {496#(= ULTIMATE.start_entry_point_~i~0 0)} is VALID [2020-07-29 03:27:25,356 INFO L280 TraceCheckUtils]: 6: Hoare triple {496#(= ULTIMATE.start_entry_point_~i~0 0)} assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; {496#(= ULTIMATE.start_entry_point_~i~0 0)} is VALID [2020-07-29 03:27:25,357 INFO L280 TraceCheckUtils]: 7: Hoare triple {496#(= ULTIMATE.start_entry_point_~i~0 0)} 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; {496#(= ULTIMATE.start_entry_point_~i~0 0)} is VALID [2020-07-29 03:27:25,358 INFO L280 TraceCheckUtils]: 8: Hoare triple {496#(= ULTIMATE.start_entry_point_~i~0 0)} assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; {496#(= ULTIMATE.start_entry_point_~i~0 0)} is VALID [2020-07-29 03:27:25,360 INFO L280 TraceCheckUtils]: 9: Hoare triple {496#(= ULTIMATE.start_entry_point_~i~0 0)} entry_point_~j~0 := entry_point_~i~0 - 1; {497#(<= (+ ULTIMATE.start_entry_point_~j~0 1) 0)} is VALID [2020-07-29 03:27:25,361 INFO L280 TraceCheckUtils]: 10: Hoare triple {497#(<= (+ ULTIMATE.start_entry_point_~j~0 1) 0)} 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; {495#false} is VALID [2020-07-29 03:27:25,362 INFO L280 TraceCheckUtils]: 11: Hoare triple {495#false} entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; {495#false} is VALID [2020-07-29 03:27:25,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:27:25,363 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474900772] [2020-07-29 03:27:25,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:27:25,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 03:27:25,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696412756] [2020-07-29 03:27:25,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:27:25,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 03:27:25,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 03:27:25,410 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-07-29 03:27:25,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:27:25,500 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-07-29 03:27:25,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 03:27:25,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:27:25,580 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:27:25,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2020-07-29 03:27:25,586 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:27:25,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 21 states and 26 transitions. [2020-07-29 03:27:25,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 03:27:25,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-29 03:27:25,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2020-07-29 03:27:25,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:27:25,590 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2020-07-29 03:27:25,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2020-07-29 03:27:25,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2020-07-29 03:27:25,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:27:25,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 26 transitions. Second operand 17 states. [2020-07-29 03:27:25,592 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 26 transitions. Second operand 17 states. [2020-07-29 03:27:25,592 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand 17 states. [2020-07-29 03:27:25,593 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:25,595 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2020-07-29 03:27:25,595 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2020-07-29 03:27:25,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:25,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:25,595 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 21 states and 26 transitions. [2020-07-29 03:27:25,595 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 21 states and 26 transitions. [2020-07-29 03:27:25,596 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:25,599 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2020-07-29 03:27:25,599 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2020-07-29 03:27:25,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:25,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:25,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:27:25,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:27:25,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 03:27:25,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2020-07-29 03:27:25,602 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-07-29 03:27:25,602 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-07-29 03:27:25,602 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:27:25,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2020-07-29 03:27:25,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:27:25,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:25,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:25,604 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:27:25,604 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:27:25,604 INFO L794 eck$LassoCheckResult]: Stem: 541#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 538#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; 528#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 529#L529 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; 539#L766 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 540#L767-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; 533#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 534#L529-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; 536#L769 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); 537#L767-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 542#L767-3 assume !(entry_point_~i~0 < entry_point_~len~0); 526#L772 entry_point_~j~0 := entry_point_~i~0 - 1; 527#L773-3 [2020-07-29 03:27:25,605 INFO L796 eck$LassoCheckResult]: Loop: 527#L773-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; 530#L773-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 527#L773-3 [2020-07-29 03:27:25,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:25,605 INFO L82 PathProgramCache]: Analyzing trace with hash 2113443111, now seen corresponding path program 1 times [2020-07-29 03:27:25,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:25,606 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501244484] [2020-07-29 03:27:25,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:25,676 INFO L280 TraceCheckUtils]: 0: Hoare triple {651#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); {651#true} is VALID [2020-07-29 03:27:25,677 INFO L280 TraceCheckUtils]: 1: Hoare triple {651#true} 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; {651#true} is VALID [2020-07-29 03:27:25,677 INFO L280 TraceCheckUtils]: 2: Hoare triple {651#true} assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; {651#true} is VALID [2020-07-29 03:27:25,677 INFO L280 TraceCheckUtils]: 3: Hoare triple {651#true} 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; {651#true} is VALID [2020-07-29 03:27:25,678 INFO L280 TraceCheckUtils]: 4: Hoare triple {651#true} assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); {651#true} is VALID [2020-07-29 03:27:25,678 INFO L280 TraceCheckUtils]: 5: Hoare triple {651#true} 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; {651#true} is VALID [2020-07-29 03:27:25,679 INFO L280 TraceCheckUtils]: 6: Hoare triple {651#true} assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; {653#(and (= 0 |ULTIMATE.start_ldv_malloc_#res.base|) (= 0 |ULTIMATE.start_ldv_malloc_#res.offset|))} is VALID [2020-07-29 03:27:25,680 INFO L280 TraceCheckUtils]: 7: Hoare triple {653#(and (= 0 |ULTIMATE.start_ldv_malloc_#res.base|) (= 0 |ULTIMATE.start_ldv_malloc_#res.offset|))} 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; {654#(and (= 0 ULTIMATE.start_entry_point_~p~0.offset) (= 0 ULTIMATE.start_entry_point_~p~0.base))} is VALID [2020-07-29 03:27:25,681 INFO L280 TraceCheckUtils]: 8: Hoare triple {654#(and (= 0 ULTIMATE.start_entry_point_~p~0.offset) (= 0 ULTIMATE.start_entry_point_~p~0.base))} 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); {652#false} is VALID [2020-07-29 03:27:25,682 INFO L280 TraceCheckUtils]: 9: Hoare triple {652#false} entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; {652#false} is VALID [2020-07-29 03:27:25,682 INFO L280 TraceCheckUtils]: 10: Hoare triple {652#false} assume !(entry_point_~i~0 < entry_point_~len~0); {652#false} is VALID [2020-07-29 03:27:25,682 INFO L280 TraceCheckUtils]: 11: Hoare triple {652#false} entry_point_~j~0 := entry_point_~i~0 - 1; {652#false} is VALID [2020-07-29 03:27:25,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:27:25,683 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501244484] [2020-07-29 03:27:25,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:27:25,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 03:27:25,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820404806] [2020-07-29 03:27:25,684 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:27:25,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:25,685 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 3 times [2020-07-29 03:27:25,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:25,686 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823484965] [2020-07-29 03:27:25,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:25,690 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:25,694 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:25,696 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:25,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:27:25,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 03:27:25,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 03:27:25,741 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 4 states. [2020-07-29 03:27:25,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:27:25,833 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2020-07-29 03:27:25,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:27:25,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:27:25,850 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:27:25,850 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 30 transitions. [2020-07-29 03:27:25,852 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:27:25,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 28 transitions. [2020-07-29 03:27:25,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-07-29 03:27:25,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-07-29 03:27:25,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 28 transitions. [2020-07-29 03:27:25,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:27:25,854 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2020-07-29 03:27:25,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 28 transitions. [2020-07-29 03:27:25,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2020-07-29 03:27:25,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:27:25,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states and 28 transitions. Second operand 17 states. [2020-07-29 03:27:25,856 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states and 28 transitions. Second operand 17 states. [2020-07-29 03:27:25,856 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 17 states. [2020-07-29 03:27:25,857 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:25,859 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-29 03:27:25,859 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-29 03:27:25,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:25,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:25,860 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 25 states and 28 transitions. [2020-07-29 03:27:25,860 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 25 states and 28 transitions. [2020-07-29 03:27:25,861 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:25,863 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-29 03:27:25,863 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-29 03:27:25,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:25,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:25,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:27:25,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:27:25,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 03:27:25,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2020-07-29 03:27:25,866 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-07-29 03:27:25,866 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-07-29 03:27:25,866 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 03:27:25,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2020-07-29 03:27:25,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:27:25,867 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:25,867 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:25,868 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:27:25,868 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:27:25,868 INFO L794 eck$LassoCheckResult]: Stem: 701#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 698#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; 688#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 689#L529 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; 699#L766 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 700#L767-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; 693#L526-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 694#L529-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; 696#L769 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); 697#L767-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 702#L767-3 assume !(entry_point_~i~0 < entry_point_~len~0); 686#L772 entry_point_~j~0 := entry_point_~i~0 - 1; 687#L773-3 [2020-07-29 03:27:25,868 INFO L796 eck$LassoCheckResult]: Loop: 687#L773-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; 690#L773-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 687#L773-3 [2020-07-29 03:27:25,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:25,869 INFO L82 PathProgramCache]: Analyzing trace with hash 2056184809, now seen corresponding path program 1 times [2020-07-29 03:27:25,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:25,870 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664675109] [2020-07-29 03:27:25,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:25,943 INFO L280 TraceCheckUtils]: 0: Hoare triple {834#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); {834#true} is VALID [2020-07-29 03:27:25,944 INFO L280 TraceCheckUtils]: 1: Hoare triple {834#true} 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; {836#(<= 10 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:25,945 INFO L280 TraceCheckUtils]: 2: Hoare triple {836#(<= 10 ULTIMATE.start_entry_point_~len~0)} assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; {836#(<= 10 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:25,946 INFO L280 TraceCheckUtils]: 3: Hoare triple {836#(<= 10 ULTIMATE.start_entry_point_~len~0)} 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; {837#(and (<= 10 ULTIMATE.start_entry_point_~len~0) (= ULTIMATE.start_entry_point_~i~0 0))} is VALID [2020-07-29 03:27:25,948 INFO L280 TraceCheckUtils]: 4: Hoare triple {837#(and (<= 10 ULTIMATE.start_entry_point_~len~0) (= ULTIMATE.start_entry_point_~i~0 0))} assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); {837#(and (<= 10 ULTIMATE.start_entry_point_~len~0) (= ULTIMATE.start_entry_point_~i~0 0))} is VALID [2020-07-29 03:27:25,949 INFO L280 TraceCheckUtils]: 5: Hoare triple {837#(and (<= 10 ULTIMATE.start_entry_point_~len~0) (= ULTIMATE.start_entry_point_~i~0 0))} 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; {837#(and (<= 10 ULTIMATE.start_entry_point_~len~0) (= ULTIMATE.start_entry_point_~i~0 0))} is VALID [2020-07-29 03:27:25,951 INFO L280 TraceCheckUtils]: 6: Hoare triple {837#(and (<= 10 ULTIMATE.start_entry_point_~len~0) (= ULTIMATE.start_entry_point_~i~0 0))} assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; {837#(and (<= 10 ULTIMATE.start_entry_point_~len~0) (= ULTIMATE.start_entry_point_~i~0 0))} is VALID [2020-07-29 03:27:25,956 INFO L280 TraceCheckUtils]: 7: Hoare triple {837#(and (<= 10 ULTIMATE.start_entry_point_~len~0) (= ULTIMATE.start_entry_point_~i~0 0))} 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; {837#(and (<= 10 ULTIMATE.start_entry_point_~len~0) (= ULTIMATE.start_entry_point_~i~0 0))} is VALID [2020-07-29 03:27:25,957 INFO L280 TraceCheckUtils]: 8: Hoare triple {837#(and (<= 10 ULTIMATE.start_entry_point_~len~0) (= ULTIMATE.start_entry_point_~i~0 0))} 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); {837#(and (<= 10 ULTIMATE.start_entry_point_~len~0) (= ULTIMATE.start_entry_point_~i~0 0))} is VALID [2020-07-29 03:27:25,958 INFO L280 TraceCheckUtils]: 9: Hoare triple {837#(and (<= 10 ULTIMATE.start_entry_point_~len~0) (= ULTIMATE.start_entry_point_~i~0 0))} entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; {838#(<= (+ ULTIMATE.start_entry_point_~i~0 9) ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:25,958 INFO L280 TraceCheckUtils]: 10: Hoare triple {838#(<= (+ ULTIMATE.start_entry_point_~i~0 9) ULTIMATE.start_entry_point_~len~0)} assume !(entry_point_~i~0 < entry_point_~len~0); {835#false} is VALID [2020-07-29 03:27:25,959 INFO L280 TraceCheckUtils]: 11: Hoare triple {835#false} entry_point_~j~0 := entry_point_~i~0 - 1; {835#false} is VALID [2020-07-29 03:27:25,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:27:25,959 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664675109] [2020-07-29 03:27:25,960 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906486464] [2020-07-29 03:27:25,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:27:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:26,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:27:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:26,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:27:26,170 INFO L280 TraceCheckUtils]: 0: Hoare triple {834#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); {834#true} is VALID [2020-07-29 03:27:26,171 INFO L280 TraceCheckUtils]: 1: Hoare triple {834#true} 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; {836#(<= 10 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:26,172 INFO L280 TraceCheckUtils]: 2: Hoare triple {836#(<= 10 ULTIMATE.start_entry_point_~len~0)} assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; {836#(<= 10 ULTIMATE.start_entry_point_~len~0)} is VALID [2020-07-29 03:27:26,175 INFO L280 TraceCheckUtils]: 3: Hoare triple {836#(<= 10 ULTIMATE.start_entry_point_~len~0)} 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; {851#(and (<= 10 ULTIMATE.start_entry_point_~len~0) (<= ULTIMATE.start_entry_point_~i~0 0))} is VALID [2020-07-29 03:27:26,177 INFO L280 TraceCheckUtils]: 4: Hoare triple {851#(and (<= 10 ULTIMATE.start_entry_point_~len~0) (<= ULTIMATE.start_entry_point_~i~0 0))} assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); {851#(and (<= 10 ULTIMATE.start_entry_point_~len~0) (<= ULTIMATE.start_entry_point_~i~0 0))} is VALID [2020-07-29 03:27:26,179 INFO L280 TraceCheckUtils]: 5: Hoare triple {851#(and (<= 10 ULTIMATE.start_entry_point_~len~0) (<= ULTIMATE.start_entry_point_~i~0 0))} 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; {851#(and (<= 10 ULTIMATE.start_entry_point_~len~0) (<= ULTIMATE.start_entry_point_~i~0 0))} is VALID [2020-07-29 03:27:26,180 INFO L280 TraceCheckUtils]: 6: Hoare triple {851#(and (<= 10 ULTIMATE.start_entry_point_~len~0) (<= ULTIMATE.start_entry_point_~i~0 0))} assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; {851#(and (<= 10 ULTIMATE.start_entry_point_~len~0) (<= ULTIMATE.start_entry_point_~i~0 0))} is VALID [2020-07-29 03:27:26,181 INFO L280 TraceCheckUtils]: 7: Hoare triple {851#(and (<= 10 ULTIMATE.start_entry_point_~len~0) (<= ULTIMATE.start_entry_point_~i~0 0))} 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; {851#(and (<= 10 ULTIMATE.start_entry_point_~len~0) (<= ULTIMATE.start_entry_point_~i~0 0))} is VALID [2020-07-29 03:27:26,183 INFO L280 TraceCheckUtils]: 8: Hoare triple {851#(and (<= 10 ULTIMATE.start_entry_point_~len~0) (<= ULTIMATE.start_entry_point_~i~0 0))} 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); {851#(and (<= 10 ULTIMATE.start_entry_point_~len~0) (<= ULTIMATE.start_entry_point_~i~0 0))} is VALID [2020-07-29 03:27:26,184 INFO L280 TraceCheckUtils]: 9: Hoare triple {851#(and (<= 10 ULTIMATE.start_entry_point_~len~0) (<= ULTIMATE.start_entry_point_~i~0 0))} entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; {870#(and (<= 10 ULTIMATE.start_entry_point_~len~0) (<= ULTIMATE.start_entry_point_~i~0 1))} is VALID [2020-07-29 03:27:26,186 INFO L280 TraceCheckUtils]: 10: Hoare triple {870#(and (<= 10 ULTIMATE.start_entry_point_~len~0) (<= ULTIMATE.start_entry_point_~i~0 1))} assume !(entry_point_~i~0 < entry_point_~len~0); {835#false} is VALID [2020-07-29 03:27:26,186 INFO L280 TraceCheckUtils]: 11: Hoare triple {835#false} entry_point_~j~0 := entry_point_~i~0 - 1; {835#false} is VALID [2020-07-29 03:27:26,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:27:26,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:27:26,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-07-29 03:27:26,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68870350] [2020-07-29 03:27:26,190 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:27:26,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:26,190 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 4 times [2020-07-29 03:27:26,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:26,191 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523334953] [2020-07-29 03:27:26,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:26,198 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:26,202 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:26,204 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:26,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:27:26,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 03:27:26,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2020-07-29 03:27:26,240 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 7 states. [2020-07-29 03:27:26,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:27:26,358 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2020-07-29 03:27:26,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:27:26,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 03:27:26,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:27:26,387 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2020-07-29 03:27:26,389 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 03:27:26,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 37 transitions. [2020-07-29 03:27:26,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-07-29 03:27:26,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-07-29 03:27:26,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 37 transitions. [2020-07-29 03:27:26,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:27:26,393 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2020-07-29 03:27:26,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 37 transitions. [2020-07-29 03:27:26,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 22. [2020-07-29 03:27:26,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:27:26,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states and 37 transitions. Second operand 22 states. [2020-07-29 03:27:26,397 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states and 37 transitions. Second operand 22 states. [2020-07-29 03:27:26,397 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 22 states. [2020-07-29 03:27:26,398 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:26,402 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-07-29 03:27:26,403 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2020-07-29 03:27:26,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:26,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:26,406 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 32 states and 37 transitions. [2020-07-29 03:27:26,406 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 32 states and 37 transitions. [2020-07-29 03:27:26,406 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:27:26,410 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-07-29 03:27:26,411 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2020-07-29 03:27:26,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:26,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:26,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:27:26,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:27:26,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-29 03:27:26,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2020-07-29 03:27:26,417 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-07-29 03:27:26,417 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-07-29 03:27:26,417 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 03:27:26,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2020-07-29 03:27:26,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:27:26,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:26,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:26,419 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:27:26,419 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:27:26,419 INFO L794 eck$LassoCheckResult]: Stem: 923#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 920#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; 910#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 911#L529 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; 921#L766 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 922#L767-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; 925#L526-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 926#L529-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; 918#L769 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); 919#L767-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 924#L767-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; 913#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 914#L529-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; 917#L769 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 908#L772 entry_point_~j~0 := entry_point_~i~0 - 1; 909#L773-3 [2020-07-29 03:27:26,420 INFO L796 eck$LassoCheckResult]: Loop: 909#L773-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; 912#L773-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 909#L773-3 [2020-07-29 03:27:26,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:26,422 INFO L82 PathProgramCache]: Analyzing trace with hash 979558027, now seen corresponding path program 1 times [2020-07-29 03:27:26,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:26,423 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48407785] [2020-07-29 03:27:26,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:26,446 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:26,473 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:26,482 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:26,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:26,483 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 5 times [2020-07-29 03:27:26,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:26,484 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161714505] [2020-07-29 03:27:26,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:26,490 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:26,493 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:26,497 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:26,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:26,498 INFO L82 PathProgramCache]: Analyzing trace with hash 757427661, now seen corresponding path program 1 times [2020-07-29 03:27:26,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:26,502 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904479376] [2020-07-29 03:27:26,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:26,523 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:26,548 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:26,557 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:27,211 WARN L193 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 144 [2020-07-29 03:27:27,521 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-07-29 03:27:27,524 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:27:27,525 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:27:27,525 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:27:27,525 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:27:27,525 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:27:27,525 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:27,525 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:27:27,525 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:27:27,525 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_1.i_Iteration7_Lasso [2020-07-29 03:27:27,526 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:27:27,526 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:27:27,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:27,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:27,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:27,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:27,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:27,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:27,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:27,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:27,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:27,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:27,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:27,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:27,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:27,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:27,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:27,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:27,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:27,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:27,896 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 03:27:27,897 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 03:27:27,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:27,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:27,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:27,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:27:28,841 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 28 [2020-07-29 03:27:29,020 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:27:29,020 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:29,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:27:29,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:29,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:29,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:29,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:29,031 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:29,031 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:29,035 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:29,058 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:27:29,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:29,060 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:29,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:29,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:29,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:29,061 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:29,061 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:29,062 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:29,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:27:29,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:29,091 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:29,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:29,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:29,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:29,092 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:29,092 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:29,095 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:27:29,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:27:29,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:29,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:29,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:29,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:29,148 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:29,148 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:29,152 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:29,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:27:29,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:29,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:29,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:29,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:29,191 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:29,192 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:29,196 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:27:29,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:27:29,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:29,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:29,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:29,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:29,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:29,246 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:29,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:29,251 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:29,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:27:29,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:29,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:29,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:29,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:29,282 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:29,282 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:29,286 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:27:29,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:27:29,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:29,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:29,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:29,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:29,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:29,338 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:29,338 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:29,343 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:27:29,382 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:27:29,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:29,385 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:29,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:29,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:29,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:29,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:29,387 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:29,389 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:29,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:27:29,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:29,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:29,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:29,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:29,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:29,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:29,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:29,427 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:29,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:27:29,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:29,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:29,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:29,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:29,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:29,456 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:29,456 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:29,462 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:29,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:27:29,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:29,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:29,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:29,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:29,489 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:29,489 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:29,494 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:29,515 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:27:29,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:29,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:29,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:29,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:29,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:29,518 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:29,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:29,519 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:29,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:27:29,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:29,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:29,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:29,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:29,547 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:29,547 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:29,550 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:29,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:27:29,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:29,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:29,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:29,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:29,575 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:29,575 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:29,579 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:29,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:27:29,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:29,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:29,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:29,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:29,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:29,604 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:29,604 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:29,606 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:29,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:27:29,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:29,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:29,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:29,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:29,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:29,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:29,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:29,638 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:29,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:27:29,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:29,668 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:29,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:29,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:29,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:29,669 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:29,669 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:29,670 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:29,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:27:29,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:29,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:29,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:29,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:29,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:29,695 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:29,695 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:29,696 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:29,719 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:27:29,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:29,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:29,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:29,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:29,732 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:29,733 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:29,746 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:27:29,776 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2020-07-29 03:27:29,776 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 16 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:29,781 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:27:29,783 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:27:29,783 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:27:29,783 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~j~0) = 2*ULTIMATE.start_entry_point_~j~0 + 1 Supporting invariants [] [2020-07-29 03:27:29,821 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-07-29 03:27:29,825 INFO L393 LassoCheck]: Loop: "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;" "entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41;" [2020-07-29 03:27:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:29,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:29,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:29,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:27:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:29,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:27:29,887 INFO L280 TraceCheckUtils]: 0: Hoare triple {1088#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); {1088#unseeded} is VALID [2020-07-29 03:27:29,887 INFO L280 TraceCheckUtils]: 1: Hoare triple {1088#unseeded} 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; {1088#unseeded} is VALID [2020-07-29 03:27:29,888 INFO L280 TraceCheckUtils]: 2: Hoare triple {1088#unseeded} assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; {1088#unseeded} is VALID [2020-07-29 03:27:29,889 INFO L280 TraceCheckUtils]: 3: Hoare triple {1088#unseeded} 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; {1088#unseeded} is VALID [2020-07-29 03:27:29,889 INFO L280 TraceCheckUtils]: 4: Hoare triple {1088#unseeded} assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); {1088#unseeded} is VALID [2020-07-29 03:27:29,890 INFO L280 TraceCheckUtils]: 5: Hoare triple {1088#unseeded} 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; {1088#unseeded} is VALID [2020-07-29 03:27:29,890 INFO L280 TraceCheckUtils]: 6: Hoare triple {1088#unseeded} assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; {1088#unseeded} is VALID [2020-07-29 03:27:29,891 INFO L280 TraceCheckUtils]: 7: Hoare triple {1088#unseeded} 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; {1088#unseeded} is VALID [2020-07-29 03:27:29,891 INFO L280 TraceCheckUtils]: 8: Hoare triple {1088#unseeded} 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); {1088#unseeded} is VALID [2020-07-29 03:27:29,892 INFO L280 TraceCheckUtils]: 9: Hoare triple {1088#unseeded} entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; {1088#unseeded} is VALID [2020-07-29 03:27:29,892 INFO L280 TraceCheckUtils]: 10: Hoare triple {1088#unseeded} 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; {1088#unseeded} is VALID [2020-07-29 03:27:29,892 INFO L280 TraceCheckUtils]: 11: Hoare triple {1088#unseeded} assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; {1088#unseeded} is VALID [2020-07-29 03:27:29,893 INFO L280 TraceCheckUtils]: 12: Hoare triple {1088#unseeded} 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; {1088#unseeded} is VALID [2020-07-29 03:27:29,894 INFO L280 TraceCheckUtils]: 13: Hoare triple {1088#unseeded} assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; {1088#unseeded} is VALID [2020-07-29 03:27:29,894 INFO L280 TraceCheckUtils]: 14: Hoare triple {1088#unseeded} entry_point_~j~0 := entry_point_~i~0 - 1; {1088#unseeded} is VALID [2020-07-29 03:27:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:29,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:27:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:29,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:27:29,921 INFO L280 TraceCheckUtils]: 0: Hoare triple {1091#(>= oldRank0 (+ (* 2 ULTIMATE.start_entry_point_~j~0) 1))} 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; {1178#(and (<= 0 ULTIMATE.start_entry_point_~j~0) (<= (+ (* 2 ULTIMATE.start_entry_point_~j~0) 1) oldRank0))} is VALID [2020-07-29 03:27:29,922 INFO L280 TraceCheckUtils]: 1: Hoare triple {1178#(and (<= 0 ULTIMATE.start_entry_point_~j~0) (<= (+ (* 2 ULTIMATE.start_entry_point_~j~0) 1) oldRank0))} entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; {1131#(or (and (> oldRank0 (+ (* 2 ULTIMATE.start_entry_point_~j~0) 1)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:27:29,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:27:29,922 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:27:29,930 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:27:29,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:27:29,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:29,931 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 03:27:29,931 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 6 Second operand 3 states. [2020-07-29 03:27:29,959 INFO L75 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. [2020-07-29 03:27:29,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 03:27:29,959 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:27:29,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. cyclomatic complexity: 6 [2020-07-29 03:27:29,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:29,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:29,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:27:29,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:27:29,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:29,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:29,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2020-07-29 03:27:29,962 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:27:29,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:27:29,962 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 22 states and 26 transitions. cyclomatic complexity: 6 [2020-07-29 03:27:29,963 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:27:29,963 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:27:29,964 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:27:29,964 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:27:29,965 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 29 transitions. cyclomatic complexity: 7 [2020-07-29 03:27:29,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. cyclomatic complexity: 7 [2020-07-29 03:27:29,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:27:29,965 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:27:29,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 26 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:27:29,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:29,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:27:29,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:29,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 29 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:27:29,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:29,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 26 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:27:29,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:29,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:27:29,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:29,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 29 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:27:29,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:29,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 26 transitions. cyclomatic complexity: 6 Stem has 24 letters. Loop has 24 letters. [2020-07-29 03:27:29,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:29,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 24 letters. Loop has 24 letters. [2020-07-29 03:27:29,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:29,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 29 transitions. cyclomatic complexity: 7 Stem has 24 letters. Loop has 24 letters. [2020-07-29 03:27:29,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:29,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 26 transitions. cyclomatic complexity: 6 Stem has 22 letters. Loop has 22 letters. [2020-07-29 03:27:29,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:29,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 22 letters. Loop has 22 letters. [2020-07-29 03:27:29,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:29,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 29 transitions. cyclomatic complexity: 7 Stem has 22 letters. Loop has 22 letters. [2020-07-29 03:27:29,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:29,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 26 transitions. cyclomatic complexity: 6 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:27:29,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:29,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:27:29,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:29,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 29 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:27:29,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:29,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 26 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:27:29,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:29,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:27:29,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:29,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 29 transitions. cyclomatic complexity: 7 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:27:29,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:29,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 26 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:27:29,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:29,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:27:29,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:29,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 29 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:27:29,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:29,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 26 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:27:29,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:29,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:27:29,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:29,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 29 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:27:29,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:29,975 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:27:29,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:27:29,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2020-07-29 03:27:29,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:27:29,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:29,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:27:29,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:29,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:27:29,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:29,978 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. cyclomatic complexity: 7 [2020-07-29 03:27:29,979 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:27:29,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2020-07-29 03:27:29,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:27:29,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:27:29,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:27:29,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:27:29,980 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:27:29,980 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:27:29,980 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:27:29,981 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 03:27:29,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:27:29,981 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:27:29,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:27:29,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:27:29 BoogieIcfgContainer [2020-07-29 03:27:29,988 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:27:29,989 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:27:29,989 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:27:29,989 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:27:29,989 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:27:20" (3/4) ... [2020-07-29 03:27:29,993 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:27:29,993 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:27:29,995 INFO L168 Benchmark]: Toolchain (without parser) took 11406.05 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 336.1 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -138.6 MB). Peak memory consumption was 197.4 MB. Max. memory is 11.5 GB. [2020-07-29 03:27:29,996 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:27:29,997 INFO L168 Benchmark]: CACSL2BoogieTranslator took 856.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -163.0 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2020-07-29 03:27:29,997 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2020-07-29 03:27:29,998 INFO L168 Benchmark]: Boogie Preprocessor took 37.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:27:29,998 INFO L168 Benchmark]: RCFGBuilder took 502.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2020-07-29 03:27:29,999 INFO L168 Benchmark]: BuchiAutomizer took 9917.97 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -7.7 MB). Peak memory consumption was 176.9 MB. Max. memory is 11.5 GB. [2020-07-29 03:27:30,000 INFO L168 Benchmark]: Witness Printer took 4.64 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:27:30,003 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 856.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -163.0 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 78.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.51 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 502.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9917.97 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -7.7 MB). Peak memory consumption was 176.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.64 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. 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 -1 * i + len 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 9.8s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 8.3s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.1s 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, 143 SDslu, 108 SDs, 0 SdLazy, 92 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU4 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital256 mio100 ax111 hnf101 lsp83 ukn54 mio100 lsp51 div100 bol100 ite100 ukn100 eq187 hnf92 smp100 dnf119 smp90 tf100 neg95 sie122 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...