./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.09_assume-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_68b337e3-1405-40a2-9304-72f61a734ae2/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_68b337e3-1405-40a2-9304-72f61a734ae2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_68b337e3-1405-40a2-9304-72f61a734ae2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_68b337e3-1405-40a2-9304-72f61a734ae2/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_68b337e3-1405-40a2-9304-72f61a734ae2/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_68b337e3-1405-40a2-9304-72f61a734ae2/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 25885afdfdd91cf9312b78ad87a032f4ef31fe0c .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:27:40,055 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:27:40,057 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:27:40,068 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:27:40,068 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:27:40,069 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:27:40,070 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:27:40,072 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:27:40,074 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:27:40,075 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:27:40,076 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:27:40,078 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:27:40,078 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:27:40,079 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:27:40,080 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:27:40,081 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:27:40,082 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:27:40,083 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:27:40,084 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:27:40,086 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:27:40,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:27:40,089 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:27:40,090 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:27:40,090 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:27:40,093 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:27:40,093 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:27:40,093 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:27:40,094 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:27:40,094 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:27:40,095 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:27:40,095 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:27:40,096 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:27:40,097 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:27:40,097 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:27:40,098 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:27:40,099 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:27:40,099 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:27:40,099 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:27:40,100 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:27:40,100 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:27:40,101 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:27:40,102 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_68b337e3-1405-40a2-9304-72f61a734ae2/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-16 00:27:40,117 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:27:40,117 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:27:40,118 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:27:40,119 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:27:40,119 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:27:40,119 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:27:40,119 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:27:40,120 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:27:40,120 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:27:40,120 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:27:40,120 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:27:40,120 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:27:40,121 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:27:40,121 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:27:40,121 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:27:40,121 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:27:40,122 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:27:40,122 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:27:40,122 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:27:40,122 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:27:40,122 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:27:40,123 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:27:40,123 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:27:40,123 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:27:40,123 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:27:40,124 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:27:40,124 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:27:40,124 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:27:40,125 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:27:40,125 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_68b337e3-1405-40a2-9304-72f61a734ae2/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 -> 25885afdfdd91cf9312b78ad87a032f4ef31fe0c [2019-11-16 00:27:40,153 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:27:40,171 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:27:40,174 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:27:40,176 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:27:40,176 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:27:40,177 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_68b337e3-1405-40a2-9304-72f61a734ae2/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca.i [2019-11-16 00:27:40,241 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_68b337e3-1405-40a2-9304-72f61a734ae2/bin/uautomizer/data/56ffa7c03/4520cd185e394a87a5ba7650648a391d/FLAG910c745ac [2019-11-16 00:27:40,765 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:27:40,765 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_68b337e3-1405-40a2-9304-72f61a734ae2/sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca.i [2019-11-16 00:27:40,777 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_68b337e3-1405-40a2-9304-72f61a734ae2/bin/uautomizer/data/56ffa7c03/4520cd185e394a87a5ba7650648a391d/FLAG910c745ac [2019-11-16 00:27:41,148 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_68b337e3-1405-40a2-9304-72f61a734ae2/bin/uautomizer/data/56ffa7c03/4520cd185e394a87a5ba7650648a391d [2019-11-16 00:27:41,151 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:27:41,159 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:27:41,160 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:27:41,160 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:27:41,163 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:27:41,164 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:27:41" (1/1) ... [2019-11-16 00:27:41,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b85dbe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:41, skipping insertion in model container [2019-11-16 00:27:41,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:27:41" (1/1) ... [2019-11-16 00:27:41,173 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:27:41,224 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:27:41,554 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:27:41,564 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:27:41,608 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:27:41,665 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:27:41,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:41 WrapperNode [2019-11-16 00:27:41,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:27:41,666 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:27:41,666 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:27:41,667 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:27:41,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:41" (1/1) ... [2019-11-16 00:27:41,689 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:41" (1/1) ... [2019-11-16 00:27:41,709 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:27:41,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:27:41,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:27:41,710 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:27:41,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:41" (1/1) ... [2019-11-16 00:27:41,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:41" (1/1) ... [2019-11-16 00:27:41,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:41" (1/1) ... [2019-11-16 00:27:41,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:41" (1/1) ... [2019-11-16 00:27:41,729 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:41" (1/1) ... [2019-11-16 00:27:41,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:41" (1/1) ... [2019-11-16 00:27:41,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:41" (1/1) ... [2019-11-16 00:27:41,738 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:27:41,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:27:41,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:27:41,739 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:27:41,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68b337e3-1405-40a2-9304-72f61a734ae2/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:27:41,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:27:41,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:27:41,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:27:41,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:27:41,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:27:41,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:27:42,150 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:27:42,151 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:27:42,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:27:42 BoogieIcfgContainer [2019-11-16 00:27:42,152 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:27:42,153 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:27:42,153 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:27:42,156 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:27:42,157 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:27:42,157 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:27:41" (1/3) ... [2019-11-16 00:27:42,158 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a60b7dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:27:42, skipping insertion in model container [2019-11-16 00:27:42,158 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:27:42,159 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:41" (2/3) ... [2019-11-16 00:27:42,159 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a60b7dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:27:42, skipping insertion in model container [2019-11-16 00:27:42,159 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:27:42,159 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:27:42" (3/3) ... [2019-11-16 00:27:42,161 INFO L371 chiAutomizerObserver]: Analyzing ICFG b.09_assume-alloca.i [2019-11-16 00:27:42,212 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:27:42,212 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:27:42,213 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:27:42,213 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:27:42,213 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:27:42,213 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:27:42,213 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:27:42,213 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:27:42,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-11-16 00:27:42,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:27:42,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:27:42,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:27:42,272 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-16 00:27:42,272 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:27:42,272 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:27:42,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-11-16 00:27:42,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:27:42,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:27:42,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:27:42,277 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-16 00:27:42,277 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:27:42,286 INFO L791 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;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~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, 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);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 6#L555true assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 10#L555-2true assume !test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6; 7#L558-3true [2019-11-16 00:27:42,288 INFO L793 eck$LassoCheckResult]: Loop: 7#L558-3true call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 4#L558-1true assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 16#L559true assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 5#L559-2true call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 7#L558-3true [2019-11-16 00:27:42,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:42,294 INFO L82 PathProgramCache]: Analyzing trace with hash 925673, now seen corresponding path program 1 times [2019-11-16 00:27:42,303 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:42,303 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201345239] [2019-11-16 00:27:42,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:42,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:42,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:42,583 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:27:42,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:42,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1482703, now seen corresponding path program 1 times [2019-11-16 00:27:42,585 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:42,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694400961] [2019-11-16 00:27:42,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:42,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:42,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:42,616 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:27:42,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:42,618 INFO L82 PathProgramCache]: Analyzing trace with hash 180521911, now seen corresponding path program 1 times [2019-11-16 00:27:42,618 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:42,618 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117998067] [2019-11-16 00:27:42,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:42,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:42,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:42,690 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:27:42,866 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-16 00:27:43,682 WARN L191 SmtUtils]: Spent 736.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 101 [2019-11-16 00:27:43,929 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-11-16 00:27:43,943 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:27:43,944 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:27:43,944 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:27:43,944 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:27:43,945 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:27:43,945 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:27:43,945 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:27:43,945 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:27:43,945 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.09_assume-alloca.i_Iteration1_Lasso [2019-11-16 00:27:43,948 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:27:43,948 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:27:43,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:44,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:44,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:44,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:44,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:44,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:44,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:44,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:44,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:44,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:44,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:44,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:44,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:44,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:44,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:44,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:44,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:44,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:44,551 WARN L191 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-11-16 00:27:44,740 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-11-16 00:27:44,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:44,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:44,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:44,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:45,541 WARN L191 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-11-16 00:27:45,781 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:27:45,786 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:27:45,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:45,790 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:45,791 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:45,791 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:45,792 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:45,792 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:45,794 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:45,794 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:45,796 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:45,797 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:45,798 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:45,798 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:45,798 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:45,798 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:45,799 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:45,799 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:45,799 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:45,800 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:45,801 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:45,801 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:45,802 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:45,802 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:45,802 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:45,802 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:45,803 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:45,803 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:45,804 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:45,804 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:45,805 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:45,805 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:45,806 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:45,806 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:45,806 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:45,806 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:45,807 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:45,807 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:45,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:45,809 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:45,809 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:45,809 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:45,809 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:45,809 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:45,810 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:45,810 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:45,811 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:45,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:45,813 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:45,813 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:45,813 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:45,813 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:45,816 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:27:45,816 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:27:45,819 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:45,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:45,821 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:45,821 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:45,821 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:45,821 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:45,822 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:45,822 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:45,822 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:45,823 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:45,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-16 00:27:45,825 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:45,825 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:45,825 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:45,825 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:45,827 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:27:45,828 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:27:45,833 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:45,833 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:45,834 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:45,835 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:45,835 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:45,835 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:45,837 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:27:45,837 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:27:45,840 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:45,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:45,842 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:45,842 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:45,842 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:45,842 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:45,842 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:45,843 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:45,843 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:45,844 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:45,844 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:45,845 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:45,845 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:45,846 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:45,846 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:45,846 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:45,846 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:45,847 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:45,847 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:45,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:45,849 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:45,849 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:45,849 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:45,849 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:45,851 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:27:45,851 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:27:45,854 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:45,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:45,856 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:45,856 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:45,856 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:45,857 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:45,857 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:45,857 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:45,857 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:45,858 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:45,859 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:45,860 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:45,860 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:45,860 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:45,860 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:45,860 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:45,861 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:45,861 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:45,862 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:45,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:45,863 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:45,863 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:45,864 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:45,864 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:45,864 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:45,865 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:45,865 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:45,866 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:45,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-16 00:27:45,867 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:45,867 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:45,867 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:45,868 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:45,869 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:27:45,870 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:27:45,873 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:45,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:45,874 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:45,874 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:45,875 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:45,875 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:45,875 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:45,875 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:45,876 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:45,877 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:45,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:45,878 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:45,878 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-11-16 00:27:45,878 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:45,879 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:45,890 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-16 00:27:45,891 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:27:45,956 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:45,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:45,958 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:45,958 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:45,958 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:45,959 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:45,960 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:27:45,960 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:27:45,971 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:45,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:45,973 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:45,973 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:45,973 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:45,973 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:45,975 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:27:45,975 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:27:45,978 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:45,978 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:45,979 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:45,979 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:45,980 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:27:45,980 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:45,991 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-16 00:27:45,991 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-16 00:27:46,199 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:27:46,291 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-16 00:27:46,292 INFO L444 ModelExtractionUtils]: 36 out of 46 variables were initially zero. Simplification set additionally 7 variables to zero. [2019-11-16 00:27:46,294 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:27:46,297 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-11-16 00:27:46,297 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:27:46,299 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1, 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_~x_ref~0.base) ULTIMATE.start_test_fun_~x_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 Supporting invariants [] [2019-11-16 00:27:46,406 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-11-16 00:27:46,420 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:27:46,422 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:27:46,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:46,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-16 00:27:46,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:46,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:46,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:46,655 INFO L567 ElimStorePlain]: treesize reduction 2, result has 94.9 percent of original size [2019-11-16 00:27:46,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-16 00:27:46,657 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:71, output treesize:24 [2019-11-16 00:27:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:46,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:27:46,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:46,845 INFO L341 Elim1Store]: treesize reduction 24, result has 45.5 percent of original size [2019-11-16 00:27:46,845 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 37 [2019-11-16 00:27:46,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:46,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:46,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:46,862 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:27:46,862 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:27 [2019-11-16 00:27:46,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:27:46,909 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2019-11-16 00:27:46,910 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 7 states. [2019-11-16 00:27:47,040 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 7 states. Result 37 states and 45 transitions. Complement of second has 8 states. [2019-11-16 00:27:47,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:27:47,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-16 00:27:47,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2019-11-16 00:27:47,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 4 letters. Loop has 4 letters. [2019-11-16 00:27:47,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:27:47,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 8 letters. Loop has 4 letters. [2019-11-16 00:27:47,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:27:47,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 4 letters. Loop has 8 letters. [2019-11-16 00:27:47,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:27:47,049 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 45 transitions. [2019-11-16 00:27:47,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:27:47,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 18 states and 22 transitions. [2019-11-16 00:27:47,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-16 00:27:47,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-16 00:27:47,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2019-11-16 00:27:47,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:27:47,059 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-11-16 00:27:47,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2019-11-16 00:27:47,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2019-11-16 00:27:47,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-16 00:27:47,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-11-16 00:27:47,088 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-11-16 00:27:47,088 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-11-16 00:27:47,088 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:27:47,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2019-11-16 00:27:47,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:27:47,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:27:47,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:27:47,090 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:27:47,090 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-16 00:27:47,091 INFO L791 eck$LassoCheckResult]: Stem: 211#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 207#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;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~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, 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);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 208#L555 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 209#L555-2 assume !test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6; 210#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 216#L558-1 [2019-11-16 00:27:47,091 INFO L793 eck$LassoCheckResult]: Loop: 216#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 217#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 220#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 212#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 213#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 216#L558-1 [2019-11-16 00:27:47,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:47,092 INFO L82 PathProgramCache]: Analyzing trace with hash 28695881, now seen corresponding path program 1 times [2019-11-16 00:27:47,092 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:47,092 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239171469] [2019-11-16 00:27:47,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:47,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:47,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:47,125 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:27:47,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:47,125 INFO L82 PathProgramCache]: Analyzing trace with hash 50737098, now seen corresponding path program 1 times [2019-11-16 00:27:47,126 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:47,126 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187363368] [2019-11-16 00:27:47,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:47,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:47,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:47,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:47,144 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:27:47,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:47,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1682923394, now seen corresponding path program 1 times [2019-11-16 00:27:47,145 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:47,145 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480725561] [2019-11-16 00:27:47,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:47,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:47,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:47,182 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:27:47,800 WARN L191 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 103 [2019-11-16 00:27:47,939 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-16 00:27:47,947 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:27:47,947 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:27:47,947 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:27:47,947 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:27:47,948 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:27:47,948 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:27:47,948 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:27:47,948 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:27:47,948 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.09_assume-alloca.i_Iteration2_Lasso [2019-11-16 00:27:47,948 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:27:47,948 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:27:47,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:47,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:48,413 WARN L191 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2019-11-16 00:27:48,540 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-11-16 00:27:48,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:48,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:48,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:48,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:48,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:48,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:48,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:48,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27: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-16 00:27:48,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:48,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:48,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27: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-16 00:27:48,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:48,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:48,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:48,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:48,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:48,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-11-16 00:27:49,353 WARN L191 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-11-16 00:27:49,566 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:27:49,566 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:27:49,566 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:49,567 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:49,567 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:49,567 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:49,567 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:49,567 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:49,568 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:49,568 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:49,569 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:49,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:49,569 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:49,570 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:49,570 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:49,570 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:49,571 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:27:49,571 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:27:49,576 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:49,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:49,577 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:49,577 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-11-16 00:27:49,577 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:49,577 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:49,582 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-16 00:27:49,582 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:27:49,605 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:49,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:49,606 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:49,607 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:49,607 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:49,607 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:49,608 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:27:49,608 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:27:49,609 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:49,610 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:49,610 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:49,610 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:49,611 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:49,611 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:49,612 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:27:49,612 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:27:49,617 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:49,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:49,618 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:49,618 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:49,618 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:49,619 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:49,620 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:27:49,620 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:27:49,624 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:49,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:49,625 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:49,625 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:49,626 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:27:49,626 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:49,632 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-16 00:27:49,632 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-16 00:27:49,745 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:27:49,780 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:27:49,781 INFO L444 ModelExtractionUtils]: 44 out of 51 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-11-16 00:27:49,781 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:27:49,783 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-11-16 00:27:49,783 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:27:49,784 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 Supporting invariants [] [2019-11-16 00:27:49,878 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-11-16 00:27:49,879 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:27:49,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:49,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-16 00:27:49,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:49,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:49,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:49,983 INFO L567 ElimStorePlain]: treesize reduction 2, result has 94.9 percent of original size [2019-11-16 00:27:49,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-16 00:27:49,985 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:71, output treesize:24 [2019-11-16 00:27:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:50,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:27:50,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:50,080 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2019-11-16 00:27:50,081 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:50,088 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:50,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:27:50,089 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-11-16 00:27:50,129 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2019-11-16 00:27:50,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:50,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:50,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:27:50,142 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:21 [2019-11-16 00:27:50,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:27:50,143 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2019-11-16 00:27:50,143 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 7 states. [2019-11-16 00:27:50,212 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 37 states and 44 transitions. Complement of second has 8 states. [2019-11-16 00:27:50,214 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-11-16 00:27:50,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-16 00:27:50,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-16 00:27:50,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 5 letters. Loop has 5 letters. [2019-11-16 00:27:50,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:27:50,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 10 letters. Loop has 5 letters. [2019-11-16 00:27:50,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:27:50,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-16 00:27:50,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:27:50,217 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2019-11-16 00:27:50,218 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:27:50,219 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 25 states and 30 transitions. [2019-11-16 00:27:50,219 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-16 00:27:50,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-16 00:27:50,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 30 transitions. [2019-11-16 00:27:50,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:27:50,219 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2019-11-16 00:27:50,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 30 transitions. [2019-11-16 00:27:50,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-11-16 00:27:50,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-16 00:27:50,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2019-11-16 00:27:50,221 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2019-11-16 00:27:50,221 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2019-11-16 00:27:50,221 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:27:50,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 30 transitions. [2019-11-16 00:27:50,222 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:27:50,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:27:50,223 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:27:50,223 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:27:50,223 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-16 00:27:50,224 INFO L791 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 419#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;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~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, 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);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 420#L555 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 421#L555-2 assume !test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6; 422#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 434#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 438#L559 assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 437#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 425#L558-3 [2019-11-16 00:27:50,224 INFO L793 eck$LassoCheckResult]: Loop: 425#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 428#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 429#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 432#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 424#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 425#L558-3 [2019-11-16 00:27:50,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:50,224 INFO L82 PathProgramCache]: Analyzing trace with hash 180521911, now seen corresponding path program 2 times [2019-11-16 00:27:50,225 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:50,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821710140] [2019-11-16 00:27:50,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:50,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:50,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:50,255 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:27:50,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:50,256 INFO L82 PathProgramCache]: Analyzing trace with hash 45965688, now seen corresponding path program 2 times [2019-11-16 00:27:50,256 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:50,256 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299968126] [2019-11-16 00:27:50,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:50,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:50,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:50,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:50,268 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:27:50,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:50,269 INFO L82 PathProgramCache]: Analyzing trace with hash -915687550, now seen corresponding path program 1 times [2019-11-16 00:27:50,269 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:50,269 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658931706] [2019-11-16 00:27:50,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:50,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:50,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:50,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:50,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:50,305 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:27:50,443 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-11-16 00:27:51,222 WARN L191 SmtUtils]: Spent 742.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 120 [2019-11-16 00:27:51,500 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-16 00:27:51,503 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:27:51,503 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:27:51,503 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:27:51,503 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:27:51,504 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:27:51,504 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:27:51,504 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:27:51,504 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:27:51,504 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.09_assume-alloca.i_Iteration3_Lasso [2019-11-16 00:27:51,504 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:27:51,504 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:27:51,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:51,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:51,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:51,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:51,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:51,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:51,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:51,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:51,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:51,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:51,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:51,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:51,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:51,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:51,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:51,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:51,931 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2019-11-16 00:27:52,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:52,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:52,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:52,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:52,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:52,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:52,669 WARN L191 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-11-16 00:27:52,816 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:27:52,816 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:27:52,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:52,817 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:52,817 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:52,817 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:52,818 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:52,818 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:52,818 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:52,818 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:52,819 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:52,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:52,820 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:52,820 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:52,820 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:52,820 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:52,820 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:52,820 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:52,820 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:52,821 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:52,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:52,821 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:52,821 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:52,822 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:52,822 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:52,822 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:27:52,822 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:27:52,823 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:52,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-16 00:27:52,824 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:52,824 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:52,825 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:52,825 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:52,825 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:27:52,826 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:27:52,826 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:52,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:52,827 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:52,827 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:52,828 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:52,828 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:52,828 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:52,828 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:52,828 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:52,829 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:52,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:52,830 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:52,830 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:52,830 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:52,830 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:52,830 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:52,830 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:52,831 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:52,831 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:52,831 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:52,832 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:52,832 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:52,832 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:52,832 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:52,833 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:27:52,833 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:27:52,834 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:52,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:52,835 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:52,835 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:52,835 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:52,835 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:52,836 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:52,836 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:52,836 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:52,836 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:52,837 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:52,837 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:52,837 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:52,838 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:52,838 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:52,838 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:52,838 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:52,838 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:52,839 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:52,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:52,839 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:52,840 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:52,840 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:52,840 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:52,840 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:52,840 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:52,840 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:52,841 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:52,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:52,842 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:52,842 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:52,842 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:52,842 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:52,842 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:52,842 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:52,843 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:52,843 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:52,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:52,844 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:52,844 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:52,844 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:52,844 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:52,844 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:52,845 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:52,845 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:52,845 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:52,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:52,846 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:52,846 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:52,846 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:52,846 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:52,847 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:27:52,847 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:27:52,848 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:52,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:52,849 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:52,849 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:52,849 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:52,849 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:52,849 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:52,850 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:52,850 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:52,850 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:52,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:52,851 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:52,851 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:52,851 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:52,852 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:52,852 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:52,852 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:52,852 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:52,852 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:52,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:52,853 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:52,854 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:52,854 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:52,854 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:52,854 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:27:52,855 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:27:52,857 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:52,858 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:52,858 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:52,859 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-11-16 00:27:52,859 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:52,859 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:52,862 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-16 00:27:52,862 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:27:52,877 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:52,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:52,878 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:52,878 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:52,879 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:52,879 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:52,879 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:27:52,880 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:27:52,883 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:52,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:52,884 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:52,884 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:52,884 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:52,884 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:52,885 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:27:52,885 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:27:52,888 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:52,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:52,889 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:52,889 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:52,889 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:52,889 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:52,890 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:27:52,890 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:27:52,891 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:52,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:52,892 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:52,892 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:52,892 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:52,892 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:52,893 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:27:52,893 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:27:52,896 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:52,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:52,897 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:52,898 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:52,898 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:52,898 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:52,899 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:27:52,899 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:27:52,913 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:27:52,927 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-16 00:27:52,927 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-16 00:27:52,927 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:27:52,928 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:27:52,928 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:27:52,928 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 Supporting invariants [] [2019-11-16 00:27:53,014 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-11-16 00:27:53,016 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:27:53,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:53,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-16 00:27:53,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:53,130 INFO L341 Elim1Store]: treesize reduction 19, result has 76.5 percent of original size [2019-11-16 00:27:53,130 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 69 [2019-11-16 00:27:53,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:53,182 INFO L567 ElimStorePlain]: treesize reduction 28, result has 61.6 percent of original size [2019-11-16 00:27:53,182 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:27:53,183 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:12 [2019-11-16 00:27:53,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:53,259 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:53,259 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 45 [2019-11-16 00:27:53,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:53,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:53,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:53,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:53,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:53,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-16 00:27:53,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:53,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-16 00:27:53,288 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:50 [2019-11-16 00:27:53,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:53,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:27:53,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:53,377 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2019-11-16 00:27:53,378 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:53,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:53,384 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:27:53,385 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-11-16 00:27:53,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:27:53,405 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 3 loop predicates [2019-11-16 00:27:53,405 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 30 transitions. cyclomatic complexity: 8 Second operand 10 states. [2019-11-16 00:27:53,607 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 30 transitions. cyclomatic complexity: 8. Second operand 10 states. Result 60 states and 72 transitions. Complement of second has 11 states. [2019-11-16 00:27:53,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:27:53,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-16 00:27:53,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2019-11-16 00:27:53,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 8 letters. Loop has 5 letters. [2019-11-16 00:27:53,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:27:53,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 13 letters. Loop has 5 letters. [2019-11-16 00:27:53,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:27:53,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 8 letters. Loop has 10 letters. [2019-11-16 00:27:53,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:27:53,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 72 transitions. [2019-11-16 00:27:53,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:27:53,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 41 states and 49 transitions. [2019-11-16 00:27:53,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-16 00:27:53,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-16 00:27:53,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 49 transitions. [2019-11-16 00:27:53,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:27:53,616 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-11-16 00:27:53,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 49 transitions. [2019-11-16 00:27:53,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2019-11-16 00:27:53,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-16 00:27:53,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-11-16 00:27:53,626 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-11-16 00:27:53,626 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-11-16 00:27:53,626 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:27:53,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2019-11-16 00:27:53,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:27:53,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:27:53,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:27:53,631 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1] [2019-11-16 00:27:53,631 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-16 00:27:53,631 INFO L791 eck$LassoCheckResult]: Stem: 689#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 685#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;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~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, 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);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 686#L555 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 687#L555-2 assume !test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6; 688#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 700#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 709#L559 assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 708#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 707#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 705#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 704#L559 assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 703#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 695#L558-3 [2019-11-16 00:27:53,632 INFO L793 eck$LassoCheckResult]: Loop: 695#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 690#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 691#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 698#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 694#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 695#L558-3 [2019-11-16 00:27:53,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:53,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1969201019, now seen corresponding path program 3 times [2019-11-16 00:27:53,632 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:53,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904370952] [2019-11-16 00:27:53,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:53,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:53,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:53,839 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:27:53,840 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904370952] [2019-11-16 00:27:53,840 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297694558] [2019-11-16 00:27:53,840 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68b337e3-1405-40a2-9304-72f61a734ae2/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:27:53,931 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-16 00:27:53,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:27:53,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-16 00:27:53,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:53,976 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:53,977 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-16 00:27:53,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:53,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:54,005 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 22 [2019-11-16 00:27:54,006 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:54,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:54,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:27:54,023 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:26 [2019-11-16 00:27:54,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:54,143 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:54,144 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 36 [2019-11-16 00:27:54,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:54,165 INFO L567 ElimStorePlain]: treesize reduction 16, result has 71.4 percent of original size [2019-11-16 00:27:54,166 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:27:54,166 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2019-11-16 00:27:54,216 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:54,216 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 59 [2019-11-16 00:27:54,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:54,265 INFO L567 ElimStorePlain]: treesize reduction 24, result has 63.1 percent of original size [2019-11-16 00:27:54,266 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:27:54,266 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:41 [2019-11-16 00:27:54,295 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2019-11-16 00:27:54,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:54,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:54,305 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:27:54,305 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:7 [2019-11-16 00:27:54,321 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:27:54,321 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:27:54,321 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-11-16 00:27:54,321 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530287005] [2019-11-16 00:27:54,323 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:27:54,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:54,324 INFO L82 PathProgramCache]: Analyzing trace with hash 45965688, now seen corresponding path program 3 times [2019-11-16 00:27:54,324 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:54,324 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915052196] [2019-11-16 00:27:54,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:54,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:54,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:54,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:54,333 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:27:54,461 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-11-16 00:27:54,493 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:54,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-16 00:27:54,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:27:54,496 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand 14 states. [2019-11-16 00:27:54,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:54,708 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2019-11-16 00:27:54,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:27:54,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 49 transitions. [2019-11-16 00:27:54,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:27:54,711 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 23 states and 26 transitions. [2019-11-16 00:27:54,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-16 00:27:54,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-16 00:27:54,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2019-11-16 00:27:54,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:27:54,712 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-11-16 00:27:54,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2019-11-16 00:27:54,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2019-11-16 00:27:54,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-16 00:27:54,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-11-16 00:27:54,714 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-16 00:27:54,714 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-16 00:27:54,714 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:27:54,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2019-11-16 00:27:54,714 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:27:54,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:27:54,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:27:54,715 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:27:54,715 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-16 00:27:54,715 INFO L791 eck$LassoCheckResult]: Stem: 817#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 813#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;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~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, 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);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 814#L555 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 815#L555-2 assume !test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6; 816#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 820#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 821#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 828#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 824#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 825#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 818#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 819#L559 assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 822#L559-2 [2019-11-16 00:27:54,715 INFO L793 eck$LassoCheckResult]: Loop: 822#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 823#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 830#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 829#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 827#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 822#L559-2 [2019-11-16 00:27:54,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:54,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1913288219, now seen corresponding path program 2 times [2019-11-16 00:27:54,716 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:54,716 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45894099] [2019-11-16 00:27:54,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:54,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:54,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:54,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:27:54,865 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45894099] [2019-11-16 00:27:54,865 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178281791] [2019-11-16 00:27:54,865 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68b337e3-1405-40a2-9304-72f61a734ae2/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:27:54,950 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:27:54,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:27:54,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-16 00:27:54,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:54,968 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:54,968 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-16 00:27:54,968 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:54,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:55,006 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 22 [2019-11-16 00:27:55,006 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:55,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:55,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:27:55,023 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:26 [2019-11-16 00:27:55,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:55,215 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:55,215 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2019-11-16 00:27:55,216 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:55,246 INFO L567 ElimStorePlain]: treesize reduction 12, result has 77.8 percent of original size [2019-11-16 00:27:55,246 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:27:55,246 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:42 [2019-11-16 00:27:55,313 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:55,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 61 [2019-11-16 00:27:55,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:55,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:55,315 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:55,349 INFO L567 ElimStorePlain]: treesize reduction 20, result has 68.3 percent of original size [2019-11-16 00:27:55,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:27:55,350 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:43 [2019-11-16 00:27:55,391 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2019-11-16 00:27:55,392 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:55,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:55,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:27:55,400 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:9 [2019-11-16 00:27:55,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:27:55,416 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:27:55,416 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2019-11-16 00:27:55,416 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178569665] [2019-11-16 00:27:55,417 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:27:55,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:55,417 INFO L82 PathProgramCache]: Analyzing trace with hash 61511628, now seen corresponding path program 4 times [2019-11-16 00:27:55,417 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:55,417 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062899751] [2019-11-16 00:27:55,417 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:55,417 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:55,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:55,426 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:27:55,533 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-11-16 00:27:55,563 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:55,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-16 00:27:55,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:27:55,564 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand 17 states. [2019-11-16 00:27:55,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:55,777 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-11-16 00:27:55,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:27:55,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 27 transitions. [2019-11-16 00:27:55,778 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:27:55,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2019-11-16 00:27:55,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:27:55,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:27:55,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:27:55,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:27:55,779 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:27:55,779 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:27:55,779 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:27:55,779 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:27:55,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:27:55,779 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:27:55,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:27:55,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:27:55 BoogieIcfgContainer [2019-11-16 00:27:55,784 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:27:55,784 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:27:55,784 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:27:55,784 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:27:55,784 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:27:42" (3/4) ... [2019-11-16 00:27:55,787 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:27:55,787 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:27:55,788 INFO L168 Benchmark]: Toolchain (without parser) took 14636.39 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 391.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -192.5 MB). Peak memory consumption was 199.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:27:55,789 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:27:55,789 INFO L168 Benchmark]: CACSL2BoogieTranslator took 506.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -168.7 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:27:55,790 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.05 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:27:55,790 INFO L168 Benchmark]: Boogie Preprocessor took 28.28 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.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:27:55,791 INFO L168 Benchmark]: RCFGBuilder took 414.02 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: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:27:55,791 INFO L168 Benchmark]: BuchiAutomizer took 13631.00 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 262.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -53.6 MB). Peak memory consumption was 209.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:27:55,792 INFO L168 Benchmark]: Witness Printer took 3.22 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:27:55,794 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 506.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -168.7 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.05 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.28 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.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 414.02 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: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13631.00 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 262.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -53.6 MB). Peak memory consumption was 209.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.22 ms. Allocated memory is still 1.4 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] + -1 * unknown-#memory_int-unknown[y_ref][y_ref] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 8 locations. 2 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.5s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 11.4s. Construction of modules took 0.3s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 20 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 27 SDtfs, 125 SDslu, 38 SDs, 0 SdLazy, 219 SolverSat, 119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital560 mio100 ax104 hnf100 lsp94 ukn47 mio100 lsp36 div100 bol100 ite100 ukn100 eq182 hnf88 smp96 dnf298 smp92 tf100 neg92 sie126 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 79ms 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...