./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/mutual_simple2.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_6c9c7467-867d-45de-a3df-b9991b6ea5cc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6c9c7467-867d-45de-a3df-b9991b6ea5cc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6c9c7467-867d-45de-a3df-b9991b6ea5cc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6c9c7467-867d-45de-a3df-b9991b6ea5cc/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/mutual_simple2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6c9c7467-867d-45de-a3df-b9991b6ea5cc/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6c9c7467-867d-45de-a3df-b9991b6ea5cc/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 0e5de97577f46d865036abdb75ab0d17479e10b3 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:44:05,176 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:44:05,177 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:44:05,191 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:44:05,191 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:44:05,192 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:44:05,194 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:44:05,202 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:44:05,206 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:44:05,210 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:44:05,211 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:44:05,213 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:44:05,213 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:44:05,214 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:44:05,215 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:44:05,216 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:44:05,217 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:44:05,217 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:44:05,219 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:44:05,222 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:44:05,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:44:05,227 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:44:05,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:44:05,231 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:44:05,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:44:05,234 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:44:05,234 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:44:05,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:44:05,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:44:05,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:44:05,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:44:05,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:44:05,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:44:05,238 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:44:05,239 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:44:05,239 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:44:05,240 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:44:05,240 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:44:05,240 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:44:05,241 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:44:05,242 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:44:05,243 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6c9c7467-867d-45de-a3df-b9991b6ea5cc/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-16 00:44:05,267 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:44:05,268 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:44:05,269 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:44:05,269 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:44:05,269 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:44:05,269 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:44:05,269 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:44:05,270 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:44:05,270 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:44:05,270 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:44:05,270 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:44:05,270 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:44:05,271 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:44:05,271 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:44:05,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:44:05,271 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:44:05,271 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:44:05,272 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:44:05,272 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:44:05,272 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:44:05,272 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:44:05,272 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:44:05,273 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:44:05,273 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:44:05,273 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:44:05,273 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:44:05,274 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:44:05,274 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:44:05,275 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:44:05,275 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_6c9c7467-867d-45de-a3df-b9991b6ea5cc/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 -> 0e5de97577f46d865036abdb75ab0d17479e10b3 [2019-11-16 00:44:05,298 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:44:05,308 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:44:05,311 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:44:05,312 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:44:05,313 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:44:05,313 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6c9c7467-867d-45de-a3df-b9991b6ea5cc/bin/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/mutual_simple2.i [2019-11-16 00:44:05,359 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6c9c7467-867d-45de-a3df-b9991b6ea5cc/bin/uautomizer/data/b778857f2/b5a7396bd6e943b59aa4e578fe3f7bbe/FLAG09c609002 [2019-11-16 00:44:05,738 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:44:05,738 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6c9c7467-867d-45de-a3df-b9991b6ea5cc/sv-benchmarks/c/termination-recursive-malloc/mutual_simple2.i [2019-11-16 00:44:05,745 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6c9c7467-867d-45de-a3df-b9991b6ea5cc/bin/uautomizer/data/b778857f2/b5a7396bd6e943b59aa4e578fe3f7bbe/FLAG09c609002 [2019-11-16 00:44:05,759 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6c9c7467-867d-45de-a3df-b9991b6ea5cc/bin/uautomizer/data/b778857f2/b5a7396bd6e943b59aa4e578fe3f7bbe [2019-11-16 00:44:05,762 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:44:05,763 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:44:05,764 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:44:05,764 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:44:05,768 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:44:05,769 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:44:05" (1/1) ... [2019-11-16 00:44:05,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aaee7dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:05, skipping insertion in model container [2019-11-16 00:44:05,771 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:44:05" (1/1) ... [2019-11-16 00:44:05,778 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:44:05,796 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:44:05,928 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:44:05,994 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:44:06,009 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:44:06,021 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:44:06,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:06 WrapperNode [2019-11-16 00:44:06,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:44:06,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:44:06,023 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:44:06,023 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:44:06,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:06" (1/1) ... [2019-11-16 00:44:06,039 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:06" (1/1) ... [2019-11-16 00:44:06,054 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:44:06,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:44:06,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:44:06,055 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:44:06,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:06" (1/1) ... [2019-11-16 00:44:06,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:06" (1/1) ... [2019-11-16 00:44:06,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:06" (1/1) ... [2019-11-16 00:44:06,065 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:06" (1/1) ... [2019-11-16 00:44:06,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:06" (1/1) ... [2019-11-16 00:44:06,070 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:06" (1/1) ... [2019-11-16 00:44:06,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:06" (1/1) ... [2019-11-16 00:44:06,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:44:06,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:44:06,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:44:06,073 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:44:06,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c9c7467-867d-45de-a3df-b9991b6ea5cc/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-16 00:44:06,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:44:06,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:44:06,138 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-16 00:44:06,139 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-16 00:44:06,139 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-16 00:44:06,139 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-16 00:44:06,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:44:06,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:44:06,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:44:06,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:44:06,387 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:44:06,387 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-16 00:44:06,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:44:06 BoogieIcfgContainer [2019-11-16 00:44:06,389 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:44:06,389 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:44:06,389 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:44:06,392 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:44:06,393 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:44:06,393 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:44:05" (1/3) ... [2019-11-16 00:44:06,394 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b35cfc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:44:06, skipping insertion in model container [2019-11-16 00:44:06,394 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:44:06,394 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:06" (2/3) ... [2019-11-16 00:44:06,394 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b35cfc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:44:06, skipping insertion in model container [2019-11-16 00:44:06,395 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:44:06,395 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:44:06" (3/3) ... [2019-11-16 00:44:06,396 INFO L371 chiAutomizerObserver]: Analyzing ICFG mutual_simple2.i [2019-11-16 00:44:06,447 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:44:06,448 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:44:06,448 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:44:06,448 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:44:06,448 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:44:06,448 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:44:06,448 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:44:06,449 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:44:06,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-16 00:44:06,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-16 00:44:06,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:44:06,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:44:06,521 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-16 00:44:06,521 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:44:06,521 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:44:06,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-16 00:44:06,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-16 00:44:06,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:44:06,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:44:06,534 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-16 00:44:06,534 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:44:06,541 INFO L791 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet9, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call write~int(main_#t~nondet9, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet9; 16#L44true call f(main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset);< 15#fENTRYtrue [2019-11-16 00:44:06,541 INFO L793 eck$LassoCheckResult]: Loop: 15#fENTRYtrue ~q.base, ~q.offset := #in~q.base, #in~q.offset;~r.base, ~r.offset := #in~r.base, #in~r.offset;call ULTIMATE.dealloc(~r.base, ~r.offset);call #t~mem1 := read~int(~q.base, ~q.offset, 4); 17#L14true assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~s~0.base, ~s~0.offset := #t~malloc2.base, #t~malloc2.offset;call #t~mem3 := read~int(~q.base, ~q.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~q.base, ~q.offset, 4);havoc #t~mem3;havoc #t~post4; 4#L21true call g(~q.base, ~q.offset, ~s~0.base, ~s~0.offset);< 13#gENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset;call ULTIMATE.dealloc(~s.base, ~s.offset);call #t~mem5 := read~int(~p.base, ~p.offset, 4); 14#L27true assume !(#t~mem5 < 0);havoc #t~mem5;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);~r~0.base, ~r~0.offset := #t~malloc6.base, #t~malloc6.offset; 5#L33true call f(~p.base, ~p.offset, ~r~0.base, ~r~0.offset);< 15#fENTRYtrue [2019-11-16 00:44:06,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:06,546 INFO L82 PathProgramCache]: Analyzing trace with hash 43767, now seen corresponding path program 1 times [2019-11-16 00:44:06,552 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:06,552 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13415538] [2019-11-16 00:44:06,552 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:06,552 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:06,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:06,673 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:06,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:06,674 INFO L82 PathProgramCache]: Analyzing trace with hash 891860259, now seen corresponding path program 1 times [2019-11-16 00:44:06,674 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:06,674 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829421842] [2019-11-16 00:44:06,674 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:06,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:06,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:06,743 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:06,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:06,745 INFO L82 PathProgramCache]: Analyzing trace with hash -306262119, now seen corresponding path program 1 times [2019-11-16 00:44:06,745 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:06,745 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900626202] [2019-11-16 00:44:06,745 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:06,745 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:06,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:06,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:06,848 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:06,999 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-16 00:44:07,106 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-16 00:44:07,254 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-16 00:44:07,534 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-11-16 00:44:08,137 WARN L191 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 97 [2019-11-16 00:44:08,457 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-11-16 00:44:08,671 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-16 00:44:08,745 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:44:08,746 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:44:08,746 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:44:08,746 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:44:08,746 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:44:08,747 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:08,747 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:44:08,747 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:44:08,747 INFO L131 ssoRankerPreferences]: Filename of dumped script: mutual_simple2.i_Iteration1_Lasso [2019-11-16 00:44:08,747 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:44:08,748 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:44:08,769 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-16 00:44:08,777 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-16 00:44:08,781 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-16 00:44:08,783 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-16 00:44:08,786 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-16 00:44:08,788 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-16 00:44:08,790 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-16 00:44:08,792 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-16 00:44:08,794 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-16 00:44:08,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-16 00:44:08,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-16 00:44:08,802 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-16 00:44:08,807 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-16 00:44:08,810 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-16 00:44:08,812 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-16 00:44:08,814 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-16 00:44:08,815 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-16 00:44:08,817 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-16 00:44:08,819 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-16 00:44:08,820 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-16 00:44:08,823 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-16 00:44:08,825 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-16 00:44:08,827 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-16 00:44:08,829 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-16 00:44:08,831 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-16 00:44:08,833 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-16 00:44:08,835 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-16 00:44:08,966 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-16 00:44:08,973 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-16 00:44:08,975 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-16 00:44:08,977 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-16 00:44:08,979 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-16 00:44:08,981 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-16 00:44:08,983 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-16 00:44:08,984 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-16 00:44:08,987 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-16 00:44:08,989 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-16 00:44:08,991 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-16 00:44:08,992 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-16 00:44:08,995 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-16 00:44:08,998 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-16 00:44:09,421 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 19 [2019-11-16 00:44:09,588 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:44:09,592 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:44:09,594 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-16 00:44:09,596 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:09,596 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:09,597 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:09,597 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:09,597 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:09,599 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:09,599 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:09,601 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:09,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:44:09,602 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:09,602 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:09,603 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:09,603 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:09,603 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:09,603 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:09,603 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:09,611 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:09,611 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-16 00:44:09,613 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:09,613 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:09,613 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:09,613 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:09,613 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:09,614 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:09,614 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:09,615 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:09,615 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-16 00:44:09,615 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:09,616 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:09,616 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:09,616 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:09,616 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:09,617 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:09,617 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:09,618 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:09,618 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-16 00:44:09,618 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:09,619 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:09,619 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:09,619 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:09,619 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:09,620 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:09,620 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:09,621 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:09,621 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-16 00:44:09,621 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:09,622 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:09,622 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:09,622 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:09,622 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:09,622 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:09,623 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:09,623 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:09,624 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-16 00:44:09,624 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:09,624 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:09,625 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:09,625 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:09,625 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:09,625 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:09,625 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:09,626 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:09,626 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-16 00:44:09,627 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:09,627 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:09,627 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:09,627 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:09,628 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:09,628 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:09,628 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:09,629 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:09,638 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-16 00:44:09,639 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:09,639 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:09,640 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:09,640 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:09,643 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:09,643 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:09,651 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:09,652 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-16 00:44:09,654 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:09,654 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:09,654 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:09,654 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:09,655 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:09,655 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:09,655 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:09,656 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:09,657 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-16 00:44:09,657 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:09,657 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:09,658 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:09,658 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:09,658 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:09,658 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:09,659 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:09,659 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:09,660 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-16 00:44:09,660 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:09,660 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:09,661 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:09,661 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:09,661 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:09,661 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:09,661 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:09,662 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:09,663 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-16 00:44:09,663 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:09,663 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:09,663 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:09,664 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:09,664 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:09,664 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:09,664 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:09,665 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:09,665 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-16 00:44:09,666 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:09,666 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:09,666 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:09,666 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:09,666 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:09,667 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:09,667 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:09,668 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:09,668 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-16 00:44:09,669 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:09,669 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:09,669 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:09,669 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:09,669 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:09,670 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:09,670 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:09,671 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:09,671 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-16 00:44:09,672 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:09,672 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:09,672 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:09,672 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:09,672 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:09,673 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:09,673 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:09,675 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:09,676 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-16 00:44:09,676 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:09,676 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:09,677 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:09,677 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:09,677 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:09,677 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:09,677 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:09,678 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:09,678 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-16 00:44:09,679 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:09,679 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:09,679 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:09,679 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:09,680 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:09,680 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:09,680 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:09,681 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:09,681 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-16 00:44:09,682 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:09,682 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:09,682 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:09,682 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:09,682 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:09,683 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:09,683 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:09,684 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:09,684 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-16 00:44:09,685 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:09,685 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:09,685 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:09,685 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:09,687 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:09,687 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:09,689 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:09,690 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-16 00:44:09,690 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:09,690 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:09,690 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:09,691 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:09,691 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:09,691 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:09,691 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:09,692 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:09,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:44:09,693 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:09,693 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:09,693 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:09,693 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:09,694 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:09,694 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:09,694 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:09,695 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:09,695 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-16 00:44:09,696 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:09,696 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:09,696 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:09,696 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:09,696 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:09,697 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:09,697 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:09,697 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:09,698 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-16 00:44:09,698 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:09,698 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:09,699 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:09,699 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:09,699 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:09,699 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:09,699 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:09,700 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:09,701 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-16 00:44:09,701 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:09,701 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:09,701 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:09,702 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:09,702 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:09,702 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:09,702 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:09,703 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:09,704 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-16 00:44:09,704 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:09,704 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:09,704 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:09,704 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:09,705 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:09,705 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:09,705 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:09,706 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:09,706 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-16 00:44:09,707 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:09,707 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:09,707 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:09,707 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:09,710 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:09,710 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:09,723 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:09,724 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-16 00:44:09,724 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:09,724 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:09,724 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:09,725 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:09,727 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:09,727 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:09,741 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:09,742 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-16 00:44:09,743 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:09,743 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:09,743 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:09,743 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:09,745 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:09,745 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:09,760 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:44:09,770 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:44:09,770 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:44:09,772 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:44:09,774 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:44:09,774 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:44:09,775 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int f_#in~q.base) f_#in~q.offset)_1) = 1*v_rep(select (select #memory_int f_#in~q.base) f_#in~q.offset)_1 Supporting invariants [] [2019-11-16 00:44:09,784 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-16 00:44:09,789 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:44:09,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:09,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:44:09,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:09,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-16 00:44:09,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:09,946 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 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-16 00:44:09,952 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:09,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:09,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:09,956 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2019-11-16 00:44:10,016 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-16 00:44:10,027 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2019-11-16 00:44:10,027 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 7 states. [2019-11-16 00:44:10,283 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 7 states. Result 47 states and 53 transitions. Complement of second has 22 states. [2019-11-16 00:44:10,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2019-11-16 00:44:10,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-16 00:44:10,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2019-11-16 00:44:10,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 15 transitions. Stem has 3 letters. Loop has 6 letters. [2019-11-16 00:44:10,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:10,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 15 transitions. Stem has 9 letters. Loop has 6 letters. [2019-11-16 00:44:10,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:10,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 15 transitions. Stem has 3 letters. Loop has 12 letters. [2019-11-16 00:44:10,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:10,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 53 transitions. [2019-11-16 00:44:10,296 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:44:10,298 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 0 states and 0 transitions. [2019-11-16 00:44:10,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:44:10,299 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:44:10,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:44:10,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:44:10,300 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:44:10,300 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:44:10,300 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:44:10,300 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:44:10,300 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:44:10,300 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:44:10,300 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:44:10,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:44:10 BoogieIcfgContainer [2019-11-16 00:44:10,304 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:44:10,304 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:44:10,305 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:44:10,305 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:44:10,305 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:44:06" (3/4) ... [2019-11-16 00:44:10,308 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:44:10,308 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:44:10,309 INFO L168 Benchmark]: Toolchain (without parser) took 4546.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 952.8 MB in the beginning and 903.9 MB in the end (delta: 48.9 MB). Peak memory consumption was 196.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:10,310 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:44:10,310 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 952.8 MB in the beginning and 1.1 GB in the end (delta: -189.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:10,311 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:44:10,311 INFO L168 Benchmark]: Boogie Preprocessor took 17.94 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-16 00:44:10,312 INFO L168 Benchmark]: RCFGBuilder took 315.91 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.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:10,312 INFO L168 Benchmark]: BuchiAutomizer took 3915.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 903.9 MB in the end (delta: 214.6 MB). Peak memory consumption was 214.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:10,313 INFO L168 Benchmark]: Witness Printer took 3.28 ms. Allocated memory is still 1.2 GB. Free memory is still 903.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:44:10,315 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 258.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 952.8 MB in the beginning and 1.1 GB in the end (delta: -189.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.94 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 315.91 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.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3915.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 903.9 MB in the end (delta: 214.6 MB). Peak memory consumption was 214.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.28 ms. Allocated memory is still 1.2 GB. Free memory is still 903.9 MB. There was no memory consumed. 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.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[q][q] and consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.8s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 3.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 11 SDtfs, 11 SDslu, 20 SDs, 0 SdLazy, 64 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital224 mio100 ax100 hnf100 lsp94 ukn62 mio100 lsp25 div100 bol100 ite100 ukn100 eq160 hnf98 smp100 dnf280 smp91 tf100 neg88 sie147 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms 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...