./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/a.08-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/run_dir_0f6ce3bb-d6b5-474e-aae6-72aafd7f50f5/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0f6ce3bb-d6b5-474e-aae6-72aafd7f50f5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0f6ce3bb-d6b5-474e-aae6-72aafd7f50f5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0f6ce3bb-d6b5-474e-aae6-72aafd7f50f5/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/a.08-alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0f6ce3bb-d6b5-474e-aae6-72aafd7f50f5/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0f6ce3bb-d6b5-474e-aae6-72aafd7f50f5/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 b38ec4f461710d1db3d0a9a3fa7176d30b2ef06a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:43:44,113 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:43:44,115 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:43:44,127 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:43:44,128 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:43:44,129 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:43:44,131 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:43:44,133 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:43:44,135 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:43:44,136 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:43:44,138 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:43:44,139 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:43:44,140 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:43:44,141 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:43:44,142 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:43:44,143 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:43:44,144 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:43:44,145 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:43:44,147 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:43:44,149 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:43:44,151 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:43:44,152 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:43:44,153 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:43:44,154 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:43:44,157 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:43:44,158 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:43:44,158 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:43:44,159 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:43:44,160 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:43:44,161 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:43:44,162 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:43:44,162 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:43:44,163 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:43:44,164 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:43:44,165 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:43:44,166 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:43:44,167 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:43:44,167 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:43:44,167 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:43:44,168 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:43:44,169 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:43:44,170 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0f6ce3bb-d6b5-474e-aae6-72aafd7f50f5/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 20:43:44,189 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:43:44,189 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:43:44,190 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:43:44,191 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:43:44,191 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:43:44,191 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 20:43:44,192 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 20:43:44,192 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 20:43:44,192 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 20:43:44,192 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 20:43:44,193 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 20:43:44,193 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:43:44,193 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 20:43:44,194 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:43:44,194 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:43:44,194 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 20:43:44,194 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 20:43:44,195 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 20:43:44,195 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:43:44,195 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 20:43:44,196 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:43:44,196 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 20:43:44,196 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:43:44,196 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:43:44,197 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 20:43:44,197 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:43:44,197 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:43:44,198 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 20:43:44,199 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 20:43:44,199 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_0f6ce3bb-d6b5-474e-aae6-72aafd7f50f5/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 -> b38ec4f461710d1db3d0a9a3fa7176d30b2ef06a [2019-11-15 20:43:44,229 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:43:44,241 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:43:44,245 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:43:44,247 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:43:44,248 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:43:44,248 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0f6ce3bb-d6b5-474e-aae6-72aafd7f50f5/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/a.08-alloca.i [2019-11-15 20:43:44,311 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0f6ce3bb-d6b5-474e-aae6-72aafd7f50f5/bin/uautomizer/data/2d7b0ee3d/13e6a5764acd47efae9b57ac66d46cdd/FLAG8473ad036 [2019-11-15 20:43:44,843 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:43:44,844 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0f6ce3bb-d6b5-474e-aae6-72aafd7f50f5/sv-benchmarks/c/termination-memory-alloca/a.08-alloca.i [2019-11-15 20:43:44,865 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0f6ce3bb-d6b5-474e-aae6-72aafd7f50f5/bin/uautomizer/data/2d7b0ee3d/13e6a5764acd47efae9b57ac66d46cdd/FLAG8473ad036 [2019-11-15 20:43:45,102 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0f6ce3bb-d6b5-474e-aae6-72aafd7f50f5/bin/uautomizer/data/2d7b0ee3d/13e6a5764acd47efae9b57ac66d46cdd [2019-11-15 20:43:45,105 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:43:45,108 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:43:45,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:43:45,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:43:45,114 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:43:45,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:43:45" (1/1) ... [2019-11-15 20:43:45,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@228027dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:45, skipping insertion in model container [2019-11-15 20:43:45,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:43:45" (1/1) ... [2019-11-15 20:43:45,126 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:43:45,183 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:43:45,618 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:43:45,629 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:43:45,689 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:43:45,749 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:43:45,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:45 WrapperNode [2019-11-15 20:43:45,749 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:43:45,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:43:45,751 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:43:45,752 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:43:45,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:45" (1/1) ... [2019-11-15 20:43:45,777 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:45" (1/1) ... [2019-11-15 20:43:45,811 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:43:45,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:43:45,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:43:45,812 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:43:45,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:45" (1/1) ... [2019-11-15 20:43:45,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:45" (1/1) ... [2019-11-15 20:43:45,838 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:45" (1/1) ... [2019-11-15 20:43:45,839 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:45" (1/1) ... [2019-11-15 20:43:45,844 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:45" (1/1) ... [2019-11-15 20:43:45,864 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:45" (1/1) ... [2019-11-15 20:43:45,866 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:45" (1/1) ... [2019-11-15 20:43:45,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:43:45,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:43:45,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:43:45,870 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:43:45,873 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0f6ce3bb-d6b5-474e-aae6-72aafd7f50f5/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:43:45,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 20:43:45,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:43:45,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:43:45,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:43:45,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:43:45,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:43:46,282 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:43:46,283 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 20:43:46,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:43:46 BoogieIcfgContainer [2019-11-15 20:43:46,284 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:43:46,285 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 20:43:46,285 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 20:43:46,289 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 20:43:46,290 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:43:46,290 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 08:43:45" (1/3) ... [2019-11-15 20:43:46,292 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7fd4d4eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:43:46, skipping insertion in model container [2019-11-15 20:43:46,292 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:43:46,292 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:43:45" (2/3) ... [2019-11-15 20:43:46,293 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7fd4d4eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:43:46, skipping insertion in model container [2019-11-15 20:43:46,293 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:43:46,293 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:43:46" (3/3) ... [2019-11-15 20:43:46,294 INFO L371 chiAutomizerObserver]: Analyzing ICFG a.08-alloca.i [2019-11-15 20:43:46,350 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 20:43:46,351 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 20:43:46,351 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 20:43:46,351 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:43:46,351 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:43:46,351 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 20:43:46,352 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:43:46,352 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 20:43:46,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2019-11-15 20:43:46,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:43:46,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:43:46,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:43:46,398 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 20:43:46,398 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:43:46,399 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 20:43:46,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2019-11-15 20:43:46,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:43:46,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:43:46,401 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:43:46,401 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 20:43:46,401 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:43:46,410 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~ret14;test_fun_#in~x, test_fun_#in~y := main_#t~nondet12, main_#t~nondet13;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem11, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 8#L555-5true [2019-11-15 20:43:46,411 INFO L793 eck$LassoCheckResult]: Loop: 8#L555-5true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 11#L555-1true assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647; 5#L555-3true assume !!test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem9, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 + test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 8#L555-5true [2019-11-15 20:43:46,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:46,418 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-15 20:43:46,427 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:46,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919426457] [2019-11-15 20:43:46,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:46,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:46,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:43:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:43:46,628 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:43:46,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:46,629 INFO L82 PathProgramCache]: Analyzing trace with hash 36846, now seen corresponding path program 1 times [2019-11-15 20:43:46,630 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:46,630 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49530223] [2019-11-15 20:43:46,630 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:46,630 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:46,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:46,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:43:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:43:46,670 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:43:46,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:46,672 INFO L82 PathProgramCache]: Analyzing trace with hash 28695788, now seen corresponding path program 1 times [2019-11-15 20:43:46,673 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:46,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621144750] [2019-11-15 20:43:46,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:46,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:46,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:43:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:43:46,753 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:43:47,025 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-11-15 20:43:47,620 WARN L191 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2019-11-15 20:43:47,807 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-15 20:43:47,822 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:43:47,822 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:43:47,823 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:43:47,823 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:43:47,823 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:43:47,824 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:43:47,824 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:43:47,824 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:43:47,825 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.08-alloca.i_Iteration1_Lasso [2019-11-15 20:43:47,825 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:43:47,825 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:43:47,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:43:47,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:43:47,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:43:47,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:43:47,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:43:47,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:43:47,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:43:47,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:43:47,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:43:47,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:43:48,378 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-11-15 20:43:48,550 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-11-15 20:43:48,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:43:48,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:43:48,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:43:48,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:43:48,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:43:48,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:43:49,744 WARN L191 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-11-15 20:43:49,792 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:43:49,804 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:43:49,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:43:49,811 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:43:49,811 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:43:49,812 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:43:49,812 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:43:49,813 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:43:49,815 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:43:49,816 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:43:49,821 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:43:49,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:43:49,826 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:43:49,826 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:43:49,826 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:43:49,826 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:43:49,827 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:43:49,832 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:43:49,833 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:43:49,836 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:43:49,836 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:43:49,837 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:43:49,838 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:43:49,838 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:43:49,839 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:43:49,839 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:43:49,840 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:43:49,840 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:43:49,843 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:43:49,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:43:49,855 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:43:49,855 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:43:49,855 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:43:49,856 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:43:49,857 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:43:49,857 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:43:49,857 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:43:49,859 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:43:49,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:43:49,861 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:43:49,861 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:43:49,861 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:43:49,862 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:43:49,862 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:43:49,862 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:43:49,863 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:43:49,864 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:43:49,866 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:43:49,868 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:43:49,869 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:43:49,869 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:43:49,870 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:43:49,872 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:43:49,873 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:43:49,881 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:43:49,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:43:49,883 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:43:49,883 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:43:49,883 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:43:49,884 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:43:49,884 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:43:49,885 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:43:49,885 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:43:49,887 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:43:49,887 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:43:49,889 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:43:49,889 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:43:49,890 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:43:49,890 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:43:49,898 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:43:49,899 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:43:49,913 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:43:49,918 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:43:49,919 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:43:49,921 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:43:49,922 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:43:49,922 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:43:49,922 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:43:49,923 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:43:49,923 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:43:49,924 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:43:49,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:43:49,928 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:43:49,928 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:43:49,928 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:43:49,929 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:43:49,934 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:43:49,940 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:43:50,015 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:43:50,031 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:43:50,032 INFO L444 ModelExtractionUtils]: 25 out of 28 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 20:43:50,034 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:43:50,035 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:43:50,036 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:43:50,037 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 + 2147483646 Supporting invariants [] [2019-11-15 20:43:50,109 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2019-11-15 20:43:50,118 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:50,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:50,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:43:50,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:43:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:50,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 20:43:50,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:43:50,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:43:50,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:43:50,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:43:50,340 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 20:43:50,341 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states. Second operand 4 states. [2019-11-15 20:43:50,440 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states.. Second operand 4 states. Result 38 states and 44 transitions. Complement of second has 9 states. [2019-11-15 20:43:50,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 20:43:50,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 20:43:50,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2019-11-15 20:43:50,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 2 letters. Loop has 3 letters. [2019-11-15 20:43:50,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:43:50,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-15 20:43:50,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:43:50,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 2 letters. Loop has 6 letters. [2019-11-15 20:43:50,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:43:50,450 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 44 transitions. [2019-11-15 20:43:50,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:43:50,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 12 states and 15 transitions. [2019-11-15 20:43:50,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 20:43:50,465 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-15 20:43:50,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2019-11-15 20:43:50,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:43:50,466 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-11-15 20:43:50,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2019-11-15 20:43:50,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-11-15 20:43:50,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-15 20:43:50,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-11-15 20:43:50,499 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-15 20:43:50,499 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-15 20:43:50,500 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 20:43:50,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-11-15 20:43:50,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:43:50,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:43:50,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:43:50,501 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 20:43:50,501 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:43:50,501 INFO L791 eck$LassoCheckResult]: Stem: 176#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 174#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~ret14;test_fun_#in~x, test_fun_#in~y := main_#t~nondet12, main_#t~nondet13;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem11, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 175#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 181#L555-1 [2019-11-15 20:43:50,501 INFO L793 eck$LassoCheckResult]: Loop: 181#L555-1 assume !test_fun_#t~short8; 177#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem9, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 + test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 178#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 181#L555-1 [2019-11-15 20:43:50,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:50,501 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-11-15 20:43:50,502 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:50,502 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164412327] [2019-11-15 20:43:50,502 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:50,502 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:50,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:43:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:43:50,564 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:43:50,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:50,565 INFO L82 PathProgramCache]: Analyzing trace with hash 41888, now seen corresponding path program 1 times [2019-11-15 20:43:50,565 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:50,566 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164954604] [2019-11-15 20:43:50,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:50,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:50,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:50,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:43:50,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164954604] [2019-11-15 20:43:50,635 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:50,635 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:43:50,635 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92687029] [2019-11-15 20:43:50,638 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:43:50,638 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:50,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:43:50,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:43:50,643 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-15 20:43:50,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:50,665 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-11-15 20:43:50,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:43:50,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2019-11-15 20:43:50,666 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:43:50,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2019-11-15 20:43:50,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 20:43:50,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 20:43:50,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 20:43:50,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:43:50,667 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:43:50,668 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:43:50,668 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:43:50,668 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 20:43:50,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:43:50,668 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:43:50,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 20:43:50,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 08:43:50 BoogieIcfgContainer [2019-11-15 20:43:50,675 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 20:43:50,676 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:43:50,676 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:43:50,676 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:43:50,676 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:43:46" (3/4) ... [2019-11-15 20:43:50,680 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 20:43:50,681 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:43:50,683 INFO L168 Benchmark]: Toolchain (without parser) took 5575.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 214.4 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -140.9 MB). Peak memory consumption was 73.6 MB. Max. memory is 11.5 GB. [2019-11-15 20:43:50,684 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:43:50,686 INFO L168 Benchmark]: CACSL2BoogieTranslator took 641.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -190.1 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:43:50,686 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.85 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:43:50,687 INFO L168 Benchmark]: Boogie Preprocessor took 57.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:43:50,688 INFO L168 Benchmark]: RCFGBuilder took 414.94 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: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:43:50,689 INFO L168 Benchmark]: BuchiAutomizer took 4390.55 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.0 MB). Peak memory consumption was 83.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:43:50,690 INFO L168 Benchmark]: Witness Printer took 5.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:43:50,698 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.35 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 641.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -190.1 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.85 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.82 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 414.94 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: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4390.55 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.0 MB). Peak memory consumption was 83.9 MB. Max. memory is 11.5 GB. * Witness Printer took 5.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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 -1 * unknown-#memory_int-unknown[y_ref][y_ref] + 2147483646 and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.3s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 11 SDtfs, 10 SDslu, 10 SDs, 0 SdLazy, 23 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital294 mio100 ax106 hnf100 lsp92 ukn57 mio100 lsp34 div100 bol100 ite100 ukn100 eq198 hnf87 smp100 dnf337 smp91 tf100 neg92 sie127 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...