./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/java_AG313-alloca.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/working_dir_0b422339-fbd3-41f7-b31a-39498a26afe0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0b422339-fbd3-41f7-b31a-39498a26afe0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0b422339-fbd3-41f7-b31a-39498a26afe0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0b422339-fbd3-41f7-b31a-39498a26afe0/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/java_AG313-alloca.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0b422339-fbd3-41f7-b31a-39498a26afe0/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0b422339-fbd3-41f7-b31a-39498a26afe0/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 b64613d278f1b2a5aec6d84cb3470147257700f5 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:02:50,176 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:02:50,178 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:02:50,187 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:02:50,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:02:50,188 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:02:50,188 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:02:50,190 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:02:50,191 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:02:50,192 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:02:50,192 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:02:50,193 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:02:50,193 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:02:50,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:02:50,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:02:50,195 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:02:50,196 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:02:50,208 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:02:50,209 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:02:50,210 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:02:50,211 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:02:50,212 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:02:50,212 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:02:50,213 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:02:50,215 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:02:50,215 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:02:50,215 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:02:50,216 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:02:50,216 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:02:50,216 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:02:50,217 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:02:50,217 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:02:50,218 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:02:50,218 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:02:50,219 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:02:50,219 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:02:50,220 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:02:50,220 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:02:50,220 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:02:50,220 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:02:50,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:02:50,222 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0b422339-fbd3-41f7-b31a-39498a26afe0/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 09:02:50,238 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:02:50,238 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:02:50,239 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:02:50,239 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:02:50,240 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:02:50,240 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:02:50,240 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:02:50,240 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:02:50,240 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:02:50,241 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:02:50,241 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:02:50,241 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:02:50,241 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:02:50,241 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:02:50,241 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:02:50,242 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:02:50,242 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:02:50,242 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:02:50,242 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:02:50,242 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:02:50,242 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:02:50,243 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:02:50,243 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:02:50,243 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:02:50,243 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:02:50,243 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:02:50,244 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:02:50,244 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:02:50,245 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:02:50,245 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/working_dir_0b422339-fbd3-41f7-b31a-39498a26afe0/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 -> b64613d278f1b2a5aec6d84cb3470147257700f5 [2019-10-22 09:02:50,279 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:02:50,291 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:02:50,295 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:02:50,297 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:02:50,297 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:02:50,298 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0b422339-fbd3-41f7-b31a-39498a26afe0/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/java_AG313-alloca.i [2019-10-22 09:02:50,345 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0b422339-fbd3-41f7-b31a-39498a26afe0/bin/uautomizer/data/bf249d168/34372b33bfb249ae88e0c76a7819f2a6/FLAG39c5a1e15 [2019-10-22 09:02:50,783 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:02:50,784 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0b422339-fbd3-41f7-b31a-39498a26afe0/sv-benchmarks/c/termination-memory-alloca/java_AG313-alloca.i [2019-10-22 09:02:50,792 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0b422339-fbd3-41f7-b31a-39498a26afe0/bin/uautomizer/data/bf249d168/34372b33bfb249ae88e0c76a7819f2a6/FLAG39c5a1e15 [2019-10-22 09:02:50,803 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0b422339-fbd3-41f7-b31a-39498a26afe0/bin/uautomizer/data/bf249d168/34372b33bfb249ae88e0c76a7819f2a6 [2019-10-22 09:02:50,805 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:02:50,806 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:02:50,807 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:50,807 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:02:50,811 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:02:50,812 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:50" (1/1) ... [2019-10-22 09:02:50,814 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@afe4b86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:50, skipping insertion in model container [2019-10-22 09:02:50,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:50" (1/1) ... [2019-10-22 09:02:50,823 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:02:50,861 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:02:51,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:51,170 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:02:51,206 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:51,240 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:02:51,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:51 WrapperNode [2019-10-22 09:02:51,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:51,241 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:51,241 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:02:51,242 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:02:51,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:51" (1/1) ... [2019-10-22 09:02:51,261 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:51" (1/1) ... [2019-10-22 09:02:51,278 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:51,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:02:51,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:02:51,278 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:02:51,284 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:51" (1/1) ... [2019-10-22 09:02:51,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:51" (1/1) ... [2019-10-22 09:02:51,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:51" (1/1) ... [2019-10-22 09:02:51,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:51" (1/1) ... [2019-10-22 09:02:51,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:51" (1/1) ... [2019-10-22 09:02:51,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:51" (1/1) ... [2019-10-22 09:02:51,296 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:51" (1/1) ... [2019-10-22 09:02:51,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:02:51,298 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:02:51,298 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:02:51,298 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:02:51,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b422339-fbd3-41f7-b31a-39498a26afe0/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-10-22 09:02:51,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:02:51,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:02:51,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:02:51,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:02:51,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:02:51,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:02:51,606 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:02:51,606 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 09:02:51,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:51 BoogieIcfgContainer [2019-10-22 09:02:51,608 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:02:51,608 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:02:51,609 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:02:51,614 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:02:51,615 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:51,615 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:02:50" (1/3) ... [2019-10-22 09:02:51,616 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2128e2b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:02:51, skipping insertion in model container [2019-10-22 09:02:51,616 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:51,616 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:51" (2/3) ... [2019-10-22 09:02:51,617 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2128e2b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:02:51, skipping insertion in model container [2019-10-22 09:02:51,617 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:51,617 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:51" (3/3) ... [2019-10-22 09:02:51,619 INFO L371 chiAutomizerObserver]: Analyzing ICFG java_AG313-alloca.i [2019-10-22 09:02:51,668 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:02:51,668 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:02:51,668 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:02:51,668 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:02:51,668 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:02:51,669 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:02:51,669 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:02:51,669 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:02:51,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-10-22 09:02:51,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:02:51,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:51,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:51,715 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 09:02:51,715 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:02:51,715 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:02:51,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-10-22 09:02:51,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:02:51,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:51,718 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:51,718 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 09:02:51,718 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:02:51,726 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;quot_#in~x, quot_#in~y := main_#t~nondet13, main_#t~nondet14;havoc quot_#res;havoc quot_#t~malloc2.base, quot_#t~malloc2.offset, quot_#t~malloc3.base, quot_#t~malloc3.offset, quot_#t~malloc4.base, quot_#t~malloc4.offset, quot_#t~mem5, quot_#t~mem9, quot_#t~mem10, quot_#t~mem11, quot_#t~mem6, quot_#t~mem7, quot_#t~short8, quot_#t~mem12, quot_~x, quot_~y, quot_~x_ref~0.base, quot_~x_ref~0.offset, quot_~y_ref~0.base, quot_~y_ref~0.offset, quot_~i~0.base, quot_~i~0.offset;quot_~x := quot_#in~x;quot_~y := quot_#in~y;call quot_#t~malloc2.base, quot_#t~malloc2.offset := #Ultimate.allocOnStack(4);quot_~x_ref~0.base, quot_~x_ref~0.offset := quot_#t~malloc2.base, quot_#t~malloc2.offset;call quot_#t~malloc3.base, quot_#t~malloc3.offset := #Ultimate.allocOnStack(4);quot_~y_ref~0.base, quot_~y_ref~0.offset := quot_#t~malloc3.base, quot_#t~malloc3.offset;call quot_#t~malloc4.base, quot_#t~malloc4.offset := #Ultimate.allocOnStack(4);quot_~i~0.base, quot_~i~0.offset := quot_#t~malloc4.base, quot_#t~malloc4.offset;call write~int(quot_~x, quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);call write~int(quot_~y, quot_~y_ref~0.base, quot_~y_ref~0.offset, 4);call write~int(0, quot_~i~0.base, quot_~i~0.offset, 4);call quot_#t~mem5 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4); 10#L555true assume !(0 == quot_#t~mem5);havoc quot_#t~mem5; 7#L556-5true [2019-10-22 09:02:51,727 INFO L793 eck$LassoCheckResult]: Loop: 7#L556-5true call quot_#t~mem6 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);quot_#t~short8 := quot_#t~mem6 > 0; 11#L556-1true assume !quot_#t~short8; 4#L556-3true assume !!quot_#t~short8;havoc quot_#t~mem7;havoc quot_#t~short8;havoc quot_#t~mem6;call quot_#t~mem9 := read~int(quot_~i~0.base, quot_~i~0.offset, 4);call write~int(1 + quot_#t~mem9, quot_~i~0.base, quot_~i~0.offset, 4);havoc quot_#t~mem9;call quot_#t~mem10 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);call quot_#t~mem11 := read~int(quot_~y_ref~0.base, quot_~y_ref~0.offset, 4);call write~int(quot_#t~mem10 - 1 - (quot_#t~mem11 - 1), quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);havoc quot_#t~mem10;havoc quot_#t~mem11; 7#L556-5true [2019-10-22 09:02:51,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:51,733 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-10-22 09:02:51,741 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:51,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101271357] [2019-10-22 09:02:51,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:51,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:51,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:51,917 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:51,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:51,919 INFO L82 PathProgramCache]: Analyzing trace with hash 41873, now seen corresponding path program 1 times [2019-10-22 09:02:51,919 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:51,919 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823426970] [2019-10-22 09:02:51,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:51,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:51,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:51,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:51,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823426970] [2019-10-22 09:02:51,967 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:51,967 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:51,967 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292279444] [2019-10-22 09:02:51,972 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:02:51,973 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:51,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:51,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:51,989 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-10-22 09:02:52,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:52,014 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-10-22 09:02:52,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:52,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2019-10-22 09:02:52,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:02:52,020 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 6 states and 6 transitions. [2019-10-22 09:02:52,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-10-22 09:02:52,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-10-22 09:02:52,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 6 transitions. [2019-10-22 09:02:52,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:52,023 INFO L688 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-10-22 09:02:52,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 6 transitions. [2019-10-22 09:02:52,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-10-22 09:02:52,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 09:02:52,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-10-22 09:02:52,046 INFO L711 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-10-22 09:02:52,046 INFO L591 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-10-22 09:02:52,046 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:02:52,046 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 6 transitions. [2019-10-22 09:02:52,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:02:52,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:52,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:52,047 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 09:02:52,047 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:02:52,048 INFO L791 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 32#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;quot_#in~x, quot_#in~y := main_#t~nondet13, main_#t~nondet14;havoc quot_#res;havoc quot_#t~malloc2.base, quot_#t~malloc2.offset, quot_#t~malloc3.base, quot_#t~malloc3.offset, quot_#t~malloc4.base, quot_#t~malloc4.offset, quot_#t~mem5, quot_#t~mem9, quot_#t~mem10, quot_#t~mem11, quot_#t~mem6, quot_#t~mem7, quot_#t~short8, quot_#t~mem12, quot_~x, quot_~y, quot_~x_ref~0.base, quot_~x_ref~0.offset, quot_~y_ref~0.base, quot_~y_ref~0.offset, quot_~i~0.base, quot_~i~0.offset;quot_~x := quot_#in~x;quot_~y := quot_#in~y;call quot_#t~malloc2.base, quot_#t~malloc2.offset := #Ultimate.allocOnStack(4);quot_~x_ref~0.base, quot_~x_ref~0.offset := quot_#t~malloc2.base, quot_#t~malloc2.offset;call quot_#t~malloc3.base, quot_#t~malloc3.offset := #Ultimate.allocOnStack(4);quot_~y_ref~0.base, quot_~y_ref~0.offset := quot_#t~malloc3.base, quot_#t~malloc3.offset;call quot_#t~malloc4.base, quot_#t~malloc4.offset := #Ultimate.allocOnStack(4);quot_~i~0.base, quot_~i~0.offset := quot_#t~malloc4.base, quot_#t~malloc4.offset;call write~int(quot_~x, quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);call write~int(quot_~y, quot_~y_ref~0.base, quot_~y_ref~0.offset, 4);call write~int(0, quot_~i~0.base, quot_~i~0.offset, 4);call quot_#t~mem5 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4); 33#L555 assume !(0 == quot_#t~mem5);havoc quot_#t~mem5; 35#L556-5 [2019-10-22 09:02:52,048 INFO L793 eck$LassoCheckResult]: Loop: 35#L556-5 call quot_#t~mem6 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);quot_#t~short8 := quot_#t~mem6 > 0; 37#L556-1 assume quot_#t~short8;call quot_#t~mem7 := read~int(quot_~y_ref~0.base, quot_~y_ref~0.offset, 4);quot_#t~short8 := quot_#t~mem7 > 0; 34#L556-3 assume !!quot_#t~short8;havoc quot_#t~mem7;havoc quot_#t~short8;havoc quot_#t~mem6;call quot_#t~mem9 := read~int(quot_~i~0.base, quot_~i~0.offset, 4);call write~int(1 + quot_#t~mem9, quot_~i~0.base, quot_~i~0.offset, 4);havoc quot_#t~mem9;call quot_#t~mem10 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);call quot_#t~mem11 := read~int(quot_~y_ref~0.base, quot_~y_ref~0.offset, 4);call write~int(quot_#t~mem10 - 1 - (quot_#t~mem11 - 1), quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);havoc quot_#t~mem10;havoc quot_#t~mem11; 35#L556-5 [2019-10-22 09:02:52,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:52,048 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2019-10-22 09:02:52,048 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:52,049 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116612093] [2019-10-22 09:02:52,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:52,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:52,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:52,088 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:52,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:52,088 INFO L82 PathProgramCache]: Analyzing trace with hash 41811, now seen corresponding path program 1 times [2019-10-22 09:02:52,088 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:52,089 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485698080] [2019-10-22 09:02:52,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:52,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:52,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:52,117 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:52,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:52,118 INFO L82 PathProgramCache]: Analyzing trace with hash 889571280, now seen corresponding path program 1 times [2019-10-22 09:02:52,118 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:52,118 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141954114] [2019-10-22 09:02:52,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:52,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:52,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:52,202 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:52,408 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-10-22 09:02:52,883 WARN L191 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 94 [2019-10-22 09:02:53,021 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-10-22 09:02:53,033 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:53,034 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:53,034 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:53,034 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:53,035 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:53,035 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:53,036 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:53,036 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:53,036 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_AG313-alloca.i_Iteration2_Lasso [2019-10-22 09:02:53,036 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:53,036 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:53,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:53,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:53,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:53,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:53,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:53,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:53,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:53,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:53,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:53,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:53,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:53,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:53,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:53,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:53,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:53,455 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-10-22 09:02:53,592 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-10-22 09:02:53,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:53,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:53,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:54,257 WARN L191 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-10-22 09:02:54,412 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:54,417 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:54,419 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-10-22 09:02:54,420 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:54,421 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:54,421 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:54,421 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:54,422 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:54,424 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:54,424 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:54,425 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:54,426 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-10-22 09:02:54,427 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:54,427 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:54,427 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:54,427 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:54,427 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:54,428 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:54,428 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:54,428 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:54,429 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-10-22 09:02:54,429 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:54,429 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:54,429 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:54,430 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:54,432 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:54,432 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:54,435 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:54,436 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-10-22 09:02:54,436 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:54,436 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:54,436 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:54,436 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:54,437 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:54,437 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:54,437 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:54,438 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:54,439 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-10-22 09:02:54,439 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:54,439 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:54,439 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:54,439 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:54,440 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:54,440 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:54,440 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:54,441 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:54,441 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-10-22 09:02:54,441 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:54,441 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:54,442 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:54,442 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:54,444 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:54,444 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:54,447 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:54,448 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-10-22 09:02:54,448 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:54,449 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:54,449 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:54,449 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:54,449 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:54,449 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:54,449 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:54,451 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:54,451 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-10-22 09:02:54,451 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:54,451 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:54,452 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:54,452 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:54,452 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:54,452 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:54,452 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:54,453 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:54,453 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-10-22 09:02:54,454 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:54,454 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:54,455 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:54,455 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:54,456 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:54,456 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:54,459 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:54,459 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-10-22 09:02:54,459 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:54,460 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:54,460 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:54,460 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:54,461 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:54,461 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:54,464 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:54,464 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-10-22 09:02:54,465 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:54,465 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:54,465 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:54,465 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:54,466 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:54,467 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:54,469 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:54,469 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-10-22 09:02:54,470 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:54,470 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:54,470 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:54,471 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:54,471 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:54,471 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:54,471 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:54,472 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:54,472 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-10-22 09:02:54,473 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:54,473 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:54,473 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:54,473 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:54,473 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:54,474 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:54,474 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:54,475 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:54,475 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-10-22 09:02:54,476 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:54,476 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:54,476 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:54,476 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:54,476 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:54,477 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:54,477 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:54,478 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:54,478 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-10-22 09:02:54,479 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:54,479 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:54,479 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:54,479 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:54,481 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:54,481 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:54,489 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:54,490 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-10-22 09:02:54,490 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:54,491 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:54,491 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:54,491 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:54,492 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:54,493 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:54,501 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:54,501 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-10-22 09:02:54,502 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:54,502 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-10-22 09:02:54,502 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:54,502 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:54,509 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-10-22 09:02:54,509 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:54,550 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:54,550 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-10-22 09:02:54,551 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:54,551 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:54,551 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:54,551 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:54,552 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:54,552 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:54,555 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:54,555 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-10-22 09:02:54,556 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:54,556 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:54,556 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:54,556 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:54,560 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:54,560 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:54,590 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:54,590 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-10-22 09:02:54,591 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:54,591 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:54,591 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:54,591 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:54,592 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:54,592 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:54,601 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:54,601 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-10-22 09:02:54,603 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:54,604 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:54,604 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:54,604 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:54,605 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:54,609 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:54,617 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:54,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-10-22 09:02:54,621 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:54,621 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:02:54,622 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:54,622 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:54,625 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:02:54,625 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:54,665 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:54,680 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:02:54,680 INFO L444 ModelExtractionUtils]: 25 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:02:54,685 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:54,687 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:02:54,687 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:54,688 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_quot_~x_ref~0.base) ULTIMATE.start_quot_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_quot_~x_ref~0.base) ULTIMATE.start_quot_~x_ref~0.offset)_1 Supporting invariants [] [2019-10-22 09:02:54,766 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-10-22 09:02:54,772 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:02:54,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:54,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-22 09:02:54,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:54,842 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-22 09:02:54,931 INFO L567 ElimStorePlain]: treesize reduction 65, result has 34.3 percent of original size [2019-10-22 09:02:54,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:54,933 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:68, output treesize:17 [2019-10-22 09:02:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:54,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 09:02:54,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:54,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:55,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:55,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:55,052 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-10-22 09:02:55,052 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 6 transitions. cyclomatic complexity: 1 Second operand 5 states. [2019-10-22 09:02:55,124 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 6 transitions. cyclomatic complexity: 1. Second operand 5 states. Result 9 states and 10 transitions. Complement of second has 7 states. [2019-10-22 09:02:55,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:55,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:02:55,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2019-10-22 09:02:55,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 3 letters. Loop has 3 letters. [2019-10-22 09:02:55,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:55,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 6 letters. Loop has 3 letters. [2019-10-22 09:02:55,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:55,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 3 letters. Loop has 6 letters. [2019-10-22 09:02:55,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:55,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2019-10-22 09:02:55,129 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:02:55,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2019-10-22 09:02:55,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:02:55,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:02:55,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:02:55,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:55,129 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:55,129 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:55,129 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:55,130 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:02:55,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:02:55,130 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:02:55,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:02:55,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:02:55 BoogieIcfgContainer [2019-10-22 09:02:55,136 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:02:55,136 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:02:55,136 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:02:55,136 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:02:55,137 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:51" (3/4) ... [2019-10-22 09:02:55,140 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:02:55,140 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:02:55,141 INFO L168 Benchmark]: Toolchain (without parser) took 4335.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.5 MB). Free memory was 940.6 MB in the beginning and 1.2 GB in the end (delta: -232.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:55,142 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 964.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:55,142 INFO L168 Benchmark]: CACSL2BoogieTranslator took 433.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -192.9 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:55,143 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.59 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:55,143 INFO L168 Benchmark]: Boogie Preprocessor took 19.42 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: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:55,144 INFO L168 Benchmark]: RCFGBuilder took 310.21 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-10-22 09:02:55,144 INFO L168 Benchmark]: BuchiAutomizer took 3527.45 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -67.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:55,144 INFO L168 Benchmark]: Witness Printer took 4.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:55,147 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 964.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 433.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -192.9 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.59 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.42 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: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 310.21 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 3527.45 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -67.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. 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 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 6 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 14 SDtfs, 1 SDslu, 8 SDs, 0 SdLazy, 13 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital347 mio100 ax105 hnf100 lsp92 ukn57 mio100 lsp37 div100 bol100 ite100 ukn100 eq182 hnf88 smp94 dnf303 smp92 tf100 neg92 sie126 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 48ms VariablesStem: 7 VariablesLoop: 6 DisjunctsStem: 8 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 20 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...