./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c08b1dac-9587-4b3e-b31a-7c08ca921127/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c08b1dac-9587-4b3e-b31a-7c08ca921127/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c08b1dac-9587-4b3e-b31a-7c08ca921127/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c08b1dac-9587-4b3e-b31a-7c08ca921127/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c08b1dac-9587-4b3e-b31a-7c08ca921127/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c08b1dac-9587-4b3e-b31a-7c08ca921127/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6b4114bc6a0e883536dbadf27d0e1e27273e6b7c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_c08b1dac-9587-4b3e-b31a-7c08ca921127/bin/uautomizer/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:01:31,169 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:01:31,171 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:01:31,187 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:01:31,188 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:01:31,189 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:01:31,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:01:31,203 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:01:31,206 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:01:31,207 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:01:31,208 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:01:31,210 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:01:31,210 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:01:31,211 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:01:31,212 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:01:31,213 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:01:31,214 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:01:31,215 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:01:31,218 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:01:31,224 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:01:31,229 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:01:31,232 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:01:31,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:01:31,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:01:31,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:01:31,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:01:31,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:01:31,244 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:01:31,245 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:01:31,246 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:01:31,246 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:01:31,247 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:01:31,248 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:01:31,248 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:01:31,250 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:01:31,250 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:01:31,251 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:01:31,251 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:01:31,252 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:01:31,252 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:01:31,253 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:01:31,254 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c08b1dac-9587-4b3e-b31a-7c08ca921127/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 22:01:31,283 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:01:31,284 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:01:31,287 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:01:31,287 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:01:31,287 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:01:31,288 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:01:31,288 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:01:31,288 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:01:31,288 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:01:31,289 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:01:31,290 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:01:31,290 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:01:31,290 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:01:31,291 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:01:31,291 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:01:31,291 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:01:31,291 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:01:31,292 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:01:31,292 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:01:31,292 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:01:31,292 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:01:31,293 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:01:31,293 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:01:31,293 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:01:31,294 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:01:31,294 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:01:31,294 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:01:31,294 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:01:31,297 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:01:31,298 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_c08b1dac-9587-4b3e-b31a-7c08ca921127/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6b4114bc6a0e883536dbadf27d0e1e27273e6b7c [2019-11-15 22:01:31,339 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:01:31,353 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:01:31,357 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:01:31,358 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:01:31,359 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:01:31,360 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c08b1dac-9587-4b3e-b31a-7c08ca921127/bin/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex1.i [2019-11-15 22:01:31,428 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c08b1dac-9587-4b3e-b31a-7c08ca921127/bin/uautomizer/data/c72ee7633/3367d52a4949457d889b10ab77ce7eac/FLAG33df31bde [2019-11-15 22:01:31,849 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:01:31,850 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c08b1dac-9587-4b3e-b31a-7c08ca921127/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex1.i [2019-11-15 22:01:31,856 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c08b1dac-9587-4b3e-b31a-7c08ca921127/bin/uautomizer/data/c72ee7633/3367d52a4949457d889b10ab77ce7eac/FLAG33df31bde [2019-11-15 22:01:32,273 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c08b1dac-9587-4b3e-b31a-7c08ca921127/bin/uautomizer/data/c72ee7633/3367d52a4949457d889b10ab77ce7eac [2019-11-15 22:01:32,275 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:01:32,276 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:01:32,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:01:32,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:01:32,281 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:01:32,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:01:32" (1/1) ... [2019-11-15 22:01:32,284 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12abb9a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:01:32, skipping insertion in model container [2019-11-15 22:01:32,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:01:32" (1/1) ... [2019-11-15 22:01:32,295 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:01:32,311 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:01:32,639 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:01:32,656 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:01:32,680 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:01:32,698 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:01:32,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:01:32 WrapperNode [2019-11-15 22:01:32,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:01:32,701 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:01:32,701 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:01:32,702 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:01:32,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:01:32" (1/1) ... [2019-11-15 22:01:32,725 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:01:32" (1/1) ... [2019-11-15 22:01:32,747 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:01:32,747 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:01:32,748 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:01:32,748 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:01:32,757 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:01:32" (1/1) ... [2019-11-15 22:01:32,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:01:32" (1/1) ... [2019-11-15 22:01:32,771 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:01:32" (1/1) ... [2019-11-15 22:01:32,771 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:01:32" (1/1) ... [2019-11-15 22:01:32,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:01:32" (1/1) ... [2019-11-15 22:01:32,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:01:32" (1/1) ... [2019-11-15 22:01:32,781 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:01:32" (1/1) ... [2019-11-15 22:01:32,783 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:01:32,784 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:01:32,784 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:01:32,784 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:01:32,786 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:01:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c08b1dac-9587-4b3e-b31a-7c08ca921127/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:01:32,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:01:32,864 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2019-11-15 22:01:32,864 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2019-11-15 22:01:32,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:01:32,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:01:32,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:01:32,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:01:32,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:01:33,194 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:01:33,195 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 22:01:33,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:01:33 BoogieIcfgContainer [2019-11-15 22:01:33,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:01:33,197 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:01:33,197 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:01:33,210 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:01:33,211 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:01:33,211 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:01:32" (1/3) ... [2019-11-15 22:01:33,212 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@bb35991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:01:33, skipping insertion in model container [2019-11-15 22:01:33,212 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:01:33,213 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:01:32" (2/3) ... [2019-11-15 22:01:33,222 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@bb35991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:01:33, skipping insertion in model container [2019-11-15 22:01:33,223 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:01:33,223 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:01:33" (3/3) ... [2019-11-15 22:01:33,225 INFO L371 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex1.i [2019-11-15 22:01:33,307 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:01:33,307 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:01:33,308 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:01:33,308 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:01:33,308 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:01:33,308 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:01:33,308 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:01:33,308 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:01:33,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-15 22:01:33,353 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 22:01:33,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:01:33,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:01:33,362 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 22:01:33,362 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:01:33,362 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:01:33,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-15 22:01:33,370 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 22:01:33,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:01:33,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:01:33,371 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 22:01:33,371 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:01:33,378 INFO L791 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~nondet8, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet7;call write~int(main_#t~nondet8, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet8; 18#L28-3true [2019-11-15 22:01:33,378 INFO L793 eck$LassoCheckResult]: Loop: 18#L28-3true call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 4#L28-1true assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem10;call write~int(-1, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 9#L31true call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem11);< 3#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 10#L9true assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~post2;havoc #t~mem1; 15#recFINALtrue assume true; 13#recEXITtrue >#33#return; 6#L31-1true havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem13 := read~int(main_~pp~0.base, main_~pp~0.offset, 4);call write~int(main_#t~mem12 + main_#t~mem13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem12;havoc main_#t~mem13; 18#L28-3true [2019-11-15 22:01:33,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:01:33,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2019-11-15 22:01:33,390 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:01:33,390 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879826495] [2019-11-15 22:01:33,390 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:33,391 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:33,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:01:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:01:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:01:33,535 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:01:33,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:01:33,536 INFO L82 PathProgramCache]: Analyzing trace with hash 51331199, now seen corresponding path program 1 times [2019-11-15 22:01:33,536 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:01:33,536 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899656639] [2019-11-15 22:01:33,536 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:33,536 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:33,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:01:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:01:33,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:01:33,613 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:01:33,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:01:33,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1890018113, now seen corresponding path program 1 times [2019-11-15 22:01:33,615 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:01:33,615 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269727512] [2019-11-15 22:01:33,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:33,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:33,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:01:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:33,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:01:33,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269727512] [2019-11-15 22:01:33,886 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:01:33,886 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:01:33,886 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246785990] [2019-11-15 22:01:34,473 WARN L191 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 74 [2019-11-15 22:01:34,527 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:01:34,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:01:34,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:01:34,545 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 8 states. [2019-11-15 22:01:34,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:01:34,701 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-11-15 22:01:34,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:01:34,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2019-11-15 22:01:34,707 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 22:01:34,716 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 14 states and 16 transitions. [2019-11-15 22:01:34,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 22:01:34,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 22:01:34,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2019-11-15 22:01:34,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:01:34,722 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-15 22:01:34,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2019-11-15 22:01:34,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-15 22:01:34,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-15 22:01:34,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-11-15 22:01:34,750 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-15 22:01:34,750 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-15 22:01:34,750 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:01:34,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2019-11-15 22:01:34,751 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 22:01:34,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:01:34,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:01:34,752 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 22:01:34,752 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:01:34,753 INFO L791 eck$LassoCheckResult]: Stem: 65#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 58#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~nondet8, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet7;call write~int(main_#t~nondet8, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet8; 59#L28-3 [2019-11-15 22:01:34,753 INFO L793 eck$LassoCheckResult]: Loop: 59#L28-3 call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 66#L28-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem10;call write~int(-1, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 60#L31 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem11);< 61#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 62#L9 assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; 63#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 61#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 62#L9 assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~post2;havoc #t~mem1; 64#recFINAL assume true; 67#recEXIT >#31#return; 68#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 70#recFINAL assume true; 71#recEXIT >#33#return; 69#L31-1 havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem13 := read~int(main_~pp~0.base, main_~pp~0.offset, 4);call write~int(main_#t~mem12 + main_#t~mem13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem12;havoc main_#t~mem13; 59#L28-3 [2019-11-15 22:01:34,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:01:34,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2019-11-15 22:01:34,753 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:01:34,754 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928751410] [2019-11-15 22:01:34,754 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:34,754 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:34,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:01:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:01:34,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:01:34,774 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:01:34,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:01:34,775 INFO L82 PathProgramCache]: Analyzing trace with hash 198344305, now seen corresponding path program 1 times [2019-11-15 22:01:34,775 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:01:34,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917454039] [2019-11-15 22:01:34,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:34,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:34,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:01:34,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:34,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:34,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:01:34,987 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917454039] [2019-11-15 22:01:34,987 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932144020] [2019-11-15 22:01:34,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c08b1dac-9587-4b3e-b31a-7c08ca921127/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:01:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:35,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 22:01:35,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:01:35,139 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2019-11-15 22:01:35,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:35,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 22:01:35,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:01:35,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 22:01:35,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:7 [2019-11-15 22:01:35,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:01:35,230 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:01:35,231 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2019-11-15 22:01:35,231 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120064121] [2019-11-15 22:01:35,232 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 22:01:35,232 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:01:35,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 22:01:35,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:01:35,233 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand 13 states. [2019-11-15 22:01:35,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:01:35,457 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-11-15 22:01:35,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:01:35,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2019-11-15 22:01:35,460 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 22:01:35,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2019-11-15 22:01:35,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-15 22:01:35,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 22:01:35,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2019-11-15 22:01:35,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:01:35,462 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-15 22:01:35,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2019-11-15 22:01:35,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-15 22:01:35,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 22:01:35,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-11-15 22:01:35,466 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-15 22:01:35,466 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-15 22:01:35,466 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:01:35,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2019-11-15 22:01:35,468 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 22:01:35,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:01:35,468 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:01:35,473 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 22:01:35,473 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 22:01:35,473 INFO L791 eck$LassoCheckResult]: Stem: 171#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 164#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~nondet8, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet7;call write~int(main_#t~nondet8, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet8; 165#L28-3 [2019-11-15 22:01:35,474 INFO L793 eck$LassoCheckResult]: Loop: 165#L28-3 call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 172#L28-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem10;call write~int(-1, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 166#L31 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem11);< 167#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 168#L9 assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; 169#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 167#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 168#L9 assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; 169#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 167#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 168#L9 assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~post2;havoc #t~mem1; 170#recFINAL assume true; 173#recEXIT >#31#return; 174#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 175#recFINAL assume true; 176#recEXIT >#31#return; 179#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 180#recFINAL assume true; 178#recEXIT >#33#return; 177#L31-1 havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem13 := read~int(main_~pp~0.base, main_~pp~0.offset, 4);call write~int(main_#t~mem12 + main_#t~mem13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem12;havoc main_#t~mem13; 165#L28-3 [2019-11-15 22:01:35,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:01:35,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 3 times [2019-11-15 22:01:35,474 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:01:35,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558880506] [2019-11-15 22:01:35,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:35,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:35,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:01:35,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:01:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:01:35,518 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:01:35,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:01:35,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1148543297, now seen corresponding path program 2 times [2019-11-15 22:01:35,520 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:01:35,520 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791156669] [2019-11-15 22:01:35,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:35,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:35,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:01:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:35,797 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 22:01:35,797 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791156669] [2019-11-15 22:01:35,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592988404] [2019-11-15 22:01:35,798 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c08b1dac-9587-4b3e-b31a-7c08ca921127/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:01:35,861 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:01:35,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:01:35,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 22:01:35,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:01:35,895 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2019-11-15 22:01:35,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:35,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 22:01:35,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:01:35,918 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 22:01:35,918 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:7 [2019-11-15 22:01:35,973 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 22:01:35,974 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:01:35,974 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2019-11-15 22:01:35,974 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438316605] [2019-11-15 22:01:35,975 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 22:01:35,975 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:01:35,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 22:01:35,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:01:35,976 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 13 states. [2019-11-15 22:01:36,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:01:36,169 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-11-15 22:01:36,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:01:36,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2019-11-15 22:01:36,172 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 22:01:36,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2019-11-15 22:01:36,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-15 22:01:36,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-15 22:01:36,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2019-11-15 22:01:36,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:01:36,174 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-11-15 22:01:36,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2019-11-15 22:01:36,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-15 22:01:36,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-15 22:01:36,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-11-15 22:01:36,177 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-11-15 22:01:36,177 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-11-15 22:01:36,177 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 22:01:36,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2019-11-15 22:01:36,179 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 22:01:36,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:01:36,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:01:36,180 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 22:01:36,180 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2019-11-15 22:01:36,180 INFO L791 eck$LassoCheckResult]: Stem: 319#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 317#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~nondet8, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet7;call write~int(main_#t~nondet8, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet8; 318#L28-3 [2019-11-15 22:01:36,184 INFO L793 eck$LassoCheckResult]: Loop: 318#L28-3 call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 320#L28-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem10;call write~int(-1, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 312#L31 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem11);< 313#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 314#L9 assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; 315#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 313#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 314#L9 assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; 315#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 313#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 314#L9 assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; 315#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 313#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 314#L9 assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~post2;havoc #t~mem1; 316#recFINAL assume true; 321#recEXIT >#31#return; 322#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 324#recFINAL assume true; 331#recEXIT >#31#return; 330#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 329#recFINAL assume true; 328#recEXIT >#31#return; 326#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 327#recFINAL assume true; 325#recEXIT >#33#return; 323#L31-1 havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem13 := read~int(main_~pp~0.base, main_~pp~0.offset, 4);call write~int(main_#t~mem12 + main_#t~mem13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem12;havoc main_#t~mem13; 318#L28-3 [2019-11-15 22:01:36,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:01:36,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 4 times [2019-11-15 22:01:36,185 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:01:36,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746217884] [2019-11-15 22:01:36,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:36,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:36,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:01:36,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:01:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:01:36,216 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:01:36,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:01:36,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1161179343, now seen corresponding path program 3 times [2019-11-15 22:01:36,218 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:01:36,219 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711005150] [2019-11-15 22:01:36,219 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:36,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:36,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:01:36,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:01:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:01:36,374 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:01:36,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:01:36,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1853588851, now seen corresponding path program 1 times [2019-11-15 22:01:36,375 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:01:36,375 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264417201] [2019-11-15 22:01:36,375 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:36,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:36,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:01:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:01:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:01:36,542 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:01:36,905 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2019-11-15 22:01:37,397 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 99 [2019-11-15 22:01:37,688 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-15 22:01:38,059 WARN L191 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 116 [2019-11-15 22:01:38,326 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-11-15 22:01:38,481 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-11-15 22:01:39,306 WARN L191 SmtUtils]: Spent 819.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 134 [2019-11-15 22:01:39,579 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-11-15 22:01:39,696 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-11-15 22:01:39,762 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:01:39,762 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:01:39,762 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:01:39,763 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:01:39,763 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:01:39,763 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:01:39,763 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:01:39,763 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:01:39,763 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex1.i_Iteration4_Lasso [2019-11-15 22:01:39,763 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:01:39,764 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:01:39,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:01:39,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:01:39,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:01:39,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:01:39,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:01:39,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:01:39,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:01:39,952 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-11-15 22:01:40,260 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2019-11-15 22:01:40,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:01:40,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:01:40,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:01:40,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:01:40,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:01:40,714 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 22:01:41,003 WARN L191 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-11-15 22:01:41,025 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:01:41,030 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:01:41,032 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 [2019-11-15 22:01:41,034 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:01:41,035 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:01:41,035 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:01:41,036 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:01:41,036 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:01:41,038 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:01:41,038 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:01:41,040 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:01:41,041 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 [2019-11-15 22:01:41,042 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:01:41,042 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:01:41,042 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:01:41,042 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:01:41,042 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:01:41,043 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:01:41,043 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:01:41,043 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:01:41,044 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 [2019-11-15 22:01:41,045 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:01:41,045 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:01:41,045 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:01:41,045 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:01:41,046 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:01:41,046 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:01:41,046 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:01:41,047 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:01:41,047 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 [2019-11-15 22:01:41,048 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:01:41,048 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:01:41,048 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:01:41,049 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:01:41,049 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:01:41,049 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:01:41,049 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:01:41,050 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:01:41,050 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 [2019-11-15 22:01:41,051 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:01:41,051 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:01:41,051 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:01:41,052 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:01:41,054 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:01:41,054 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:01:41,056 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:01:41,057 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 [2019-11-15 22:01:41,058 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:01:41,058 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:01:41,058 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:01:41,058 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:01:41,058 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:01:41,059 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:01:41,059 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:01:41,060 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:01:41,060 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 [2019-11-15 22:01:41,061 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:01:41,061 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:01:41,061 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:01:41,061 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:01:41,065 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:01:41,065 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:01:41,073 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:01:41,073 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 [2019-11-15 22:01:41,074 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:01:41,074 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:01:41,075 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:01:41,075 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:01:41,078 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:01:41,078 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:01:41,084 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:01:41,085 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 [2019-11-15 22:01:41,086 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:01:41,086 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:01:41,086 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:01:41,086 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:01:41,086 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:01:41,087 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:01:41,087 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:01:41,088 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:01:41,088 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 [2019-11-15 22:01:41,089 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:01:41,089 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:01:41,089 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:01:41,089 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:01:41,094 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:01:41,095 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:01:41,113 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:01:41,114 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 [2019-11-15 22:01:41,115 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:01:41,115 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:01:41,115 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:01:41,115 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:01:41,117 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:01:41,117 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:01:41,120 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:01:41,120 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 [2019-11-15 22:01:41,121 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:01:41,121 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:01:41,121 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:01:41,122 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:01:41,122 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:01:41,122 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:01:41,122 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:01:41,123 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:01:41,124 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 [2019-11-15 22:01:41,124 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:01:41,124 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:01:41,125 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:01:41,125 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:01:41,127 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:01:41,127 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:01:41,141 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:01:41,148 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:01:41,148 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:01:41,151 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:01:41,152 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:01:41,152 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:01:41,153 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1 Supporting invariants [] [2019-11-15 22:01:41,217 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-11-15 22:01:41,222 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 22:01:41,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:01:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:41,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:01:41,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:01:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:41,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 66 conjunts are in the unsatisfiable core [2019-11-15 22:01:41,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:01:41,348 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:01:41,349 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2019-11-15 22:01:41,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:41,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:01:41,404 INFO L567 ElimStorePlain]: treesize reduction 16, result has 76.1 percent of original size [2019-11-15 22:01:41,405 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:01:41,405 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:51 [2019-11-15 22:01:42,273 WARN L191 SmtUtils]: Spent 752.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-11-15 22:01:43,019 WARN L191 SmtUtils]: Spent 689.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-11-15 22:01:44,805 WARN L191 SmtUtils]: Spent 648.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-11-15 22:01:57,389 WARN L191 SmtUtils]: Spent 12.02 s on a formula simplification that was a NOOP. DAG size: 21 [2019-11-15 22:02:21,602 WARN L191 SmtUtils]: Spent 12.09 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-15 22:02:21,609 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 22:02:21,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:02:21,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:02:21,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 22:02:21,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:36, output treesize:35 [2019-11-15 22:02:45,866 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:02:45,866 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-15 22:02:45,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:02:45,927 INFO L567 ElimStorePlain]: treesize reduction 14, result has 83.1 percent of original size [2019-11-15 22:02:45,928 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-11-15 22:02:45,928 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:70, output treesize:69 [2019-11-15 22:02:47,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:02:47,285 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:02:47,286 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 44 [2019-11-15 22:02:47,287 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:02:47,353 INFO L567 ElimStorePlain]: treesize reduction 14, result has 90.3 percent of original size [2019-11-15 22:02:47,354 INFO L496 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-1 vars, End of recursive call: 10 dim-0 vars, and 1 xjuncts. [2019-11-15 22:02:47,355 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 11 variables, input treesize:131, output treesize:130 [2019-11-15 22:02:47,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:47,603 INFO L392 ElimStorePlain]: Different costs {4=[|v_old(#valid)_AFTER_CALL_9|], 7=[v_prenex_10]} [2019-11-15 22:02:47,648 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:02:47,649 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 166 [2019-11-15 22:02:47,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:02:47,805 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-11-15 22:02:47,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:02:47,902 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:02:47,902 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 165 treesize of output 205 [2019-11-15 22:02:47,904 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:02:48,086 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-11-15 22:02:48,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:02:48,088 INFO L392 ElimStorePlain]: Different costs {8=[|v_old(#memory_int)_AFTER_CALL_9|], 18=[v_prenex_4]} [2019-11-15 22:02:48,286 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-11-15 22:02:48,286 INFO L341 Elim1Store]: treesize reduction 69, result has 71.6 percent of original size [2019-11-15 22:02:48,286 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 141 treesize of output 252 [2019-11-15 22:02:48,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:02:48,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:02:48,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:02:48,398 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:02:48,398 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 168 [2019-11-15 22:02:48,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:48,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:48,669 INFO L392 ElimStorePlain]: Different costs {0=[v_arrayElimCell_17, v_arrayElimCell_18, v_arrayElimCell_16], 1=[v_arrayElimCell_15]} [2019-11-15 22:02:48,678 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.RefineBuchi.constructTraceCheck(RefineBuchi.java:611) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.RefineBuchi.refineBuchi(RefineBuchi.java:208) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineBuchi(BuchiCegarLoop.java:738) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:551) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 22:02:48,681 INFO L168 Benchmark]: Toolchain (without parser) took 76404.41 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 326.1 MB). Free memory was 951.4 MB in the beginning and 1.3 GB in the end (delta: -337.9 MB). Peak memory consumption was 438.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:02:48,681 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:02:48,682 INFO L168 Benchmark]: CACSL2BoogieTranslator took 423.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -194.1 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:02:48,682 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:02:48,682 INFO L168 Benchmark]: Boogie Preprocessor took 35.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:02:48,683 INFO L168 Benchmark]: RCFGBuilder took 412.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:02:48,683 INFO L168 Benchmark]: BuchiAutomizer took 75482.37 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 171.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -167.6 MB). Peak memory consumption was 453.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:02:48,694 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 423.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -194.1 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 412.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 75482.37 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 171.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -167.6 MB). Peak memory consumption was 453.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...