./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/c.01_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_2d2a2c44-d3ff-45f6-8e07-c8e7053fdb13/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2d2a2c44-d3ff-45f6-8e07-c8e7053fdb13/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2d2a2c44-d3ff-45f6-8e07-c8e7053fdb13/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2d2a2c44-d3ff-45f6-8e07-c8e7053fdb13/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/c.01_assume-alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_2d2a2c44-d3ff-45f6-8e07-c8e7053fdb13/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2d2a2c44-d3ff-45f6-8e07-c8e7053fdb13/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 b4afea49cf97a69d20f4a5a7301b61ef07ffc206 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:20:44,040 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:20:44,042 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:20:44,060 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:20:44,060 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:20:44,062 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:20:44,064 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:20:44,074 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:20:44,079 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:20:44,083 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:20:44,085 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:20:44,087 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:20:44,088 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:20:44,090 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:20:44,091 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:20:44,092 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:20:44,093 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:20:44,095 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:20:44,098 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:20:44,101 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:20:44,105 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:20:44,107 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:20:44,110 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:20:44,110 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:20:44,114 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:20:44,114 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:20:44,115 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:20:44,116 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:20:44,117 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:20:44,118 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:20:44,118 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:20:44,119 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:20:44,119 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:20:44,120 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:20:44,121 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:20:44,122 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:20:44,123 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:20:44,123 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:20:44,123 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:20:44,124 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:20:44,125 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:20:44,126 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2d2a2c44-d3ff-45f6-8e07-c8e7053fdb13/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 21:20:44,155 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:20:44,166 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:20:44,167 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:20:44,168 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:20:44,168 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:20:44,168 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 21:20:44,168 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 21:20:44,169 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 21:20:44,169 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 21:20:44,169 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 21:20:44,169 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 21:20:44,170 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:20:44,170 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:20:44,170 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:20:44,171 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:20:44,171 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 21:20:44,171 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 21:20:44,171 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 21:20:44,172 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:20:44,172 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 21:20:44,172 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:20:44,173 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 21:20:44,174 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:20:44,174 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:20:44,174 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 21:20:44,175 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:20:44,175 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:20:44,175 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 21:20:44,177 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 21:20:44,179 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_2d2a2c44-d3ff-45f6-8e07-c8e7053fdb13/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 -> b4afea49cf97a69d20f4a5a7301b61ef07ffc206 [2019-11-15 21:20:44,216 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:20:44,232 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:20:44,236 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:20:44,237 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:20:44,238 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:20:44,240 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2d2a2c44-d3ff-45f6-8e07-c8e7053fdb13/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/c.01_assume-alloca.i [2019-11-15 21:20:44,310 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2d2a2c44-d3ff-45f6-8e07-c8e7053fdb13/bin/uautomizer/data/b017f7480/dee98256d3bc433daa952fc09ae78811/FLAGd5fdca9ef [2019-11-15 21:20:44,873 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:20:44,874 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2d2a2c44-d3ff-45f6-8e07-c8e7053fdb13/sv-benchmarks/c/termination-memory-alloca/c.01_assume-alloca.i [2019-11-15 21:20:44,890 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2d2a2c44-d3ff-45f6-8e07-c8e7053fdb13/bin/uautomizer/data/b017f7480/dee98256d3bc433daa952fc09ae78811/FLAGd5fdca9ef [2019-11-15 21:20:45,208 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2d2a2c44-d3ff-45f6-8e07-c8e7053fdb13/bin/uautomizer/data/b017f7480/dee98256d3bc433daa952fc09ae78811 [2019-11-15 21:20:45,210 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:20:45,211 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:20:45,212 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:20:45,212 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:20:45,216 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:20:45,217 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:20:45" (1/1) ... [2019-11-15 21:20:45,219 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fcd116b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:45, skipping insertion in model container [2019-11-15 21:20:45,220 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:20:45" (1/1) ... [2019-11-15 21:20:45,227 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:20:45,283 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:20:45,697 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:20:45,710 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:20:45,759 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:20:45,820 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:20:45,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:45 WrapperNode [2019-11-15 21:20:45,821 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:20:45,822 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:20:45,822 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:20:45,822 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:20:45,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:45" (1/1) ... [2019-11-15 21:20:45,853 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:45" (1/1) ... [2019-11-15 21:20:45,888 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:20:45,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:20:45,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:20:45,889 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:20:45,899 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:45" (1/1) ... [2019-11-15 21:20:45,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:45" (1/1) ... [2019-11-15 21:20:45,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:45" (1/1) ... [2019-11-15 21:20:45,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:45" (1/1) ... [2019-11-15 21:20:45,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:45" (1/1) ... [2019-11-15 21:20:45,942 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:45" (1/1) ... [2019-11-15 21:20:45,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:45" (1/1) ... [2019-11-15 21:20:45,947 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:20:45,956 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:20:45,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:20:45,956 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:20:45,957 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2d2a2c44-d3ff-45f6-8e07-c8e7053fdb13/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:20:46,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:20:46,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:20:46,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:20:46,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:20:46,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:20:46,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:20:46,390 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:20:46,390 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 21:20:46,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:20:46 BoogieIcfgContainer [2019-11-15 21:20:46,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:20:46,392 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 21:20:46,392 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 21:20:46,397 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 21:20:46,398 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:20:46,398 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 09:20:45" (1/3) ... [2019-11-15 21:20:46,399 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@fd695c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:20:46, skipping insertion in model container [2019-11-15 21:20:46,399 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:20:46,399 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:45" (2/3) ... [2019-11-15 21:20:46,400 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@fd695c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:20:46, skipping insertion in model container [2019-11-15 21:20:46,400 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:20:46,400 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:20:46" (3/3) ... [2019-11-15 21:20:46,402 INFO L371 chiAutomizerObserver]: Analyzing ICFG c.01_assume-alloca.i [2019-11-15 21:20:46,454 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 21:20:46,455 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 21:20:46,455 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 21:20:46,455 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:20:46,455 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:20:46,455 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 21:20:46,455 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:20:46,455 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 21:20:46,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-11-15 21:20:46,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 21:20:46,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:20:46,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:20:46,503 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 21:20:46,503 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:20:46,503 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 21:20:46,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-11-15 21:20:46,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 21:20:46,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:20:46,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:20:46,505 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 21:20:46,506 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:20:46,515 INFO L791 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, 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_~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 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); 12#L553-3true [2019-11-15 21:20:46,515 INFO L793 eck$LassoCheckResult]: Loop: 12#L553-3true call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 9#L553-1true assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 13#L555-5true assume !true; 16#L555-6true call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 12#L553-3true [2019-11-15 21:20:46,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:46,522 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-15 21:20:46,531 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:46,531 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544984707] [2019-11-15 21:20:46,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:46,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:46,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:20:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:20:46,694 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:20:46,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:46,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1144712, now seen corresponding path program 1 times [2019-11-15 21:20:46,696 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:46,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009122407] [2019-11-15 21:20:46,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:46,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:46,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:46,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:20:46,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009122407] [2019-11-15 21:20:46,739 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:46,740 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:20:46,740 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262770056] [2019-11-15 21:20:46,745 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:20:46,747 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:46,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 21:20:46,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 21:20:46,766 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2019-11-15 21:20:46,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:46,774 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2019-11-15 21:20:46,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 21:20:46,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2019-11-15 21:20:46,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 21:20:46,782 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 9 states and 11 transitions. [2019-11-15 21:20:46,783 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 21:20:46,783 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-15 21:20:46,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2019-11-15 21:20:46,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:20:46,785 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-11-15 21:20:46,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2019-11-15 21:20:46,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-11-15 21:20:46,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-15 21:20:46,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-11-15 21:20:46,817 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-11-15 21:20:46,817 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-11-15 21:20:46,817 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 21:20:46,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2019-11-15 21:20:46,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 21:20:46,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:20:46,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:20:46,819 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 21:20:46,820 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 21:20:46,820 INFO L791 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 36#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, 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_~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 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); 37#L553-3 [2019-11-15 21:20:46,820 INFO L793 eck$LassoCheckResult]: Loop: 37#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 39#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 40#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 44#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 41#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 42#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 37#L553-3 [2019-11-15 21:20:46,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:46,821 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-15 21:20:46,822 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:46,822 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812600523] [2019-11-15 21:20:46,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:46,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:46,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:20:46,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:20:46,910 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:20:46,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:46,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1099516500, now seen corresponding path program 1 times [2019-11-15 21:20:46,911 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:46,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589212801] [2019-11-15 21:20:46,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:46,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:46,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:47,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:20:47,003 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589212801] [2019-11-15 21:20:47,003 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:47,003 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:20:47,004 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006888587] [2019-11-15 21:20:47,004 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:20:47,004 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:47,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:20:47,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:20:47,005 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 3 Second operand 5 states. [2019-11-15 21:20:47,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:47,123 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-11-15 21:20:47,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:20:47,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2019-11-15 21:20:47,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-11-15 21:20:47,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 21 transitions. [2019-11-15 21:20:47,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-15 21:20:47,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 21:20:47,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2019-11-15 21:20:47,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:20:47,127 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-15 21:20:47,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2019-11-15 21:20:47,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2019-11-15 21:20:47,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-15 21:20:47,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2019-11-15 21:20:47,130 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-11-15 21:20:47,130 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-11-15 21:20:47,130 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 21:20:47,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2019-11-15 21:20:47,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-15 21:20:47,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:20:47,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:20:47,131 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 21:20:47,132 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 21:20:47,132 INFO L791 eck$LassoCheckResult]: Stem: 74#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 72#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, 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_~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 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); 73#L553-3 [2019-11-15 21:20:47,132 INFO L793 eck$LassoCheckResult]: Loop: 73#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 75#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 76#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 80#L555-1 assume !test_fun_#t~short8; 83#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 81#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 73#L553-3 [2019-11-15 21:20:47,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:47,132 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-11-15 21:20:47,133 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:47,133 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260310368] [2019-11-15 21:20:47,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:47,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:47,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:20:47,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:20:47,161 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:20:47,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:47,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1099518422, now seen corresponding path program 1 times [2019-11-15 21:20:47,162 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:47,162 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129367073] [2019-11-15 21:20:47,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:47,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:47,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:47,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:20:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:20:47,184 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:20:47,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:47,184 INFO L82 PathProgramCache]: Analyzing trace with hash 179567640, now seen corresponding path program 1 times [2019-11-15 21:20:47,185 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:47,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759322493] [2019-11-15 21:20:47,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:47,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:47,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:20:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:20:47,257 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:20:47,525 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-11-15 21:20:47,820 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-11-15 21:20:47,935 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:20:47,936 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:20:47,936 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:20:47,936 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:20:47,937 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:20:47,937 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:20:47,937 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:20:47,937 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:20:47,938 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca.i_Iteration3_Lasso [2019-11-15 21:20:47,938 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:20:47,938 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:20:47,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:47,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:47,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:47,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:47,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:47,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-15 21:20:47,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:48,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-15 21:20:48,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:48,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:48,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:48,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:48,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-15 21:20:48,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-15 21:20:48,297 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-11-15 21:20:48,415 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-11-15 21:20:48,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:48,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:48,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:48,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:48,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:49,106 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 21:20:49,151 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:20:49,156 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:20:49,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:49,161 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:49,161 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:20:49,162 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:49,162 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:49,163 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:49,165 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:20:49,165 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:20:49,167 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:49,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:49,169 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:49,169 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:20:49,169 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:49,170 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:49,170 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:49,170 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:20:49,171 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:20:49,172 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:49,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:49,173 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:49,173 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:20:49,173 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:49,174 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:49,174 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:49,175 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:20:49,175 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:20:49,176 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:49,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:49,177 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:49,177 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:20:49,178 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:49,178 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:49,178 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:49,179 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:20:49,179 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:20:49,180 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:49,180 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:49,181 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:49,181 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:20:49,182 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:49,182 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:49,182 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:49,183 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:20:49,183 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:20:49,184 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:49,184 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:49,185 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:49,185 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:49,186 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:49,186 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:49,188 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:20:49,191 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:20:49,194 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:49,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:49,195 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:49,196 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:20:49,196 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:49,196 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:49,196 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:49,196 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:20:49,197 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:20:49,197 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:49,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:49,198 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:49,199 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:20:49,199 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:49,199 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:49,199 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:49,200 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:20:49,200 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:20:49,201 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:49,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:49,202 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:49,202 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:49,202 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:49,202 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:49,204 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:20:49,204 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:20:49,219 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:49,228 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:49,229 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:49,229 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:20:49,229 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:49,229 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:49,231 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:49,232 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:20:49,232 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:20:49,233 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:49,233 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:49,234 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:49,235 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:49,235 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:49,235 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:49,239 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:20:49,240 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:20:49,243 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:49,246 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:49,247 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:49,248 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:20:49,248 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:49,248 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:49,248 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:49,254 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:20:49,254 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:20:49,255 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:49,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:49,256 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:49,256 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:20:49,257 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:49,257 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:49,257 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:49,258 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:20:49,258 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:20:49,259 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:49,259 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:49,260 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:49,260 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:49,260 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:49,260 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:49,263 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:20:49,263 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:20:49,274 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:49,274 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:49,275 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:49,275 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:49,276 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:49,276 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:49,278 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:20:49,278 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:20:49,287 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:49,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:49,289 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:49,289 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:49,289 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:49,290 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:49,292 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:20:49,292 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:20:49,306 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:49,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:49,310 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:49,310 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:49,310 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:49,310 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:49,312 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:20:49,312 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:20:49,317 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:49,317 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:49,318 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:49,318 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:49,318 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:49,318 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:49,323 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:20:49,325 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:20:49,362 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:20:49,393 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 21:20:49,393 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 21:20:49,396 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:20:49,398 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:20:49,398 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:20:49,399 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) = 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 + 1 Supporting invariants [] [2019-11-15 21:20:49,434 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2019-11-15 21:20:49,443 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 21:20:49,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:49,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:20:49,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:20:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:49,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 21:20:49,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:20:49,580 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 30 treesize of output 25 [2019-11-15 21:20:49,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:49,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:49,595 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-15 21:20:49,597 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2019-11-15 21:20:49,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:20:49,673 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 21:20:49,674 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 4 Second operand 4 states. [2019-11-15 21:20:49,801 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 31 states and 40 transitions. Complement of second has 8 states. [2019-11-15 21:20:49,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 21:20:49,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 21:20:49,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-11-15 21:20:49,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 2 letters. Loop has 6 letters. [2019-11-15 21:20:49,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:20:49,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 8 letters. Loop has 6 letters. [2019-11-15 21:20:49,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:20:49,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 2 letters. Loop has 12 letters. [2019-11-15 21:20:49,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:20:49,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2019-11-15 21:20:49,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-15 21:20:49,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 30 states and 39 transitions. [2019-11-15 21:20:49,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-15 21:20:49,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-15 21:20:49,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 39 transitions. [2019-11-15 21:20:49,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:20:49,810 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-11-15 21:20:49,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 39 transitions. [2019-11-15 21:20:49,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2019-11-15 21:20:49,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-15 21:20:49,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2019-11-15 21:20:49,813 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-11-15 21:20:49,813 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-11-15 21:20:49,813 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 21:20:49,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2019-11-15 21:20:49,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-15 21:20:49,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:20:49,814 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:20:49,814 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 21:20:49,814 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:49,815 INFO L791 eck$LassoCheckResult]: Stem: 217#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 215#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, 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_~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 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); 216#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 222#L553-1 [2019-11-15 21:20:49,815 INFO L793 eck$LassoCheckResult]: Loop: 222#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 223#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 228#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 218#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 219#L556 assume !(test_fun_#t~mem9 <= 0);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(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 226#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 237#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 236#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 232#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 230#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 222#L553-1 [2019-11-15 21:20:49,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:49,815 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-11-15 21:20:49,815 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:49,815 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505489193] [2019-11-15 21:20:49,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:49,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:49,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:20:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:20:49,836 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:20:49,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:49,836 INFO L82 PathProgramCache]: Analyzing trace with hash 15750502, now seen corresponding path program 1 times [2019-11-15 21:20:49,836 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:49,836 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46769958] [2019-11-15 21:20:49,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:49,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:49,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:49,891 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-15 21:20:49,891 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46769958] [2019-11-15 21:20:49,891 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957018283] [2019-11-15 21:20:49,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2d2a2c44-d3ff-45f6-8e07-c8e7053fdb13/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-15 21:20:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:49,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:20:49,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:20:49,955 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 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:20:49,955 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:49,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:49,963 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:49,963 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-11-15 21:20:49,969 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 21:20:49,972 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:49,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:49,977 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:49,978 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-15 21:20:49,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:49,997 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-15 21:20:49,998 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:20:49,998 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-11-15 21:20:49,998 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032779469] [2019-11-15 21:20:49,998 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:20:49,998 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:49,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:20:49,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:20:49,999 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 7 states. [2019-11-15 21:20:50,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:50,109 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2019-11-15 21:20:50,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:20:50,110 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 60 transitions. [2019-11-15 21:20:50,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2019-11-15 21:20:50,113 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 60 transitions. [2019-11-15 21:20:50,113 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-15 21:20:50,113 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-15 21:20:50,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 60 transitions. [2019-11-15 21:20:50,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:20:50,114 INFO L688 BuchiCegarLoop]: Abstraction has 47 states and 60 transitions. [2019-11-15 21:20:50,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 60 transitions. [2019-11-15 21:20:50,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2019-11-15 21:20:50,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-15 21:20:50,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2019-11-15 21:20:50,118 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2019-11-15 21:20:50,119 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2019-11-15 21:20:50,119 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 21:20:50,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2019-11-15 21:20:50,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-15 21:20:50,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:20:50,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:20:50,121 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 21:20:50,121 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:50,121 INFO L791 eck$LassoCheckResult]: Stem: 331#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 329#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, 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_~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 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); 330#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 332#L553-1 [2019-11-15 21:20:50,121 INFO L793 eck$LassoCheckResult]: Loop: 332#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 333#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 344#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 336#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 337#L556 assume !(test_fun_#t~mem9 <= 0);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(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 340#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 353#L555-1 assume !test_fun_#t~short8; 350#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 346#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 342#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 332#L553-1 [2019-11-15 21:20:50,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:50,122 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2019-11-15 21:20:50,122 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:50,122 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112698201] [2019-11-15 21:20:50,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:50,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:50,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:20:50,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:20:50,153 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:20:50,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:50,158 INFO L82 PathProgramCache]: Analyzing trace with hash 15810084, now seen corresponding path program 1 times [2019-11-15 21:20:50,158 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:50,158 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360078065] [2019-11-15 21:20:50,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:50,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:50,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:20:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:20:50,205 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:20:50,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:50,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1871610631, now seen corresponding path program 1 times [2019-11-15 21:20:50,207 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:50,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074964669] [2019-11-15 21:20:50,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:50,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:50,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:20:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:20:50,278 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:20:50,531 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-11-15 21:20:50,750 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-11-15 21:20:50,840 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:20:50,840 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:20:50,840 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:20:50,840 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:20:50,840 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:20:50,840 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:20:50,840 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:20:50,840 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:20:50,841 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca.i_Iteration5_Lasso [2019-11-15 21:20:50,841 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:20:50,841 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:20:50,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:50,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:50,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:50,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:50,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:50,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:50,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:50,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:50,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:50,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:50,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:50,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:50,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:50,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:50,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:50,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:50,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:50,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:50,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:51,107 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-11-15 21:20:51,640 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 21:20:51,657 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:20:51,658 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:20:51,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:51,659 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:51,659 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:20:51,659 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:51,659 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:51,659 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:51,660 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:20:51,660 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:20:51,660 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:51,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:51,661 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:51,661 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:20:51,662 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:51,662 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:51,662 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:51,662 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:20:51,662 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:20:51,663 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:51,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:51,664 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:51,664 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:51,664 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:51,664 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:51,665 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:20:51,665 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:20:51,667 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:51,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:51,668 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:51,668 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:20:51,668 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:51,668 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:51,668 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:51,668 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:20:51,669 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:20:51,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:51,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:51,670 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:51,670 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:20:51,670 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:51,670 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:51,670 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:51,671 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:20:51,671 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:20:51,671 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:51,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:51,672 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:51,672 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:20:51,673 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:51,673 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:51,673 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:51,673 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:20:51,673 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:20:51,674 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:51,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:51,675 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:51,675 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:51,675 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:51,675 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:51,676 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:20:51,676 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:20:51,678 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:51,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:51,679 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:51,679 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:51,679 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:51,679 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:51,681 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:20:51,681 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:20:51,683 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:51,684 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:51,684 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:51,684 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:20:51,684 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:51,685 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:51,685 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:51,685 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:20:51,685 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:20:51,686 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:51,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:51,687 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:51,687 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:20:51,687 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:51,687 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:51,687 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:51,688 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:20:51,688 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:20:51,688 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:51,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:51,689 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:51,689 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:20:51,689 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:51,690 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:51,690 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:51,690 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:20:51,690 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:20:51,691 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:51,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:51,692 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:51,692 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:51,692 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:51,692 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:51,693 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:20:51,693 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:20:51,695 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:51,695 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:51,696 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:51,696 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:20:51,696 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:51,696 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:51,696 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:51,697 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:20:51,697 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:20:51,698 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:51,698 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:51,698 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:51,699 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:20:51,699 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:51,699 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:51,699 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:51,699 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:20:51,699 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:20:51,700 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:51,701 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:51,701 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:51,701 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:20:51,701 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:51,701 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:51,702 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:51,702 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:20:51,702 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:20:51,703 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:51,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:51,703 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:51,704 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:51,704 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:51,704 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:51,705 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:20:51,705 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:20:51,707 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:51,707 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:51,708 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:51,708 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:51,708 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:51,708 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:51,709 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:20:51,709 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:20:51,712 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:51,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:51,713 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:51,713 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:20:51,713 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:51,713 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:51,713 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:51,714 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:20:51,714 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:20:51,715 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:51,715 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:51,715 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:51,716 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:51,716 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:51,716 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:51,719 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:20:51,719 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:20:51,735 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:51,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:51,735 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:51,736 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:51,736 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:51,736 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:51,737 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:20:51,737 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:20:51,743 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:51,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:51,744 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:51,744 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:51,744 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:51,745 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:51,746 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:20:51,746 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:20:51,753 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:51,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:51,754 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:51,754 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:51,754 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:51,755 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:51,756 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:20:51,756 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:20:51,761 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:51,762 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:51,762 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:51,762 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:51,763 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:51,763 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:51,764 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:20:51,765 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:20:51,780 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:20:51,795 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:20:51,796 INFO L444 ModelExtractionUtils]: 16 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 21:20:51,796 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:20:51,797 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:20:51,797 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:20:51,798 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-15 21:20:51,855 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-11-15 21:20:51,856 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 21:20:51,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:51,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:20:51,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:20:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:51,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 21:20:51,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:20:51,958 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:51,959 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 42 [2019-11-15 21:20:51,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:51,961 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:51,992 INFO L567 ElimStorePlain]: treesize reduction 16, result has 59.0 percent of original size [2019-11-15 21:20:51,993 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:51,993 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:23 [2019-11-15 21:20:52,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:52,203 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:52,203 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 69 [2019-11-15 21:20:52,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:52,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:52,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:52,258 INFO L567 ElimStorePlain]: treesize reduction 27, result has 53.4 percent of original size [2019-11-15 21:20:52,259 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:52,259 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:30 [2019-11-15 21:20:52,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:52,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:52,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:52,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:52,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:52,547 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-11-15 21:20:52,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:52,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:20:52,651 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 0 case distinctions, treesize of input 54 treesize of output 33 [2019-11-15 21:20:52,652 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:52,659 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:52,660 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 1 case distinctions, treesize of input 54 treesize of output 33 [2019-11-15 21:20:52,660 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:52,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:52,694 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-15 21:20:52,695 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:109, output treesize:77 [2019-11-15 21:20:52,769 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-15 21:20:52,770 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2019-11-15 21:20:52,770 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 45 transitions. cyclomatic complexity: 13 Second operand 10 states. [2019-11-15 21:20:53,090 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 31 [2019-11-15 21:20:53,339 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2019-11-15 21:20:53,421 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 45 transitions. cyclomatic complexity: 13. Second operand 10 states. Result 118 states and 150 transitions. Complement of second has 19 states. [2019-11-15 21:20:53,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2019-11-15 21:20:53,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-15 21:20:53,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 29 transitions. [2019-11-15 21:20:53,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 29 transitions. Stem has 3 letters. Loop has 10 letters. [2019-11-15 21:20:53,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:20:53,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 29 transitions. Stem has 13 letters. Loop has 10 letters. [2019-11-15 21:20:53,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:20:53,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 29 transitions. Stem has 3 letters. Loop has 20 letters. [2019-11-15 21:20:53,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:20:53,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 150 transitions. [2019-11-15 21:20:53,428 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 [2019-11-15 21:20:53,430 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 113 states and 145 transitions. [2019-11-15 21:20:53,430 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-11-15 21:20:53,430 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-11-15 21:20:53,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 145 transitions. [2019-11-15 21:20:53,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:20:53,431 INFO L688 BuchiCegarLoop]: Abstraction has 113 states and 145 transitions. [2019-11-15 21:20:53,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 145 transitions. [2019-11-15 21:20:53,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2019-11-15 21:20:53,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-15 21:20:53,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 131 transitions. [2019-11-15 21:20:53,440 INFO L711 BuchiCegarLoop]: Abstraction has 99 states and 131 transitions. [2019-11-15 21:20:53,440 INFO L591 BuchiCegarLoop]: Abstraction has 99 states and 131 transitions. [2019-11-15 21:20:53,440 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 21:20:53,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 131 transitions. [2019-11-15 21:20:53,443 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2019-11-15 21:20:53,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:20:53,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:20:53,443 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 21:20:53,444 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 1, 1, 1, 1] [2019-11-15 21:20:53,444 INFO L791 eck$LassoCheckResult]: Stem: 617#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 615#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, 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_~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 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); 616#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 679#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 619#L555-5 [2019-11-15 21:20:53,444 INFO L793 eck$LassoCheckResult]: Loop: 619#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 637#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 622#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 623#L556 assume !(test_fun_#t~mem9 <= 0);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(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 626#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 629#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 662#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 659#L556 assume !(test_fun_#t~mem9 <= 0);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(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 658#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 642#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 643#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 634#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 631#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 618#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 619#L555-5 [2019-11-15 21:20:53,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:53,445 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2019-11-15 21:20:53,445 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:53,445 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098179304] [2019-11-15 21:20:53,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:53,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:53,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:20:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:20:53,463 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:20:53,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:53,464 INFO L82 PathProgramCache]: Analyzing trace with hash 527155748, now seen corresponding path program 2 times [2019-11-15 21:20:53,464 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:53,464 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575172464] [2019-11-15 21:20:53,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:53,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:53,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:20:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:20:53,502 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:20:53,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:53,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1781235253, now seen corresponding path program 1 times [2019-11-15 21:20:53,503 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:53,504 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253342882] [2019-11-15 21:20:53,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:53,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:53,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:53,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:53,592 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:20:53,593 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253342882] [2019-11-15 21:20:53,593 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389153323] [2019-11-15 21:20:53,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2d2a2c44-d3ff-45f6-8e07-c8e7053fdb13/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-15 21:20:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:53,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:20:53,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:20:53,715 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 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:20:53,715 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:53,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:53,719 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:53,719 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-11-15 21:20:53,728 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 21:20:53,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:53,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:53,739 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:53,739 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-15 21:20:53,750 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 21:20:53,750 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:53,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:53,752 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:53,752 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-15 21:20:53,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:53,763 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:20:53,763 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:20:53,763 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-11-15 21:20:53,763 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543848203] [2019-11-15 21:20:54,106 WARN L191 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 95 [2019-11-15 21:20:54,171 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:54,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:20:54,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:20:54,171 INFO L87 Difference]: Start difference. First operand 99 states and 131 transitions. cyclomatic complexity: 38 Second operand 9 states. [2019-11-15 21:20:54,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:54,360 INFO L93 Difference]: Finished difference Result 141 states and 177 transitions. [2019-11-15 21:20:54,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:20:54,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 177 transitions. [2019-11-15 21:20:54,364 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2019-11-15 21:20:54,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 139 states and 175 transitions. [2019-11-15 21:20:54,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2019-11-15 21:20:54,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2019-11-15 21:20:54,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 175 transitions. [2019-11-15 21:20:54,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:20:54,368 INFO L688 BuchiCegarLoop]: Abstraction has 139 states and 175 transitions. [2019-11-15 21:20:54,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 175 transitions. [2019-11-15 21:20:54,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 109. [2019-11-15 21:20:54,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-15 21:20:54,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 143 transitions. [2019-11-15 21:20:54,379 INFO L711 BuchiCegarLoop]: Abstraction has 109 states and 143 transitions. [2019-11-15 21:20:54,379 INFO L591 BuchiCegarLoop]: Abstraction has 109 states and 143 transitions. [2019-11-15 21:20:54,379 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 21:20:54,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 143 transitions. [2019-11-15 21:20:54,380 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2019-11-15 21:20:54,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:20:54,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:20:54,380 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 21:20:54,380 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-15 21:20:54,381 INFO L791 eck$LassoCheckResult]: Stem: 928#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 926#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, 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_~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 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); 927#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 985#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 930#L555-5 [2019-11-15 21:20:54,381 INFO L793 eck$LassoCheckResult]: Loop: 930#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 943#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 968#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 966#L556 assume !(test_fun_#t~mem9 <= 0);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(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 967#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 947#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 933#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 934#L556 assume !(test_fun_#t~mem9 <= 0);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(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 937#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 965#L555-1 assume !test_fun_#t~short8; 981#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 980#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 969#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 929#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 930#L555-5 [2019-11-15 21:20:54,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:54,381 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2019-11-15 21:20:54,381 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:54,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779092299] [2019-11-15 21:20:54,381 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:54,381 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:54,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:20:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:20:54,400 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:20:54,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:54,401 INFO L82 PathProgramCache]: Analyzing trace with hash 529002790, now seen corresponding path program 2 times [2019-11-15 21:20:54,401 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:54,401 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789768528] [2019-11-15 21:20:54,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:54,402 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:54,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:54,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:20:54,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:20:54,427 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:20:54,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:54,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1779388211, now seen corresponding path program 2 times [2019-11-15 21:20:54,428 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:54,428 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567894191] [2019-11-15 21:20:54,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:54,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:54,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:54,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:20:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:20:54,495 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:20:54,901 WARN L191 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 92 [2019-11-15 21:20:55,128 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2019-11-15 21:20:55,201 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:20:55,201 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:20:55,201 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:20:55,201 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:20:55,201 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:20:55,201 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:20:55,201 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:20:55,201 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:20:55,202 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca.i_Iteration7_Lasso [2019-11-15 21:20:55,202 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:20:55,202 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:20:55,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:55,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:55,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:55,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:55,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:55,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:55,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:55,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:55,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:55,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:55,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:55,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:55,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:55,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:55,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:55,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:55,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:55,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:55,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:55,441 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-11-15 21:20:55,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:55,885 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 21:20:55,955 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:20:55,955 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:20:55,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:55,956 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:55,957 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:20:55,957 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:55,957 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:55,957 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:55,958 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:20:55,958 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:20:55,959 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:55,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:55,960 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:55,960 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:20:55,960 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:55,960 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:55,960 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:55,960 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:20:55,961 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:20:55,961 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:55,962 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:55,962 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:55,962 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:20:55,962 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:55,962 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:55,963 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:55,963 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:20:55,963 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:20:55,963 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:55,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:55,964 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:55,964 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:55,965 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:55,965 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:55,966 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:20:55,966 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:20:55,968 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:55,969 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:55,970 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:55,970 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:20:55,970 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:55,970 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:55,971 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:55,971 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:20:55,971 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:20:55,972 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:55,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-15 21:20:55,973 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:55,973 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:20:55,973 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:55,974 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:55,974 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:55,974 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:20:55,974 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:20:55,975 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:55,975 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:55,976 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:55,976 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:55,976 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:55,977 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:55,977 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:20:55,978 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:20:55,980 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:55,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:55,981 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:55,981 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:55,982 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:55,982 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:55,983 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:20:55,983 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:20:55,984 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:55,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:55,985 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:55,985 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:20:55,986 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:55,986 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:55,986 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:55,986 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:20:55,987 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:20:55,987 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:55,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:55,988 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:55,989 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:55,989 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:55,989 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:55,990 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:20:55,990 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:20:55,992 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:55,992 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:55,993 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:55,993 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:20:55,993 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:55,994 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:55,994 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:55,994 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:20:55,994 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:20:55,995 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:55,996 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:55,996 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:55,996 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:20:55,997 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:55,997 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:55,997 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:55,997 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:20:55,998 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:20:55,998 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:55,999 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:55,999 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:56,000 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:20:56,000 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:56,000 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:56,000 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:56,001 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:20:56,001 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:20:56,001 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:56,002 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:56,002 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:56,003 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:20:56,003 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:56,003 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:56,003 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:56,004 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:20:56,004 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:20:56,004 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:56,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:56,006 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:56,006 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:20:56,006 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:56,006 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:56,006 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:56,007 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:20:56,007 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:20:56,008 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:56,008 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:56,009 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:56,009 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:56,009 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:56,009 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:56,010 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:20:56,011 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:20:56,012 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:56,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:56,013 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:56,013 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:20:56,014 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:56,014 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:56,014 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:56,014 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:20:56,015 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:20:56,015 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:56,016 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:56,016 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:56,017 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:20:56,017 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:56,017 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:56,017 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:56,018 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:20:56,018 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:20:56,018 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:56,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:56,019 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:56,020 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:56,020 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:56,020 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:56,021 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:20:56,021 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:20:56,026 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:20:56,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:20:56,027 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:20:56,028 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:20:56,028 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:20:56,028 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:20:56,030 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:20:56,030 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:20:56,071 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:20:56,096 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 21:20:56,097 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 21:20:56,097 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:20:56,098 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:20:56,098 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:20:56,099 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-15 21:20:56,140 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-11-15 21:20:56,141 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 21:20:56,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:56,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:20:56,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:20:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:56,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 21:20:56,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:20:56,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:56,318 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:56,318 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 66 [2019-11-15 21:20:56,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:56,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:56,321 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:56,361 INFO L567 ElimStorePlain]: treesize reduction 43, result has 53.8 percent of original size [2019-11-15 21:20:56,362 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:56,362 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:49 [2019-11-15 21:20:56,455 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:56,455 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 1 case distinctions, treesize of input 62 treesize of output 41 [2019-11-15 21:20:56,456 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:56,475 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 62 treesize of output 41 [2019-11-15 21:20:56,476 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:56,506 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:56,507 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 21:20:56,507 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:125, output treesize:121 [2019-11-15 21:20:56,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:56,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:20:56,568 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:56,568 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 77 treesize of output 52 [2019-11-15 21:20:56,569 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:56,574 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 77 treesize of output 52 [2019-11-15 21:20:56,575 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:56,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:56,602 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 21:20:56,603 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:155, output treesize:121 [2019-11-15 21:20:56,646 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:20:56,647 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2019-11-15 21:20:56,647 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 143 transitions. cyclomatic complexity: 40 Second operand 8 states. [2019-11-15 21:20:57,192 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 143 transitions. cyclomatic complexity: 40. Second operand 8 states. Result 281 states and 357 transitions. Complement of second has 27 states. [2019-11-15 21:20:57,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2019-11-15 21:20:57,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 21:20:57,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 32 transitions. [2019-11-15 21:20:57,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 32 transitions. Stem has 4 letters. Loop has 14 letters. [2019-11-15 21:20:57,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:20:57,195 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:20:57,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:57,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:20:57,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:20:57,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:57,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 21:20:57,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:20:57,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:57,317 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:57,318 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 66 [2019-11-15 21:20:57,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:57,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:57,320 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:57,351 INFO L567 ElimStorePlain]: treesize reduction 43, result has 53.8 percent of original size [2019-11-15 21:20:57,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:20:57,352 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:49 [2019-11-15 21:20:57,413 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:57,413 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 1 case distinctions, treesize of input 62 treesize of output 41 [2019-11-15 21:20:57,414 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:57,422 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 62 treesize of output 41 [2019-11-15 21:20:57,423 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:57,451 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:57,451 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 21:20:57,451 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:125, output treesize:121 [2019-11-15 21:20:57,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:20:57,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:20:57,512 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:57,512 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 77 treesize of output 52 [2019-11-15 21:20:57,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:57,523 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 77 treesize of output 52 [2019-11-15 21:20:57,524 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:20:57,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:20:57,565 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 21:20:57,566 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:155, output treesize:121 [2019-11-15 21:20:57,621 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:20:57,622 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2019-11-15 21:20:57,622 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 143 transitions. cyclomatic complexity: 40 Second operand 8 states. [2019-11-15 21:20:58,499 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 143 transitions. cyclomatic complexity: 40. Second operand 8 states. Result 361 states and 453 transitions. Complement of second has 31 states. [2019-11-15 21:20:58,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 1 stem states 14 non-accepting loop states 1 accepting loop states [2019-11-15 21:20:58,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 21:20:58,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 35 transitions. [2019-11-15 21:20:58,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 35 transitions. Stem has 4 letters. Loop has 14 letters. [2019-11-15 21:20:58,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:20:58,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 35 transitions. Stem has 18 letters. Loop has 14 letters. [2019-11-15 21:20:58,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:20:58,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 35 transitions. Stem has 4 letters. Loop has 28 letters. [2019-11-15 21:20:58,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:20:58,503 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 361 states and 453 transitions. [2019-11-15 21:20:58,510 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2019-11-15 21:20:58,514 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 361 states to 290 states and 370 transitions. [2019-11-15 21:20:58,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2019-11-15 21:20:58,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2019-11-15 21:20:58,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 290 states and 370 transitions. [2019-11-15 21:20:58,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:20:58,515 INFO L688 BuchiCegarLoop]: Abstraction has 290 states and 370 transitions. [2019-11-15 21:20:58,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states and 370 transitions. [2019-11-15 21:20:58,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 233. [2019-11-15 21:20:58,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-11-15 21:20:58,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 304 transitions. [2019-11-15 21:20:58,541 INFO L711 BuchiCegarLoop]: Abstraction has 233 states and 304 transitions. [2019-11-15 21:20:58,541 INFO L591 BuchiCegarLoop]: Abstraction has 233 states and 304 transitions. [2019-11-15 21:20:58,541 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 21:20:58,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 233 states and 304 transitions. [2019-11-15 21:20:58,543 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2019-11-15 21:20:58,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:20:58,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:20:58,544 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:20:58,544 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:20:58,544 INFO L791 eck$LassoCheckResult]: Stem: 1956#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1954#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, 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_~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 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); 1955#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1957#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1958#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 1971#L555-1 [2019-11-15 21:20:58,544 INFO L793 eck$LassoCheckResult]: Loop: 1971#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 1962#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1963#L556 assume !(test_fun_#t~mem9 <= 0);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(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 1966#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 1971#L555-1 [2019-11-15 21:20:58,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:58,545 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2019-11-15 21:20:58,545 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:58,545 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442530016] [2019-11-15 21:20:58,545 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:58,545 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:58,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:20:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:20:58,560 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:20:58,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:58,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1547289, now seen corresponding path program 1 times [2019-11-15 21:20:58,561 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:58,562 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745169853] [2019-11-15 21:20:58,562 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:58,562 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:58,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:20:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:20:58,571 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:20:58,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:58,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1271571777, now seen corresponding path program 1 times [2019-11-15 21:20:58,572 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:58,572 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537588155] [2019-11-15 21:20:58,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:58,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:58,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:20:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:20:58,594 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:20:58,748 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-11-15 21:20:58,865 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-15 21:20:59,149 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2019-11-15 21:20:59,686 WARN L191 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 88 [2019-11-15 21:20:59,688 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:20:59,688 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:20:59,688 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:20:59,688 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:20:59,689 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:20:59,689 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:20:59,689 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:20:59,689 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:20:59,689 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca.i_Iteration8_Lasso [2019-11-15 21:20:59,689 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:20:59,689 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:20:59,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:59,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:59,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:59,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:59,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:59,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:59,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:59,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:59,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:20:59,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:00,224 WARN L191 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-11-15 21:21:00,332 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-11-15 21:21:00,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:00,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:00,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:00,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:00,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:00,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:00,721 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 21:21:00,905 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-11-15 21:21:01,025 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-11-15 21:21:01,062 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:21:01,062 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:21:01,063 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:01,063 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:01,063 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:21:01,063 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:01,064 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:01,064 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:01,064 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:21:01,064 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:21:01,064 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:01,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:01,065 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:01,065 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:01,065 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:01,065 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:01,066 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:21:01,066 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:21:01,067 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:01,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:01,068 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:01,068 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:21:01,068 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:01,068 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:01,068 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:01,069 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:21:01,069 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:21:01,069 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:01,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:01,070 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:01,070 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:21:01,070 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:01,070 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:01,070 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:01,071 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:21:01,071 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:21:01,071 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:01,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:01,072 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:01,072 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:01,072 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:01,072 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:01,073 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:21:01,073 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:21:01,074 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:01,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:01,076 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:01,076 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:21:01,077 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:01,077 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:01,077 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:01,077 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:21:01,077 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:21:01,078 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:01,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:01,079 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:01,079 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:21:01,079 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:01,079 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:01,079 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:01,080 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:21:01,080 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:21:01,080 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:01,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:01,081 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:01,081 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:01,082 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:01,082 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:01,082 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:21:01,083 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:21:01,084 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:01,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:01,085 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:01,085 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:21:01,085 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:01,086 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:01,086 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:01,086 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:21:01,087 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:21:01,087 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:01,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:01,088 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:01,088 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 21:21:01,088 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:01,088 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:01,091 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 21:21:01,091 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:21:01,099 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:01,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:01,100 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:01,100 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:01,101 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:01,101 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:01,102 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:21:01,103 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:21:01,112 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:01,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:01,113 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:01,113 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:01,113 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:01,113 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:01,114 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:21:01,114 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:21:01,115 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:01,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:01,116 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:01,117 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 21:21:01,117 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 21:21:01,117 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:01,128 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-15 21:21:01,128 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 21:21:01,390 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:21:02,222 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 21:21:02,222 INFO L444 ModelExtractionUtils]: 35 out of 46 variables were initially zero. Simplification set additionally 8 variables to zero. [2019-11-15 21:21:02,222 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:21:02,224 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-11-15 21:21:02,224 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:21:02,224 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4 + 2147483647 Supporting invariants [] [2019-11-15 21:21:02,274 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-11-15 21:21:02,276 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 21:21:02,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:02,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:21:02,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:21:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:02,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:21:02,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:21:02,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:02,381 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2019-11-15 21:21:02,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:02,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:02,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:02,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:41 [2019-11-15 21:21:02,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:21:02,433 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-15 21:21:02,434 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 233 states and 304 transitions. cyclomatic complexity: 84 Second operand 5 states. [2019-11-15 21:21:02,483 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 233 states and 304 transitions. cyclomatic complexity: 84. Second operand 5 states. Result 372 states and 485 transitions. Complement of second has 9 states. [2019-11-15 21:21:02,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 21:21:02,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 21:21:02,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2019-11-15 21:21:02,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-15 21:21:02,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:21:02,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-15 21:21:02,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:21:02,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 8 letters. [2019-11-15 21:21:02,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:21:02,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 372 states and 485 transitions. [2019-11-15 21:21:02,494 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2019-11-15 21:21:02,497 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 372 states to 317 states and 410 transitions. [2019-11-15 21:21:02,497 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2019-11-15 21:21:02,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2019-11-15 21:21:02,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 317 states and 410 transitions. [2019-11-15 21:21:02,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:21:02,501 INFO L688 BuchiCegarLoop]: Abstraction has 317 states and 410 transitions. [2019-11-15 21:21:02,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states and 410 transitions. [2019-11-15 21:21:02,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 266. [2019-11-15 21:21:02,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-15 21:21:02,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 349 transitions. [2019-11-15 21:21:02,529 INFO L711 BuchiCegarLoop]: Abstraction has 266 states and 349 transitions. [2019-11-15 21:21:02,530 INFO L591 BuchiCegarLoop]: Abstraction has 266 states and 349 transitions. [2019-11-15 21:21:02,530 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 21:21:02,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 266 states and 349 transitions. [2019-11-15 21:21:02,533 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2019-11-15 21:21:02,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:21:02,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:21:02,535 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:21:02,535 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:21:02,536 INFO L791 eck$LassoCheckResult]: Stem: 2661#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2659#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, 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_~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 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); 2660#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 2676#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2842#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 2807#L555-1 assume !test_fun_#t~short8; 2737#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 2732#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 2686#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 2687#L553-1 [2019-11-15 21:21:02,536 INFO L793 eck$LassoCheckResult]: Loop: 2687#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2735#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 2725#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 2662#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2663#L556 assume !(test_fun_#t~mem9 <= 0);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(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 2707#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 2693#L555-1 assume !test_fun_#t~short8; 2695#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 2679#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 2680#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 2687#L553-1 [2019-11-15 21:21:02,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:02,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1271629551, now seen corresponding path program 2 times [2019-11-15 21:21:02,537 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:21:02,537 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072880831] [2019-11-15 21:21:02,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:02,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:02,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:21:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:21:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:21:02,565 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:21:02,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:02,566 INFO L82 PathProgramCache]: Analyzing trace with hash 15810084, now seen corresponding path program 3 times [2019-11-15 21:21:02,566 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:21:02,566 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864158602] [2019-11-15 21:21:02,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:02,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:02,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:21:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:21:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:21:02,584 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:21:02,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:02,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1831564178, now seen corresponding path program 3 times [2019-11-15 21:21:02,585 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:21:02,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634848335] [2019-11-15 21:21:02,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:02,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:02,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:21:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:02,748 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:21:02,749 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634848335] [2019-11-15 21:21:02,749 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791338101] [2019-11-15 21:21:02,749 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2d2a2c44-d3ff-45f6-8e07-c8e7053fdb13/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:21:02,870 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-15 21:21:02,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:21:02,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-15 21:21:02,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:21:02,887 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-15 21:21:02,888 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:02,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:02,892 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:02,892 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2019-11-15 21:21:02,897 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:21:02,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:02,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:02,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:02,903 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-11-15 21:21:02,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:02,973 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 36 treesize of output 23 [2019-11-15 21:21:02,974 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:02,981 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:02,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:02,982 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:25 [2019-11-15 21:21:03,001 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 26 treesize of output 21 [2019-11-15 21:21:03,001 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:03,009 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:03,009 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:03,009 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2019-11-15 21:21:03,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:03,055 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:21:03,055 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:21:03,055 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2019-11-15 21:21:03,055 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852917281] [2019-11-15 21:21:03,325 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-11-15 21:21:03,379 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:21:03,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 21:21:03,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:21:03,379 INFO L87 Difference]: Start difference. First operand 266 states and 349 transitions. cyclomatic complexity: 98 Second operand 12 states. [2019-11-15 21:21:03,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:21:03,529 INFO L93 Difference]: Finished difference Result 313 states and 355 transitions. [2019-11-15 21:21:03,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:21:03,531 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 313 states and 355 transitions. [2019-11-15 21:21:03,533 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2019-11-15 21:21:03,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 313 states to 139 states and 158 transitions. [2019-11-15 21:21:03,535 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2019-11-15 21:21:03,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2019-11-15 21:21:03,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 158 transitions. [2019-11-15 21:21:03,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:21:03,535 INFO L688 BuchiCegarLoop]: Abstraction has 139 states and 158 transitions. [2019-11-15 21:21:03,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 158 transitions. [2019-11-15 21:21:03,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 130. [2019-11-15 21:21:03,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-15 21:21:03,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 149 transitions. [2019-11-15 21:21:03,544 INFO L711 BuchiCegarLoop]: Abstraction has 130 states and 149 transitions. [2019-11-15 21:21:03,544 INFO L591 BuchiCegarLoop]: Abstraction has 130 states and 149 transitions. [2019-11-15 21:21:03,544 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 21:21:03,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 149 transitions. [2019-11-15 21:21:03,545 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2019-11-15 21:21:03,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:21:03,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:21:03,547 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:21:03,547 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-15 21:21:03,547 INFO L791 eck$LassoCheckResult]: Stem: 3315#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3313#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, 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_~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 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); 3314#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3359#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3358#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3353#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3354#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3349#L556 assume !(test_fun_#t~mem9 <= 0);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(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3350#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3346#L555-1 assume !test_fun_#t~short8; 3345#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 3344#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 3342#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3330#L553-1 [2019-11-15 21:21:03,547 INFO L793 eck$LassoCheckResult]: Loop: 3330#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3409#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3406#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3404#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3402#L556 assume !(test_fun_#t~mem9 <= 0);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(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3399#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3397#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3394#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3395#L556 assume !(test_fun_#t~mem9 <= 0);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(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3388#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3389#L555-1 assume !test_fun_#t~short8; 3340#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 3341#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 3329#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3330#L553-1 [2019-11-15 21:21:03,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:03,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1871610631, now seen corresponding path program 4 times [2019-11-15 21:21:03,548 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:21:03,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031732418] [2019-11-15 21:21:03,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:03,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:03,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:21:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:21:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:21:03,586 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:21:03,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:03,588 INFO L82 PathProgramCache]: Analyzing trace with hash 535533500, now seen corresponding path program 4 times [2019-11-15 21:21:03,588 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:21:03,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489852404] [2019-11-15 21:21:03,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:03,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:03,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:21:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:21:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:21:03,616 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:21:03,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:03,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1585620926, now seen corresponding path program 5 times [2019-11-15 21:21:03,617 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:21:03,617 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762997673] [2019-11-15 21:21:03,617 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:03,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:03,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:21:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:03,877 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:21:03,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762997673] [2019-11-15 21:21:03,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6670362] [2019-11-15 21:21:03,878 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2d2a2c44-d3ff-45f6-8e07-c8e7053fdb13/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:21:04,005 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-11-15 21:21:04,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:21:04,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 21:21:04,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:21:04,012 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 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:21:04,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:04,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:04,015 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:04,015 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-11-15 21:21:04,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:04,111 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:04,111 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 63 [2019-11-15 21:21:04,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:04,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:04,113 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:04,146 INFO L567 ElimStorePlain]: treesize reduction 24, result has 48.9 percent of original size [2019-11-15 21:21:04,146 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:04,147 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:23 [2019-11-15 21:21:04,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:04,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:21:04,280 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:04,281 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 47 treesize of output 30 [2019-11-15 21:21:04,281 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:04,289 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 47 treesize of output 30 [2019-11-15 21:21:04,290 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:04,329 INFO L567 ElimStorePlain]: treesize reduction 37, result has 43.1 percent of original size [2019-11-15 21:21:04,329 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:04,329 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:95, output treesize:28 [2019-11-15 21:21:04,380 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:04,380 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 62 [2019-11-15 21:21:04,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:04,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:04,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:04,420 INFO L567 ElimStorePlain]: treesize reduction 24, result has 56.4 percent of original size [2019-11-15 21:21:04,420 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:04,421 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:30 [2019-11-15 21:21:04,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:04,491 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 21:21:04,491 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:21:04,491 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2019-11-15 21:21:04,491 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992116933] [2019-11-15 21:21:04,778 WARN L191 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 92 [2019-11-15 21:21:04,815 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:21:04,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-15 21:21:04,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-11-15 21:21:04,816 INFO L87 Difference]: Start difference. First operand 130 states and 149 transitions. cyclomatic complexity: 27 Second operand 21 states. [2019-11-15 21:21:05,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:21:05,247 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2019-11-15 21:21:05,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 21:21:05,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 113 transitions. [2019-11-15 21:21:05,255 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:21:05,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 69 states and 78 transitions. [2019-11-15 21:21:05,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-11-15 21:21:05,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-15 21:21:05,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 78 transitions. [2019-11-15 21:21:05,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:21:05,256 INFO L688 BuchiCegarLoop]: Abstraction has 69 states and 78 transitions. [2019-11-15 21:21:05,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 78 transitions. [2019-11-15 21:21:05,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 42. [2019-11-15 21:21:05,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-15 21:21:05,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2019-11-15 21:21:05,258 INFO L711 BuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2019-11-15 21:21:05,258 INFO L591 BuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2019-11-15 21:21:05,258 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-15 21:21:05,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 49 transitions. [2019-11-15 21:21:05,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:21:05,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:21:05,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:21:05,259 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-15 21:21:05,259 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:21:05,259 INFO L791 eck$LassoCheckResult]: Stem: 3673#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3671#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, 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_~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 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); 3672#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3678#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3679#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3709#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3708#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3707#L556 assume !(test_fun_#t~mem9 <= 0);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(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3706#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3705#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3704#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3703#L556 assume !(test_fun_#t~mem9 <= 0);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(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3702#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3691#L555-1 assume !test_fun_#t~short8; 3689#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 3688#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 3687#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3680#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3681#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3685#L555-1 [2019-11-15 21:21:05,259 INFO L793 eck$LassoCheckResult]: Loop: 3685#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3674#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3675#L556 assume !(test_fun_#t~mem9 <= 0);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(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3682#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3685#L555-1 [2019-11-15 21:21:05,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:05,260 INFO L82 PathProgramCache]: Analyzing trace with hash 673540324, now seen corresponding path program 6 times [2019-11-15 21:21:05,260 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:21:05,260 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124175607] [2019-11-15 21:21:05,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:05,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:05,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:21:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:21:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:21:05,341 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:21:05,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:05,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1547289, now seen corresponding path program 2 times [2019-11-15 21:21:05,342 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:21:05,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816855631] [2019-11-15 21:21:05,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:05,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:05,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:21:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:21:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:21:05,351 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:21:05,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:05,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1405606780, now seen corresponding path program 7 times [2019-11-15 21:21:05,352 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:21:05,352 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148537889] [2019-11-15 21:21:05,352 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:05,353 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:05,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:21:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:21:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:21:05,422 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:21:05,574 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-11-15 21:21:05,705 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-15 21:21:07,452 WARN L191 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 201 DAG size of output: 153 [2019-11-15 21:21:07,601 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-15 21:21:07,603 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:21:07,603 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:21:07,603 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:21:07,603 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:21:07,603 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:21:07,603 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:21:07,604 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:21:07,604 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:21:07,604 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca.i_Iteration11_Lasso [2019-11-15 21:21:07,604 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:21:07,604 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:21:07,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:07,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:07,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:07,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:07,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:07,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:07,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:07,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:07,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:07,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:07,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:07,800 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-11-15 21:21:07,907 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-11-15 21:21:07,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:07,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:07,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:07,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:07,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:07,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:07,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:08,270 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 21:21:08,437 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-11-15 21:21:08,512 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:21:08,512 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:21:08,512 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:08,513 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:08,513 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:21:08,513 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:08,513 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:08,513 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:08,514 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:21:08,514 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:21:08,514 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:08,514 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:08,515 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:08,515 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:08,515 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:08,515 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:08,516 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:21:08,516 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:21:08,517 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:08,518 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:08,519 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:08,519 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:08,519 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:08,519 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:08,520 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:21:08,520 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:21:08,521 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:08,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:08,522 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:08,522 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:21:08,522 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:08,522 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:08,523 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:08,523 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:21:08,523 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:21:08,523 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:08,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:08,524 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:08,525 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:21:08,525 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:08,525 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:08,525 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:08,525 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:21:08,526 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:21:08,526 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:08,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:08,527 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:08,527 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:08,527 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:08,527 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:08,528 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:21:08,528 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:21:08,530 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:08,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:08,531 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:08,531 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:21:08,531 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:08,531 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:08,531 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:08,532 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:21:08,532 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:21:08,532 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:08,533 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:08,533 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:08,533 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:21:08,534 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:08,534 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:08,534 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:08,534 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:21:08,534 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:21:08,535 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:08,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:08,536 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:08,536 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:21:08,536 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:08,536 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:08,537 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:08,537 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:21:08,537 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:21:08,537 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:08,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:08,538 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:08,539 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:21:08,539 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:08,539 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:08,539 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:08,539 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:21:08,540 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:21:08,540 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:08,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:08,541 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:08,541 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 21:21:08,541 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:08,542 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:08,543 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 21:21:08,543 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:21:08,551 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:08,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:08,552 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:08,552 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:08,552 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 21:21:08,552 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:08,561 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-15 21:21:08,561 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 21:21:09,010 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:21:09,222 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 21:21:09,222 INFO L444 ModelExtractionUtils]: 35 out of 46 variables were initially zero. Simplification set additionally 8 variables to zero. [2019-11-15 21:21:09,223 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:21:09,226 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-11-15 21:21:09,226 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:21:09,227 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_5) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_5 + 2147483647 Supporting invariants [] [2019-11-15 21:21:09,282 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-11-15 21:21:09,283 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 21:21:09,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:09,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:21:09,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:21:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:09,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:21:09,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:21:09,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:09,460 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2019-11-15 21:21:09,461 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:09,473 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:09,473 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:09,474 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:44 [2019-11-15 21:21:09,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:21:09,498 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-15 21:21:09,498 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-11-15 21:21:09,537 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 56 states and 66 transitions. Complement of second has 9 states. [2019-11-15 21:21:09,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 21:21:09,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 21:21:09,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-15 21:21:09,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 19 letters. Loop has 4 letters. [2019-11-15 21:21:09,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:21:09,539 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:21:09,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:09,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:21:09,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:21:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:09,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:21:09,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:21:09,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:09,655 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2019-11-15 21:21:09,656 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:09,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:09,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:09,671 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:44 [2019-11-15 21:21:09,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:21:09,713 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-15 21:21:09,713 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-11-15 21:21:09,777 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 55 states and 64 transitions. Complement of second has 11 states. [2019-11-15 21:21:09,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-15 21:21:09,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 21:21:09,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2019-11-15 21:21:09,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 19 letters. Loop has 4 letters. [2019-11-15 21:21:09,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:21:09,778 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:21:09,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:09,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:09,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:21:09,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:21:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:09,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:21:09,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:21:09,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:21:09,892 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2019-11-15 21:21:09,892 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:09,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:09,906 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:09,907 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:41 [2019-11-15 21:21:09,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:21:09,929 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-15 21:21:09,929 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-11-15 21:21:09,973 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 69 states and 84 transitions. Complement of second has 10 states. [2019-11-15 21:21:09,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 21:21:09,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 21:21:09,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-11-15 21:21:09,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 19 letters. Loop has 4 letters. [2019-11-15 21:21:09,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:21:09,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 23 letters. Loop has 4 letters. [2019-11-15 21:21:09,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:21:09,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 19 letters. Loop has 8 letters. [2019-11-15 21:21:09,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:21:09,976 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 84 transitions. [2019-11-15 21:21:09,977 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:21:09,977 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 0 states and 0 transitions. [2019-11-15 21:21:09,977 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 21:21:09,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 21:21:09,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 21:21:09,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:21:09,978 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:21:09,978 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:21:09,978 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:21:09,978 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-15 21:21:09,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:21:09,979 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:21:09,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 21:21:09,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 09:21:09 BoogieIcfgContainer [2019-11-15 21:21:09,986 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 21:21:09,986 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:21:09,987 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:21:09,987 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:21:09,987 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:20:46" (3/4) ... [2019-11-15 21:21:09,990 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 21:21:09,991 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:21:09,992 INFO L168 Benchmark]: Toolchain (without parser) took 24781.14 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 520.1 MB). Free memory was 944.7 MB in the beginning and 1.4 GB in the end (delta: -501.2 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:09,995 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:21:09,996 INFO L168 Benchmark]: CACSL2BoogieTranslator took 609.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -166.0 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:09,996 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.62 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:09,996 INFO L168 Benchmark]: Boogie Preprocessor took 66.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:21:09,997 INFO L168 Benchmark]: RCFGBuilder took 436.16 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.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:09,997 INFO L168 Benchmark]: BuchiAutomizer took 23593.77 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 392.2 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -363.4 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:09,998 INFO L168 Benchmark]: Witness Printer took 4.46 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:21:10,002 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 609.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -166.0 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.62 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 436.16 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.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 23593.77 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 392.2 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -363.4 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.46 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 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 - 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 11 terminating modules (6 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[x_ref][x_ref] + 1 and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 10 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 16 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 2147483647 and consists of 5 locations. One nondeterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 2147483647 and consists of 5 locations. 6 modules have a trivial ranking function, the largest among these consists of 21 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 23.5s and 12 iterations. TraceHistogramMax:4. Analysis of lassos took 17.0s. Construction of modules took 1.1s. Büchi inclusion checks took 5.1s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 8. Automata minimization 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 210 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 266 states and ocurred in iteration 8. Nontrivial modules had stage [3, 1, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/13 HoareTripleCheckerStatistics: 93 SDtfs, 186 SDslu, 85 SDs, 0 SdLazy, 814 SolverSat, 173 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital371 mio100 ax105 hnf99 lsp83 ukn57 mio100 lsp33 div100 bol105 ite100 ukn100 eq168 hnf89 smp95 dnf211 smp79 tf100 neg95 sie119 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 1108ms VariablesStem: 8 VariablesLoop: 8 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 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...