./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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_46dad345-90a4-416f-b4e6-adf3935f255e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_46dad345-90a4-416f-b4e6-adf3935f255e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_46dad345-90a4-416f-b4e6-adf3935f255e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_46dad345-90a4-416f-b4e6-adf3935f255e/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i -s /tmp/vcloud-vcloud-master/worker/run_dir_46dad345-90a4-416f-b4e6-adf3935f255e/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_46dad345-90a4-416f-b4e6-adf3935f255e/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 32bit --witnessprinter.graph.data.programhash 855ef959a267a6e57a6a3e6d7925f66e84a760d6 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:38:30,148 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:38:30,150 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:38:30,168 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:38:30,169 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:38:30,171 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:38:30,173 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:38:30,187 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:38:30,189 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:38:30,190 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:38:30,191 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:38:30,192 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:38:30,192 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:38:30,193 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:38:30,194 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:38:30,195 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:38:30,196 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:38:30,197 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:38:30,199 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:38:30,201 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:38:30,203 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:38:30,204 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:38:30,207 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:38:30,210 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:38:30,213 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:38:30,217 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:38:30,217 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:38:30,218 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:38:30,220 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:38:30,221 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:38:30,222 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:38:30,223 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:38:30,223 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:38:30,224 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:38:30,225 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:38:30,228 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:38:30,229 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:38:30,229 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:38:30,230 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:38:30,231 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:38:30,235 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:38:30,236 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_46dad345-90a4-416f-b4e6-adf3935f255e/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 23:38:30,255 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:38:30,255 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:38:30,256 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:38:30,256 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:38:30,257 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:38:30,257 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:38:30,257 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:38:30,257 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:38:30,258 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:38:30,258 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:38:30,258 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:38:30,258 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:38:30,259 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:38:30,259 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:38:30,259 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:38:30,259 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:38:30,260 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:38:30,260 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:38:30,260 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:38:30,260 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:38:30,260 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:38:30,261 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:38:30,261 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:38:30,261 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:38:30,261 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:38:30,262 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:38:30,262 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:38:30,262 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:38:30,262 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:38:30,263 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:38:30,263 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:38:30,264 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:38:30,264 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_46dad345-90a4-416f-b4e6-adf3935f255e/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 855ef959a267a6e57a6a3e6d7925f66e84a760d6 [2019-11-15 23:38:30,294 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:38:30,306 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:38:30,309 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:38:30,311 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:38:30,311 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:38:30,312 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_46dad345-90a4-416f-b4e6-adf3935f255e/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i [2019-11-15 23:38:30,375 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_46dad345-90a4-416f-b4e6-adf3935f255e/bin/uautomizer/data/7df66abc8/ac4e0bda016b40e4bc5703ea49142f91/FLAG67da4c684 [2019-11-15 23:38:30,984 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:38:30,985 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_46dad345-90a4-416f-b4e6-adf3935f255e/sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i [2019-11-15 23:38:31,014 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_46dad345-90a4-416f-b4e6-adf3935f255e/bin/uautomizer/data/7df66abc8/ac4e0bda016b40e4bc5703ea49142f91/FLAG67da4c684 [2019-11-15 23:38:31,151 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_46dad345-90a4-416f-b4e6-adf3935f255e/bin/uautomizer/data/7df66abc8/ac4e0bda016b40e4bc5703ea49142f91 [2019-11-15 23:38:31,153 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:38:31,155 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:38:31,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:38:31,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:38:31,159 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:38:31,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:38:31" (1/1) ... [2019-11-15 23:38:31,163 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55d71595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:38:31, skipping insertion in model container [2019-11-15 23:38:31,163 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:38:31" (1/1) ... [2019-11-15 23:38:31,171 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:38:31,219 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:38:31,829 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:38:31,851 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:38:31,920 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:38:32,031 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:38:32,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:38:32 WrapperNode [2019-11-15 23:38:32,032 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:38:32,035 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:38:32,035 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:38:32,035 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:38:32,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:38:32" (1/1) ... [2019-11-15 23:38:32,085 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:38:32" (1/1) ... [2019-11-15 23:38:32,111 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:38:32,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:38:32,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:38:32,112 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:38:32,121 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:38:32" (1/1) ... [2019-11-15 23:38:32,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:38:32" (1/1) ... [2019-11-15 23:38:32,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:38:32" (1/1) ... [2019-11-15 23:38:32,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:38:32" (1/1) ... [2019-11-15 23:38:32,137 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:38:32" (1/1) ... [2019-11-15 23:38:32,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:38:32" (1/1) ... [2019-11-15 23:38:32,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:38:32" (1/1) ... [2019-11-15 23:38:32,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:38:32,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:38:32,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:38:32,147 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:38:32,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:38:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46dad345-90a4-416f-b4e6-adf3935f255e/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 23:38:32,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:38:32,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 23:38:32,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:38:32,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-15 23:38:32,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:38:32,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:38:32,451 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:38:32,452 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-15 23:38:32,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:38:32 BoogieIcfgContainer [2019-11-15 23:38:32,453 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:38:32,453 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:38:32,453 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:38:32,457 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:38:32,458 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:38:32,458 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:38:31" (1/3) ... [2019-11-15 23:38:32,459 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1fc06015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:38:32, skipping insertion in model container [2019-11-15 23:38:32,460 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:38:32,460 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:38:32" (2/3) ... [2019-11-15 23:38:32,460 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1fc06015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:38:32, skipping insertion in model container [2019-11-15 23:38:32,460 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:38:32,461 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:38:32" (3/3) ... [2019-11-15 23:38:32,462 INFO L371 chiAutomizerObserver]: Analyzing ICFG memleaks_test18_3.i [2019-11-15 23:38:32,511 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:38:32,511 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:38:32,511 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:38:32,511 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:38:32,511 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:38:32,512 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:38:32,512 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:38:32,512 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:38:32,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-15 23:38:32,545 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:38:32,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:38:32,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:38:32,551 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:38:32,551 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:38:32,551 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:38:32,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-15 23:38:32,553 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:38:32,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:38:32,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:38:32,553 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:38:32,553 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:38:32,558 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 3#L-1true havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 13#L527true assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 8#L530true entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0; 4#L766true assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 9#L767-3true [2019-11-15 23:38:32,558 INFO L793 eck$LassoCheckResult]: Loop: 9#L767-3true assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 5#L527-1true assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 11#L530-1true entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset;call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 7#L767-2true entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 9#L767-3true [2019-11-15 23:38:32,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:38:32,564 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-11-15 23:38:32,571 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:38:32,571 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226083043] [2019-11-15 23:38:32,571 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:38:32,571 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:38:32,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:38:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:38:32,783 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 23:38:32,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226083043] [2019-11-15 23:38:32,784 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:38:32,784 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:38:32,785 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759015650] [2019-11-15 23:38:32,790 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:38:32,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:38:32,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 1 times [2019-11-15 23:38:32,790 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:38:32,791 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635123497] [2019-11-15 23:38:32,791 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:38:32,791 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:38:32,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:38:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:38:32,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:38:32,863 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:38:33,023 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-15 23:38:33,160 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-15 23:38:33,161 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:38:33,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:38:33,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:38:33,183 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 4 states. [2019-11-15 23:38:33,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:38:33,267 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-11-15 23:38:33,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:38:33,271 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 23 transitions. [2019-11-15 23:38:33,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 23:38:33,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 12 states and 13 transitions. [2019-11-15 23:38:33,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-15 23:38:33,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 23:38:33,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2019-11-15 23:38:33,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:38:33,280 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-11-15 23:38:33,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2019-11-15 23:38:33,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 9. [2019-11-15 23:38:33,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-15 23:38:33,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-11-15 23:38:33,315 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-15 23:38:33,316 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-15 23:38:33,316 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:38:33,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2019-11-15 23:38:33,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:38:33,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:38:33,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:38:33,319 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:38:33,319 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:38:33,319 INFO L791 eck$LassoCheckResult]: Stem: 51#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 45#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 46#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 53#L530 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0; 49#L766 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 50#L767-3 [2019-11-15 23:38:33,319 INFO L793 eck$LassoCheckResult]: Loop: 50#L767-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 47#L527-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 48#L530-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset;call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 52#L767-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 50#L767-3 [2019-11-15 23:38:33,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:38:33,320 INFO L82 PathProgramCache]: Analyzing trace with hash 28693831, now seen corresponding path program 1 times [2019-11-15 23:38:33,320 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:38:33,320 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152459215] [2019-11-15 23:38:33,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:38:33,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:38:33,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:38:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:38:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:38:33,409 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:38:33,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:38:33,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 2 times [2019-11-15 23:38:33,411 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:38:33,411 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738957742] [2019-11-15 23:38:33,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:38:33,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:38:33,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:38:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:38:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:38:33,466 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:38:33,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:38:33,467 INFO L82 PathProgramCache]: Analyzing trace with hash -592037012, now seen corresponding path program 1 times [2019-11-15 23:38:33,467 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:38:33,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180466243] [2019-11-15 23:38:33,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:38:33,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:38:33,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:38:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:38:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:38:33,528 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:38:33,647 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-15 23:38:33,765 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-15 23:38:34,095 WARN L191 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-11-15 23:38:34,261 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-15 23:38:34,275 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:38:34,276 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:38:34,277 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:38:34,277 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:38:34,277 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:38:34,278 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:38:34,278 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:38:34,278 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:38:34,278 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_3.i_Iteration2_Lasso [2019-11-15 23:38:34,278 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:38:34,279 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:38:34,328 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 23:38:34,337 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 23:38:34,340 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 23:38:34,344 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 23:38:34,347 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 23:38:34,352 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 23:38:34,358 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 23:38:34,361 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 23:38:34,366 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 23:38:34,370 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 23:38:34,683 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-15 23:38:34,844 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-15 23:38:34,845 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 23:38:34,850 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 23:38:34,854 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 23:38:34,862 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 23:38:35,748 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-11-15 23:38:35,837 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:38:35,843 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:38:35,845 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 23:38:35,847 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:35,848 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:35,848 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:35,848 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:35,853 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:38:35,853 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:38:35,859 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:35,859 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 23:38:35,860 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:35,860 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:38:35,860 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:35,861 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:35,861 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:35,861 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:38:35,862 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:38:35,862 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:35,863 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 23:38:35,863 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:35,864 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:38:35,864 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:35,864 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:35,864 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:35,865 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:38:35,865 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:38:35,866 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:35,866 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 23:38:35,867 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:35,867 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:38:35,867 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:35,868 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:35,868 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:35,868 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:38:35,868 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:38:35,869 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:35,870 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 23:38:35,870 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:35,871 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:35,871 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:35,871 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:35,873 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:38:35,873 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:38:35,879 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:35,880 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 23:38:35,880 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:35,880 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:38:35,881 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:35,881 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:35,881 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:35,882 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:38:35,882 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:38:35,883 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:35,883 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 23:38:35,884 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:35,884 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:38:35,884 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:35,885 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:35,885 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:35,885 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:38:35,886 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:38:35,887 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:35,887 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 23:38:35,888 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:35,888 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:35,888 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:35,888 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:35,890 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:38:35,890 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:38:35,894 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:35,894 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 23:38:35,895 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:35,895 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:35,896 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:35,896 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:35,898 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:38:35,898 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:38:35,903 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:35,904 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 23:38:35,904 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:35,904 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:35,905 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:35,905 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:35,907 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:38:35,907 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:38:35,914 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:35,914 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 23:38:35,915 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:35,915 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:35,915 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:35,916 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:35,918 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:38:35,918 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:38:35,924 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:35,925 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 23:38:35,925 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:35,926 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:38:35,926 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:35,926 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:35,926 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:35,927 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:38:35,927 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:38:35,928 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:38:35,929 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 23:38:35,929 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:38:35,930 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:38:35,930 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:38:35,930 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:38:35,943 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:38:35,944 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:38:36,059 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:38:36,208 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 23:38:36,209 INFO L444 ModelExtractionUtils]: 35 out of 43 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-11-15 23:38:36,213 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:38:36,217 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:38:36,218 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:38:36,219 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~len~0, ULTIMATE.start_entry_point_~i~0) = 1*ULTIMATE.start_entry_point_~len~0 - 1*ULTIMATE.start_entry_point_~i~0 Supporting invariants [] [2019-11-15 23:38:36,241 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-11-15 23:38:36,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:38:36,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:38:36,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:38:36,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:38:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:38:36,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:38:36,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:38:36,345 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 23:38:36,348 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 23:38:36,349 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 3 states. [2019-11-15 23:38:36,398 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 2. Second operand 3 states. Result 13 states and 16 transitions. Complement of second has 4 states. [2019-11-15 23:38:36,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 23:38:36,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:38:36,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-11-15 23:38:36,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-15 23:38:36,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:38:36,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-15 23:38:36,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:38:36,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 8 letters. [2019-11-15 23:38:36,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:38:36,405 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2019-11-15 23:38:36,406 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:38:36,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 0 states and 0 transitions. [2019-11-15 23:38:36,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:38:36,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:38:36,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:38:36,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:38:36,407 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:38:36,407 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:38:36,407 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:38:36,407 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:38:36,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:38:36,407 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:38:36,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:38:36,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:38:36 BoogieIcfgContainer [2019-11-15 23:38:36,417 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:38:36,417 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:38:36,418 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:38:36,418 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:38:36,418 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:38:32" (3/4) ... [2019-11-15 23:38:36,424 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:38:36,424 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:38:36,427 INFO L168 Benchmark]: Toolchain (without parser) took 5271.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 219.7 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -207.8 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:38:36,428 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:38:36,429 INFO L168 Benchmark]: CACSL2BoogieTranslator took 878.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -163.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:38:36,430 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.93 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:38:36,430 INFO L168 Benchmark]: Boogie Preprocessor took 34.09 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 23:38:36,433 INFO L168 Benchmark]: RCFGBuilder took 306.77 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:38:36,440 INFO L168 Benchmark]: BuchiAutomizer took 3963.75 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 80.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -73.7 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:38:36,440 INFO L168 Benchmark]: Witness Printer took 6.89 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 23:38:36,447 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 878.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -163.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.93 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.09 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 306.77 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3963.75 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 80.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -73.7 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Witness Printer took 6.89 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function len + -1 * i and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.9s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 9 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 25 SDtfs, 19 SDslu, 21 SDs, 0 SdLazy, 20 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital254 mio100 ax111 hnf101 lsp86 ukn64 mio100 lsp56 div100 bol100 ite100 ukn100 eq201 hnf88 smp100 dnf137 smp78 tf100 neg96 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...