./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.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_3.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 95f114a9b30107b01a4872fae9e8e5c20e3a4272 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:18,988 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:27:18,990 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:27:19,003 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:27:19,003 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:27:19,004 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:27:19,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:27:19,008 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:27:19,010 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:27:19,011 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:27:19,012 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:27:19,013 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:27:19,013 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:27:19,014 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:27:19,015 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:27:19,017 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:27:19,017 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:27:19,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:27:19,021 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:27:19,023 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:27:19,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:27:19,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:27:19,027 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:27:19,028 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:27:19,031 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:27:19,031 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:27:19,031 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:27:19,032 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:27:19,033 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:27:19,034 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:27:19,034 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:27:19,035 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:27:19,036 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:27:19,037 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:27:19,038 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:27:19,038 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:27:19,039 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:27:19,039 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:27:19,039 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:27:19,040 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:27:19,041 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:27:19,042 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:19,059 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:27:19,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:27:19,060 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:27:19,060 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:27:19,061 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:27:19,061 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:27:19,061 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:27:19,061 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:27:19,062 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:27:19,062 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:27:19,062 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:27:19,062 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:27:19,062 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:27:19,063 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:27:19,063 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:27:19,063 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:27:19,063 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:27:19,064 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:27:19,064 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:27:19,064 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:27:19,064 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:27:19,064 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:27:19,065 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:27:19,065 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:27:19,065 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:27:19,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:27:19,066 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:27:19,066 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:27:19,066 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:27:19,066 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:27:19,067 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:27:19,067 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:27:19,068 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:27:19,068 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 -> 95f114a9b30107b01a4872fae9e8e5c20e3a4272 [2020-07-29 03:27:19,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:27:19,446 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:27:19,450 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:27:19,451 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:27:19,452 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:27:19,452 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i [2020-07-29 03:27:19,514 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f1931abe/4e73838312ab4134bf8098160f9a602b/FLAG457da81e4 [2020-07-29 03:27:20,013 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:27:20,014 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i [2020-07-29 03:27:20,041 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f1931abe/4e73838312ab4134bf8098160f9a602b/FLAG457da81e4 [2020-07-29 03:27:20,322 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f1931abe/4e73838312ab4134bf8098160f9a602b [2020-07-29 03:27:20,326 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:27:20,328 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:27:20,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:27:20,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:27:20,332 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:27:20,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:27:20" (1/1) ... [2020-07-29 03:27:20,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c728ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:20, skipping insertion in model container [2020-07-29 03:27:20,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:27:20" (1/1) ... [2020-07-29 03:27:20,347 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:27:20,423 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:27:21,010 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:27:21,042 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:27:21,123 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:27:21,215 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:27:21,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:21 WrapperNode [2020-07-29 03:27:21,216 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:27:21,217 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:27:21,218 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:27:21,218 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:27:21,228 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:21" (1/1) ... [2020-07-29 03:27:21,252 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:21" (1/1) ... [2020-07-29 03:27:21,279 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:27:21,280 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:27:21,280 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:27:21,280 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:27:21,288 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:21" (1/1) ... [2020-07-29 03:27:21,288 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:21" (1/1) ... [2020-07-29 03:27:21,292 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:21" (1/1) ... [2020-07-29 03:27:21,292 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:21" (1/1) ... [2020-07-29 03:27:21,303 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:21" (1/1) ... [2020-07-29 03:27:21,313 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:21" (1/1) ... [2020-07-29 03:27:21,318 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:21" (1/1) ... [2020-07-29 03:27:21,322 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:27:21,322 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:27:21,322 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:27:21,323 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:27:21,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:21" (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:21,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 03:27:21,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-29 03:27:21,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 03:27:21,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-07-29 03:27:21,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:27:21,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:27:21,741 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:27:21,742 INFO L295 CfgBuilder]: Removed 11 assume(true) statements. [2020-07-29 03:27:21,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:27:21 BoogieIcfgContainer [2020-07-29 03:27:21,746 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:27:21,746 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:27:21,747 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:27:21,750 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:27:21,752 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:27:21,752 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:27:20" (1/3) ... [2020-07-29 03:27:21,753 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c6d384d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:27:21, skipping insertion in model container [2020-07-29 03:27:21,753 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:27:21,754 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:27:21" (2/3) ... [2020-07-29 03:27:21,754 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c6d384d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:27:21, skipping insertion in model container [2020-07-29 03:27:21,754 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:27:21,754 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:27:21" (3/3) ... [2020-07-29 03:27:21,756 INFO L371 chiAutomizerObserver]: Analyzing ICFG memleaks_test18_3.i [2020-07-29 03:27:21,813 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:27:21,813 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:27:21,813 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:27:21,813 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:27:21,814 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:27:21,814 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:27:21,814 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:27:21,814 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:27:21,828 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-29 03:27:21,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:27:21,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:21,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:21,863 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 03:27:21,864 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:27:21,864 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:27:21,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-29 03:27:21,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:27:21,867 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:21,867 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:21,868 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 03:27:21,868 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:27:21,872 INFO L794 eck$LassoCheckResult]: Stem: 5#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); 3#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_~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_~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; 10#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; 6#L765true assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 11#L766-3true [2020-07-29 03:27:21,873 INFO L796 eck$LassoCheckResult]: Loop: 11#L766-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; 7#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; 12#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;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); 9#L766-2true entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 11#L766-3true [2020-07-29 03:27:21,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:21,879 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2020-07-29 03:27:21,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:21,890 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325311082] [2020-07-29 03:27:21,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:22,126 INFO L280 TraceCheckUtils]: 0: Hoare triple {15#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); {15#true} is VALID [2020-07-29 03:27:22,127 INFO L280 TraceCheckUtils]: 1: Hoare triple {15#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_~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_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; {15#true} is VALID [2020-07-29 03:27:22,128 INFO L280 TraceCheckUtils]: 2: Hoare triple {15#true} assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; {17#(and (= 0 |ULTIMATE.start_ldv_malloc_#res.base|) (= 0 |ULTIMATE.start_ldv_malloc_#res.offset|))} is VALID [2020-07-29 03:27:22,130 INFO L280 TraceCheckUtils]: 3: Hoare triple {17#(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; {18#(and (= ULTIMATE.start_entry_point_~array~0.base 0) (= 0 ULTIMATE.start_entry_point_~array~0.offset))} is VALID [2020-07-29 03:27:22,131 INFO L280 TraceCheckUtils]: 4: Hoare triple {18#(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); {16#false} is VALID [2020-07-29 03:27:22,134 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:22,134 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325311082] [2020-07-29 03:27:22,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:27:22,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:27:22,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406605985] [2020-07-29 03:27:22,142 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:27:22,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:22,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 1 times [2020-07-29 03:27:22,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:22,144 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748954583] [2020-07-29 03:27:22,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:22,168 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:22,184 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:22,206 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:22,322 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-07-29 03:27:22,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:27:22,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 03:27:22,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 03:27:22,491 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 4 states. [2020-07-29 03:27:22,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:27:22,633 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-29 03:27:22,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:27:22,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:27:22,647 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:22,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 23 transitions. [2020-07-29 03:27:22,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:27:22,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 12 states and 13 transitions. [2020-07-29 03:27:22,659 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 03:27:22,660 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-29 03:27:22,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2020-07-29 03:27:22,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:27:22,661 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2020-07-29 03:27:22,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2020-07-29 03:27:22,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 9. [2020-07-29 03:27:22,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:27:22,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 13 transitions. Second operand 9 states. [2020-07-29 03:27:22,693 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 13 transitions. Second operand 9 states. [2020-07-29 03:27:22,695 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 9 states. [2020-07-29 03:27:22,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:27:22,697 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2020-07-29 03:27:22,698 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2020-07-29 03:27:22,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:22,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:22,699 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 12 states and 13 transitions. [2020-07-29 03:27:22,700 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 12 states and 13 transitions. [2020-07-29 03:27:22,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:27:22,702 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2020-07-29 03:27:22,702 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2020-07-29 03:27:22,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:22,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:22,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:27:22,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:27:22,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 03:27:22,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2020-07-29 03:27:22,707 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-07-29 03:27:22,707 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-07-29 03:27:22,707 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:27:22,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2020-07-29 03:27:22,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:27:22,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:22,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:22,709 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 03:27:22,709 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:27:22,710 INFO L794 eck$LassoCheckResult]: Stem: 48#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); 45#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_~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_~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; 46#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; 47#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; 51#L765 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 52#L766-3 [2020-07-29 03:27:22,710 INFO L796 eck$LassoCheckResult]: Loop: 52#L766-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; 49#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; 50#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;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); 53#L766-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 52#L766-3 [2020-07-29 03:27:22,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:22,711 INFO L82 PathProgramCache]: Analyzing trace with hash 28693831, now seen corresponding path program 1 times [2020-07-29 03:27:22,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:22,712 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600880727] [2020-07-29 03:27:22,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:22,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:22,732 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:22,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:22,746 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:22,751 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:22,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:22,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 2 times [2020-07-29 03:27:22,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:22,753 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532687783] [2020-07-29 03:27:22,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:22,767 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:22,799 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:22,808 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:22,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:22,809 INFO L82 PathProgramCache]: Analyzing trace with hash -592037012, now seen corresponding path program 1 times [2020-07-29 03:27:22,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:22,810 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054673800] [2020-07-29 03:27:22,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:22,839 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:22,865 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:22,872 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:22,979 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-07-29 03:27:23,311 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2020-07-29 03:27:23,440 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:27:23,441 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:27:23,441 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:27:23,441 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:27:23,441 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:27:23,442 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:23,442 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:27:23,442 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:27:23,442 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_3.i_Iteration2_Lasso [2020-07-29 03:27:23,442 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:27:23,443 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:27:23,504 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,521 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,526 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,531 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,535 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,541 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,545 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,550 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,556 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,561 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,811 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2020-07-29 03:27:23,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:23,927 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,932 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,940 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:24,864 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2020-07-29 03:27:25,043 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:27:25,051 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:25,065 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:25,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:25,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:25,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:25,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:25,074 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:25,074 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:25,079 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:25,110 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:25,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:25,113 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:25,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:25,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:25,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:25,115 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:25,115 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:25,122 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:25,152 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:25,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:25,154 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:25,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:25,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:25,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:25,155 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:25,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:25,157 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:25,183 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:25,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:25,185 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:25,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:25,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:25,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:25,186 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:25,187 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:25,188 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:25,213 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:25,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:25,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:25,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:25,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:25,217 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:25,218 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:25,224 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:25,259 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:25,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:25,264 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:25,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:25,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:25,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:25,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:25,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:25,273 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:25,299 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:25,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:25,300 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:25,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:25,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:25,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:25,301 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:25,301 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:25,303 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:25,329 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:25,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:25,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:25,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:25,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:25,333 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:25,333 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:25,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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:27:25,401 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:25,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:25,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:25,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:25,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:27:25,412 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:25,412 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:25,419 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:25,447 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:25,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:25,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:25,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:25,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:25,453 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:25,453 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:25,457 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:25,491 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:25,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:25,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:25,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:25,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:25,497 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:25,498 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:25,503 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:25,526 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:25,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:25,528 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:27:25,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:25,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:25,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:25,529 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:27:25,529 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:27:25,530 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:25,553 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:25,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:27:25,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:27:25,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:27:25,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:27:25,576 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:27:25,576 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:27:25,604 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:27:25,640 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-07-29 03:27:25,640 INFO L444 ModelExtractionUtils]: 18 out of 43 variables were initially zero. Simplification set additionally 20 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:25,652 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:27:25,655 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 03:27:25,655 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:27:25,656 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~i~0) = -2*ULTIMATE.start_entry_point_~i~0 + 19 Supporting invariants [-1*ULTIMATE.start_entry_point_~len~0 + 10 >= 0] [2020-07-29 03:27:25,732 INFO L297 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2020-07-29 03:27:25,740 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;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:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:25,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:25,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 03:27:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:25,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:27:25,848 INFO L280 TraceCheckUtils]: 0: Hoare triple {87#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); {87#unseeded} is VALID [2020-07-29 03:27:25,849 INFO L280 TraceCheckUtils]: 1: Hoare triple {87#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_~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_~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; {131#(and (>= (+ (* (- 1) ULTIMATE.start_entry_point_~len~0) 10) 0) unseeded)} is VALID [2020-07-29 03:27:25,851 INFO L280 TraceCheckUtils]: 2: Hoare triple {131#(and (>= (+ (* (- 1) ULTIMATE.start_entry_point_~len~0) 10) 0) 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; {131#(and (>= (+ (* (- 1) ULTIMATE.start_entry_point_~len~0) 10) 0) unseeded)} is VALID [2020-07-29 03:27:25,852 INFO L280 TraceCheckUtils]: 3: Hoare triple {131#(and (>= (+ (* (- 1) ULTIMATE.start_entry_point_~len~0) 10) 0) 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; {131#(and (>= (+ (* (- 1) ULTIMATE.start_entry_point_~len~0) 10) 0) unseeded)} is VALID [2020-07-29 03:27:25,853 INFO L280 TraceCheckUtils]: 4: Hoare triple {131#(and (>= (+ (* (- 1) ULTIMATE.start_entry_point_~len~0) 10) 0) unseeded)} assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); {131#(and (>= (+ (* (- 1) ULTIMATE.start_entry_point_~len~0) 10) 0) unseeded)} is VALID [2020-07-29 03:27:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:25,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 03:27:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:27:25,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:27:25,913 INFO L280 TraceCheckUtils]: 0: Hoare triple {132#(and (>= oldRank0 (+ (* (- 2) ULTIMATE.start_entry_point_~i~0) 19)) (>= (+ (* (- 1) ULTIMATE.start_entry_point_~len~0) 10) 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; {152#(and (< ULTIMATE.start_entry_point_~i~0 ULTIMATE.start_entry_point_~len~0) (<= 19 (+ (* 2 ULTIMATE.start_entry_point_~i~0) oldRank0)) (<= ULTIMATE.start_entry_point_~len~0 10))} is VALID [2020-07-29 03:27:25,915 INFO L280 TraceCheckUtils]: 1: Hoare triple {152#(and (< ULTIMATE.start_entry_point_~i~0 ULTIMATE.start_entry_point_~len~0) (<= 19 (+ (* 2 ULTIMATE.start_entry_point_~i~0) oldRank0)) (<= ULTIMATE.start_entry_point_~len~0 10))} 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; {152#(and (< ULTIMATE.start_entry_point_~i~0 ULTIMATE.start_entry_point_~len~0) (<= 19 (+ (* 2 ULTIMATE.start_entry_point_~i~0) oldRank0)) (<= ULTIMATE.start_entry_point_~len~0 10))} is VALID [2020-07-29 03:27:25,916 INFO L280 TraceCheckUtils]: 2: Hoare triple {152#(and (< ULTIMATE.start_entry_point_~i~0 ULTIMATE.start_entry_point_~len~0) (<= 19 (+ (* 2 ULTIMATE.start_entry_point_~i~0) oldRank0)) (<= ULTIMATE.start_entry_point_~len~0 10))} 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;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); {152#(and (< ULTIMATE.start_entry_point_~i~0 ULTIMATE.start_entry_point_~len~0) (<= 19 (+ (* 2 ULTIMATE.start_entry_point_~i~0) oldRank0)) (<= ULTIMATE.start_entry_point_~len~0 10))} is VALID [2020-07-29 03:27:25,918 INFO L280 TraceCheckUtils]: 3: Hoare triple {152#(and (< ULTIMATE.start_entry_point_~i~0 ULTIMATE.start_entry_point_~len~0) (<= 19 (+ (* 2 ULTIMATE.start_entry_point_~i~0) oldRank0)) (<= ULTIMATE.start_entry_point_~len~0 10))} entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; {134#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) ULTIMATE.start_entry_point_~i~0) 19))) unseeded) (>= (+ (* (- 1) ULTIMATE.start_entry_point_~len~0) 10) 0))} is VALID [2020-07-29 03:27:25,919 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,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:27:25,937 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:27:25,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 03:27:25,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:25,942 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 03:27:25,943 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 4 states. [2020-07-29 03:27:26,030 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 2. Second operand 4 states. Result 13 states and 16 transitions. Complement of second has 5 states. [2020-07-29 03:27:26,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 03:27:26,031 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:27:26,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. cyclomatic complexity: 2 [2020-07-29 03:27:26,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:26,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:26,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 03:27:26,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:27:26,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:26,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:26,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2020-07-29 03:27:26,037 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:27:26,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:27:26,040 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states and 10 transitions. cyclomatic complexity: 2 [2020-07-29 03:27:26,041 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 03:27:26,042 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 03:27:26,043 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:27:26,045 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:27:26,045 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 16 transitions. cyclomatic complexity: 4 [2020-07-29 03:27:26,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. cyclomatic complexity: 4 [2020-07-29 03:27:26,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:27:26,045 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:27:26,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 4 letters. [2020-07-29 03:27:26,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:26,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 03:27:26,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:26,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 4 letters. [2020-07-29 03:27:26,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:26,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:27:26,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:26,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:27:26,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:26,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:27:26,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:26,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 2 Stem has 13 letters. Loop has 13 letters. [2020-07-29 03:27:26,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:26,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 03:27:26,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:26,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 4 Stem has 13 letters. Loop has 13 letters. [2020-07-29 03:27:26,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:26,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 2 Stem has 9 letters. Loop has 9 letters. [2020-07-29 03:27:26,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:26,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 03:27:26,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:26,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 9 letters. [2020-07-29 03:27:26,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:26,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:27:26,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:26,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:27:26,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:26,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:27:26,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:26,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:27:26,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:26,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:27:26,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:26,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:27:26,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:26,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:27:26,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:26,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:27:26,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:26,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:27:26,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:26,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 4 letters. [2020-07-29 03:27:26,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:26,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 03:27:26,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:26,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 4 letters. [2020-07-29 03:27:26,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:26,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 2 Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:27:26,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:26,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:27:26,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:26,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:27:26,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:26,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:27:26,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:26,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:27:26,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:26,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:27:26,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:26,070 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:27:26,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 03:27:26,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2020-07-29 03:27:26,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-29 03:27:26,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:26,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:27:26,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:26,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 5 letters. Loop has 8 letters. [2020-07-29 03:27:26,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:27:26,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. cyclomatic complexity: 4 [2020-07-29 03:27:26,080 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:27:26,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 0 states and 0 transitions. [2020-07-29 03:27:26,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:27:26,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:27:26,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:27:26,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:27:26,081 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:27:26,082 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:27:26,082 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:27:26,082 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:27:26,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:27:26,082 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:27:26,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:27:26,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:27:26 BoogieIcfgContainer [2020-07-29 03:27:26,090 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:27:26,090 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:27:26,091 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:27:26,091 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:27:26,091 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:21" (3/4) ... [2020-07-29 03:27:26,095 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:27:26,095 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:27:26,100 INFO L168 Benchmark]: Toolchain (without parser) took 5771.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 952.2 MB in the beginning and 854.9 MB in the end (delta: 97.2 MB). Peak memory consumption was 268.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:27:26,102 INFO L168 Benchmark]: CDTParser took 0.20 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:26,107 INFO L168 Benchmark]: CACSL2BoogieTranslator took 888.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 72.4 MB). Free memory was 952.2 MB in the beginning and 1.0 GB in the end (delta: -79.1 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2020-07-29 03:27:26,108 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.89 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:27:26,109 INFO L168 Benchmark]: Boogie Preprocessor took 42.22 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:27:26,110 INFO L168 Benchmark]: RCFGBuilder took 423.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2020-07-29 03:27:26,111 INFO L168 Benchmark]: BuchiAutomizer took 4343.58 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 99.1 MB). Free memory was 1.0 GB in the beginning and 854.9 MB in the end (delta: 150.8 MB). Peak memory consumption was 249.9 MB. Max. memory is 11.5 GB. [2020-07-29 03:27:26,112 INFO L168 Benchmark]: Witness Printer took 5.23 ms. Allocated memory is still 1.2 GB. Free memory is still 854.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:27:26,128 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.20 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 888.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 72.4 MB). Free memory was 952.2 MB in the beginning and 1.0 GB in the end (delta: -79.1 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.89 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.22 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 423.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4343.58 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 99.1 MB). Free memory was 1.0 GB in the beginning and 854.9 MB in the end (delta: 150.8 MB). Peak memory consumption was 249.9 MB. Max. memory is 11.5 GB. * Witness Printer took 5.23 ms. Allocated memory is still 1.2 GB. Free memory is still 854.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 19 and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 9 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 25 SDtfs, 16 SDslu, 22 SDs, 0 SdLazy, 20 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital253 mio100 ax111 hnf101 lsp86 ukn64 mio100 lsp57 div100 bol100 ite100 ukn100 eq201 hnf88 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms 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...